/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:06:52,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:06:52,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:06:52,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:06:52,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:06:52,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:06:52,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:06:52,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:06:52,811 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:06:52,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:06:52,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:06:52,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:06:52,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:06:52,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:06:52,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:06:52,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:06:52,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:06:52,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:06:52,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:06:52,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:06:52,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:06:52,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:06:52,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:06:52,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:06:52,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:06:52,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:06:52,829 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:06:52,830 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:06:52,830 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:06:52,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:06:52,831 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:06:52,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:06:52,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:06:52,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:06:52,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:06:52,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:06:52,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:06:52,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:06:52,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:06:52,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:06:52,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:06:52,838 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:06:52,852 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:06:52,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:06:52,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:06:52,853 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:06:52,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:06:52,854 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:06:52,854 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:06:52,854 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:06:52,854 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:06:52,854 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:06:52,855 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:06:52,855 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:06:52,855 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:06:52,855 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:06:52,855 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:06:52,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:06:52,856 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:06:52,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:06:52,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:06:52,856 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:06:52,856 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:06:52,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:06:52,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:06:52,857 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:06:52,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:06:52,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:06:52,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:06:52,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:06:52,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:06:53,021 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:06:53,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:06:53,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:06:53,039 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:06:53,039 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:06:53,040 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:06:53,146 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_QN2ZE_/tmp/136e40b858f2423e94dd0fdd444c896f/FLAG66b6483e4 [2020-07-01 13:06:53,486 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:06:53,487 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:06:53,487 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:06:53,494 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_QN2ZE_/tmp/136e40b858f2423e94dd0fdd444c896f/FLAG66b6483e4 [2020-07-01 13:06:53,895 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_QN2ZE_/tmp/136e40b858f2423e94dd0fdd444c896f [2020-07-01 13:06:53,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:06:53,908 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:06:53,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:06:53,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:06:53,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:06:53,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:06:53" (1/1) ... [2020-07-01 13:06:53,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c315d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:53, skipping insertion in model container [2020-07-01 13:06:53,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:06:53" (1/1) ... [2020-07-01 13:06:53,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:06:53,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:06:54,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:06:54,201 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:06:54,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:06:54,237 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:06:54,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54 WrapperNode [2020-07-01 13:06:54,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:06:54,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:06:54,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:06:54,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:06:54,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:06:54,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:06:54,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:06:54,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:06:54,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:06:54,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:06:54,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:06:54,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:06:54,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:06:54,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:06:54,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:06:54,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:06:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:06:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:06:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:06:54,687 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:06:54,688 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 13:06:54,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:06:54 BoogieIcfgContainer [2020-07-01 13:06:54,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:06:54,693 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:06:54,693 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:06:54,695 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:06:54,696 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:06:54" (1/1) ... [2020-07-01 13:06:54,715 INFO L313 BlockEncoder]: Initial Icfg 43 locations, 50 edges [2020-07-01 13:06:54,716 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:06:54,717 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:06:54,718 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:06:54,718 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:06:54,720 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:06:54,720 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:06:54,721 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:06:54,752 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:06:54,794 INFO L200 BlockEncoder]: SBE split 23 edges [2020-07-01 13:06:54,799 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 13:06:54,801 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:06:54,830 INFO L100 BaseMinimizeStates]: Removed 12 edges and 6 locations by large block encoding [2020-07-01 13:06:54,833 INFO L70 RemoveSinkStates]: Removed 25 edges and 2 locations by removing sink states [2020-07-01 13:06:54,835 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:06:54,835 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:06:54,836 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:06:54,836 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:06:54,837 INFO L313 BlockEncoder]: Encoded RCFG 35 locations, 72 edges [2020-07-01 13:06:54,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:06:54 BasicIcfg [2020-07-01 13:06:54,838 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:06:54,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:06:54,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:06:54,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:06:54,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:06:53" (1/4) ... [2020-07-01 13:06:54,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b05801b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:06:54, skipping insertion in model container [2020-07-01 13:06:54,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (2/4) ... [2020-07-01 13:06:54,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b05801b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:06:54, skipping insertion in model container [2020-07-01 13:06:54,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:06:54" (3/4) ... [2020-07-01 13:06:54,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b05801b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:06:54, skipping insertion in model container [2020-07-01 13:06:54,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:06:54" (4/4) ... [2020-07-01 13:06:54,846 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:06:54,857 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:06:54,864 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2020-07-01 13:06:54,878 INFO L251 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2020-07-01 13:06:54,902 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:06:54,902 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:06:54,902 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:06:54,902 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:06:54,903 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:06:54,903 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:06:54,903 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:06:54,903 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:06:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-01 13:06:54,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:06:54,925 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:54,926 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:06:54,926 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:54,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:54,932 INFO L82 PathProgramCache]: Analyzing trace with hash 253520800, now seen corresponding path program 1 times [2020-07-01 13:06:54,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:54,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960059396] [2020-07-01 13:06:54,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:55,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960059396] [2020-07-01 13:06:55,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:55,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:55,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059265213] [2020-07-01 13:06:55,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:55,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:55,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:55,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,121 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-01 13:06:55,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:55,263 INFO L93 Difference]: Finished difference Result 66 states and 135 transitions. [2020-07-01 13:06:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:55,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:06:55,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:55,279 INFO L225 Difference]: With dead ends: 66 [2020-07-01 13:06:55,279 INFO L226 Difference]: Without dead ends: 35 [2020-07-01 13:06:55,282 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-01 13:06:55,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-01 13:06:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-01 13:06:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 67 transitions. [2020-07-01 13:06:55,323 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 67 transitions. Word has length 5 [2020-07-01 13:06:55,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:55,323 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 67 transitions. [2020-07-01 13:06:55,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 67 transitions. [2020-07-01 13:06:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:06:55,324 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:55,324 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:06:55,324 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:06:55,324 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:55,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:55,325 INFO L82 PathProgramCache]: Analyzing trace with hash 253520831, now seen corresponding path program 1 times [2020-07-01 13:06:55,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:55,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181622009] [2020-07-01 13:06:55,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:55,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181622009] [2020-07-01 13:06:55,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:55,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:55,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140618070] [2020-07-01 13:06:55,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:55,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:55,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:55,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,381 INFO L87 Difference]: Start difference. First operand 35 states and 67 transitions. Second operand 3 states. [2020-07-01 13:06:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:55,477 INFO L93 Difference]: Finished difference Result 35 states and 67 transitions. [2020-07-01 13:06:55,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:55,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:06:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:55,479 INFO L225 Difference]: With dead ends: 35 [2020-07-01 13:06:55,479 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 13:06:55,480 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 13:06:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 13:06:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 13:06:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 65 transitions. [2020-07-01 13:06:55,486 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 65 transitions. Word has length 5 [2020-07-01 13:06:55,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:55,486 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 65 transitions. [2020-07-01 13:06:55,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 65 transitions. [2020-07-01 13:06:55,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:06:55,487 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:55,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:06:55,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:06:55,487 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:55,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:55,488 INFO L82 PathProgramCache]: Analyzing trace with hash 253520833, now seen corresponding path program 1 times [2020-07-01 13:06:55,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:55,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414484614] [2020-07-01 13:06:55,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:55,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:55,523 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414484614] [2020-07-01 13:06:55,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:55,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:55,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421469523] [2020-07-01 13:06:55,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:55,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:55,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:55,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,524 INFO L87 Difference]: Start difference. First operand 34 states and 65 transitions. Second operand 3 states. [2020-07-01 13:06:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:55,631 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2020-07-01 13:06:55,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:55,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:06:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:55,632 INFO L225 Difference]: With dead ends: 35 [2020-07-01 13:06:55,633 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 13:06:55,633 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 13:06:55,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 13:06:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 13:06:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 64 transitions. [2020-07-01 13:06:55,638 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 64 transitions. Word has length 5 [2020-07-01 13:06:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:55,639 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 64 transitions. [2020-07-01 13:06:55,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:55,639 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 64 transitions. [2020-07-01 13:06:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:06:55,639 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:55,640 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:06:55,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:06:55,640 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:55,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:55,640 INFO L82 PathProgramCache]: Analyzing trace with hash 253520834, now seen corresponding path program 1 times [2020-07-01 13:06:55,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:55,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799622074] [2020-07-01 13:06:55,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:55,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:55,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799622074] [2020-07-01 13:06:55,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:55,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:06:55,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246357875] [2020-07-01 13:06:55,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:06:55,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:55,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:06:55,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:06:55,678 INFO L87 Difference]: Start difference. First operand 34 states and 64 transitions. Second operand 4 states. [2020-07-01 13:06:55,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:55,786 INFO L93 Difference]: Finished difference Result 34 states and 64 transitions. [2020-07-01 13:06:55,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:06:55,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 13:06:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:55,788 INFO L225 Difference]: With dead ends: 34 [2020-07-01 13:06:55,788 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 13:06:55,788 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:06:55,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 13:06:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 13:06:55,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 13:06:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 63 transitions. [2020-07-01 13:06:55,794 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 63 transitions. Word has length 5 [2020-07-01 13:06:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:55,794 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 63 transitions. [2020-07-01 13:06:55,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:06:55,794 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 63 transitions. [2020-07-01 13:06:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:06:55,795 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:55,795 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:06:55,795 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:06:55,795 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:55,796 INFO L82 PathProgramCache]: Analyzing trace with hash -730790274, now seen corresponding path program 1 times [2020-07-01 13:06:55,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:55,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944020130] [2020-07-01 13:06:55,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:55,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:55,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944020130] [2020-07-01 13:06:55,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:55,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:55,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536112307] [2020-07-01 13:06:55,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:55,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:55,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:55,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,826 INFO L87 Difference]: Start difference. First operand 33 states and 63 transitions. Second operand 3 states. [2020-07-01 13:06:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:55,937 INFO L93 Difference]: Finished difference Result 33 states and 63 transitions. [2020-07-01 13:06:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:55,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:06:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:55,939 INFO L225 Difference]: With dead ends: 33 [2020-07-01 13:06:55,939 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 13:06:55,939 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 13:06:55,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 13:06:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 13:06:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 61 transitions. [2020-07-01 13:06:55,944 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 61 transitions. Word has length 6 [2020-07-01 13:06:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:55,945 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 61 transitions. [2020-07-01 13:06:55,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 61 transitions. [2020-07-01 13:06:55,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:06:55,945 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:55,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:06:55,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:06:55,946 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:55,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:55,946 INFO L82 PathProgramCache]: Analyzing trace with hash -730790272, now seen corresponding path program 1 times [2020-07-01 13:06:55,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:55,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639228020] [2020-07-01 13:06:55,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:55,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639228020] [2020-07-01 13:06:55,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:55,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:06:55,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847839409] [2020-07-01 13:06:55,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:06:55,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:55,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:06:55,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:06:55,985 INFO L87 Difference]: Start difference. First operand 32 states and 61 transitions. Second operand 4 states. [2020-07-01 13:06:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:56,063 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2020-07-01 13:06:56,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:06:56,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 13:06:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:56,065 INFO L225 Difference]: With dead ends: 33 [2020-07-01 13:06:56,065 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 13:06:56,066 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:06:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 13:06:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 13:06:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 13:06:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 60 transitions. [2020-07-01 13:06:56,071 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 60 transitions. Word has length 6 [2020-07-01 13:06:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:56,071 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 60 transitions. [2020-07-01 13:06:56,071 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:06:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 60 transitions. [2020-07-01 13:06:56,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:06:56,072 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:56,072 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:06:56,072 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:06:56,073 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:56,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:56,073 INFO L82 PathProgramCache]: Analyzing trace with hash -730790271, now seen corresponding path program 1 times [2020-07-01 13:06:56,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:56,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893067655] [2020-07-01 13:06:56,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:56,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893067655] [2020-07-01 13:06:56,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:56,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:56,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033428750] [2020-07-01 13:06:56,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:56,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:56,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:56,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,111 INFO L87 Difference]: Start difference. First operand 32 states and 60 transitions. Second operand 3 states. [2020-07-01 13:06:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:56,204 INFO L93 Difference]: Finished difference Result 32 states and 60 transitions. [2020-07-01 13:06:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:56,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:06:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:56,205 INFO L225 Difference]: With dead ends: 32 [2020-07-01 13:06:56,205 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 13:06:56,205 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 13:06:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 13:06:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 13:06:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 59 transitions. [2020-07-01 13:06:56,210 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 59 transitions. Word has length 6 [2020-07-01 13:06:56,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:56,210 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 59 transitions. [2020-07-01 13:06:56,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 59 transitions. [2020-07-01 13:06:56,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:06:56,211 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:56,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:06:56,212 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:06:56,212 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:56,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:56,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1179659637, now seen corresponding path program 1 times [2020-07-01 13:06:56,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:56,213 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837137905] [2020-07-01 13:06:56,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:56,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:56,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837137905] [2020-07-01 13:06:56,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:56,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:06:56,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585342589] [2020-07-01 13:06:56,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:06:56,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:56,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:06:56,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:06:56,253 INFO L87 Difference]: Start difference. First operand 31 states and 59 transitions. Second operand 4 states. [2020-07-01 13:06:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:56,389 INFO L93 Difference]: Finished difference Result 58 states and 110 transitions. [2020-07-01 13:06:56,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:06:56,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 13:06:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:56,391 INFO L225 Difference]: With dead ends: 58 [2020-07-01 13:06:56,391 INFO L226 Difference]: Without dead ends: 56 [2020-07-01 13:06:56,392 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:06:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-01 13:06:56,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 34. [2020-07-01 13:06:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 13:06:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2020-07-01 13:06:56,398 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 7 [2020-07-01 13:06:56,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:56,399 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2020-07-01 13:06:56,399 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:06:56,399 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2020-07-01 13:06:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:06:56,400 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:56,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:06:56,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:06:56,400 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:56,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:56,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1179659640, now seen corresponding path program 1 times [2020-07-01 13:06:56,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:56,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869339318] [2020-07-01 13:06:56,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:56,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869339318] [2020-07-01 13:06:56,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:56,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:06:56,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417497040] [2020-07-01 13:06:56,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:06:56,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:56,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:06:56,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:06:56,435 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 4 states. [2020-07-01 13:06:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:56,524 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2020-07-01 13:06:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:06:56,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 13:06:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:56,526 INFO L225 Difference]: With dead ends: 34 [2020-07-01 13:06:56,526 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 13:06:56,526 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:06:56,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 13:06:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 13:06:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 13:06:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 62 transitions. [2020-07-01 13:06:56,532 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 62 transitions. Word has length 7 [2020-07-01 13:06:56,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:56,532 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 62 transitions. [2020-07-01 13:06:56,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:06:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 62 transitions. [2020-07-01 13:06:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 13:06:56,533 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:56,533 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:06:56,533 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 13:06:56,533 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:56,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:56,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1179659638, now seen corresponding path program 1 times [2020-07-01 13:06:56,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:56,534 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624722571] [2020-07-01 13:06:56,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:56,594 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624722571] [2020-07-01 13:06:56,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:56,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 13:06:56,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891118668] [2020-07-01 13:06:56,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 13:06:56,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:56,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 13:06:56,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:06:56,596 INFO L87 Difference]: Start difference. First operand 32 states and 62 transitions. Second operand 6 states. [2020-07-01 13:06:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:56,777 INFO L93 Difference]: Finished difference Result 52 states and 100 transitions. [2020-07-01 13:06:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 13:06:56,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-01 13:06:56,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:56,778 INFO L225 Difference]: With dead ends: 52 [2020-07-01 13:06:56,779 INFO L226 Difference]: Without dead ends: 50 [2020-07-01 13:06:56,779 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:06:56,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-01 13:06:56,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 32. [2020-07-01 13:06:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 13:06:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 60 transitions. [2020-07-01 13:06:56,784 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 60 transitions. Word has length 7 [2020-07-01 13:06:56,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:56,785 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 60 transitions. [2020-07-01 13:06:56,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 13:06:56,785 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 60 transitions. [2020-07-01 13:06:56,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 13:06:56,785 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:56,785 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:06:56,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 13:06:56,786 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:56,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:56,786 INFO L82 PathProgramCache]: Analyzing trace with hash 218387369, now seen corresponding path program 1 times [2020-07-01 13:06:56,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:56,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850891634] [2020-07-01 13:06:56,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:56,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850891634] [2020-07-01 13:06:56,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:56,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:56,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597302752] [2020-07-01 13:06:56,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:56,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:56,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:56,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,820 INFO L87 Difference]: Start difference. First operand 32 states and 60 transitions. Second operand 3 states. [2020-07-01 13:06:56,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:56,893 INFO L93 Difference]: Finished difference Result 34 states and 60 transitions. [2020-07-01 13:06:56,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:56,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-07-01 13:06:56,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:56,894 INFO L225 Difference]: With dead ends: 34 [2020-07-01 13:06:56,894 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 13:06:56,895 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 13:06:56,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 13:06:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 13:06:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 58 transitions. [2020-07-01 13:06:56,899 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 58 transitions. Word has length 9 [2020-07-01 13:06:56,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:56,900 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 58 transitions. [2020-07-01 13:06:56,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 58 transitions. [2020-07-01 13:06:56,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 13:06:56,900 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:56,901 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:06:56,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 13:06:56,901 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:56,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:56,901 INFO L82 PathProgramCache]: Analyzing trace with hash 218387370, now seen corresponding path program 1 times [2020-07-01 13:06:56,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:56,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838542950] [2020-07-01 13:06:56,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:56,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:56,930 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838542950] [2020-07-01 13:06:56,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:56,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:06:56,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984330163] [2020-07-01 13:06:56,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:56,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:56,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:56,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,932 INFO L87 Difference]: Start difference. First operand 32 states and 58 transitions. Second operand 3 states. [2020-07-01 13:06:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:56,982 INFO L93 Difference]: Finished difference Result 32 states and 58 transitions. [2020-07-01 13:06:56,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:56,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-07-01 13:06:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:56,983 INFO L225 Difference]: With dead ends: 32 [2020-07-01 13:06:56,983 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 13:06:56,984 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 13:06:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 13:06:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 13:06:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 52 transitions. [2020-07-01 13:06:56,987 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 52 transitions. Word has length 9 [2020-07-01 13:06:56,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:56,988 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 52 transitions. [2020-07-01 13:06:56,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 52 transitions. [2020-07-01 13:06:56,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:06:56,988 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:56,988 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:06:56,989 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 13:06:56,989 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:56,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:56,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1819856768, now seen corresponding path program 1 times [2020-07-01 13:06:56,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:56,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420442089] [2020-07-01 13:06:56,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:57,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420442089] [2020-07-01 13:06:57,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:57,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:06:57,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89429371] [2020-07-01 13:06:57,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:06:57,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:57,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:06:57,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 13:06:57,023 INFO L87 Difference]: Start difference. First operand 28 states and 52 transitions. Second operand 4 states. [2020-07-01 13:06:57,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:57,100 INFO L93 Difference]: Finished difference Result 28 states and 52 transitions. [2020-07-01 13:06:57,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:06:57,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 13:06:57,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:57,101 INFO L225 Difference]: With dead ends: 28 [2020-07-01 13:06:57,101 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 13:06:57,101 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:06:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 13:06:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 13:06:57,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 13:06:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 46 transitions. [2020-07-01 13:06:57,105 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 46 transitions. Word has length 10 [2020-07-01 13:06:57,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:57,105 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 46 transitions. [2020-07-01 13:06:57,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:06:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 46 transitions. [2020-07-01 13:06:57,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 13:06:57,106 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:57,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:06:57,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 13:06:57,107 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:57,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:57,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1819856766, now seen corresponding path program 1 times [2020-07-01 13:06:57,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:57,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391338741] [2020-07-01 13:06:57,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:57,169 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391338741] [2020-07-01 13:06:57,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:57,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 13:06:57,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738945868] [2020-07-01 13:06:57,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 13:06:57,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:57,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 13:06:57,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:06:57,171 INFO L87 Difference]: Start difference. First operand 25 states and 46 transitions. Second operand 6 states. [2020-07-01 13:06:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:57,325 INFO L93 Difference]: Finished difference Result 39 states and 77 transitions. [2020-07-01 13:06:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 13:06:57,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-01 13:06:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:57,327 INFO L225 Difference]: With dead ends: 39 [2020-07-01 13:06:57,327 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 13:06:57,327 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:06:57,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 13:06:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2020-07-01 13:06:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 13:06:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 65 transitions. [2020-07-01 13:06:57,332 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 65 transitions. Word has length 10 [2020-07-01 13:06:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:57,332 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 65 transitions. [2020-07-01 13:06:57,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 13:06:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 65 transitions. [2020-07-01 13:06:57,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-01 13:06:57,333 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:57,333 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:06:57,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 13:06:57,334 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:57,334 INFO L82 PathProgramCache]: Analyzing trace with hash 511782636, now seen corresponding path program 1 times [2020-07-01 13:06:57,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:57,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596848260] [2020-07-01 13:06:57,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:57,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596848260] [2020-07-01 13:06:57,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:57,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:06:57,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727370033] [2020-07-01 13:06:57,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:06:57,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:57,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:06:57,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:57,361 INFO L87 Difference]: Start difference. First operand 32 states and 65 transitions. Second operand 3 states. [2020-07-01 13:06:57,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:57,430 INFO L93 Difference]: Finished difference Result 59 states and 126 transitions. [2020-07-01 13:06:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:06:57,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-07-01 13:06:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:57,431 INFO L225 Difference]: With dead ends: 59 [2020-07-01 13:06:57,431 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 13:06:57,432 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:06:57,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 13:06:57,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 13:06:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 13:06:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 69 transitions. [2020-07-01 13:06:57,437 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 69 transitions. Word has length 14 [2020-07-01 13:06:57,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:57,437 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 69 transitions. [2020-07-01 13:06:57,438 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:06:57,438 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 69 transitions. [2020-07-01 13:06:57,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 13:06:57,438 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:57,438 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:06:57,439 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 13:06:57,439 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:57,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:57,439 INFO L82 PathProgramCache]: Analyzing trace with hash -2098247839, now seen corresponding path program 1 times [2020-07-01 13:06:57,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:57,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470361476] [2020-07-01 13:06:57,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:57,522 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470361476] [2020-07-01 13:06:57,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:57,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-01 13:06:57,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821264556] [2020-07-01 13:06:57,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 13:06:57,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:57,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 13:06:57,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:06:57,523 INFO L87 Difference]: Start difference. First operand 36 states and 69 transitions. Second operand 8 states. [2020-07-01 13:06:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:57,728 INFO L93 Difference]: Finished difference Result 69 states and 133 transitions. [2020-07-01 13:06:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 13:06:57,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-07-01 13:06:57,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:57,729 INFO L225 Difference]: With dead ends: 69 [2020-07-01 13:06:57,730 INFO L226 Difference]: Without dead ends: 38 [2020-07-01 13:06:57,730 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-07-01 13:06:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-01 13:06:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-07-01 13:06:57,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 13:06:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 70 transitions. [2020-07-01 13:06:57,735 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 70 transitions. Word has length 16 [2020-07-01 13:06:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:57,735 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 70 transitions. [2020-07-01 13:06:57,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 13:06:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 70 transitions. [2020-07-01 13:06:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 13:06:57,736 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:57,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:06:57,737 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-01 13:06:57,737 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:57,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2070294903, now seen corresponding path program 1 times [2020-07-01 13:06:57,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:57,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955774556] [2020-07-01 13:06:57,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:57,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955774556] [2020-07-01 13:06:57,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:57,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 13:06:57,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30616826] [2020-07-01 13:06:57,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:06:57,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:57,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:06:57,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-01 13:06:57,779 INFO L87 Difference]: Start difference. First operand 37 states and 70 transitions. Second operand 5 states. [2020-07-01 13:06:57,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:57,933 INFO L93 Difference]: Finished difference Result 89 states and 178 transitions. [2020-07-01 13:06:57,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 13:06:57,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-01 13:06:57,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:57,934 INFO L225 Difference]: With dead ends: 89 [2020-07-01 13:06:57,934 INFO L226 Difference]: Without dead ends: 61 [2020-07-01 13:06:57,935 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 13:06:57,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-01 13:06:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2020-07-01 13:06:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 13:06:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 90 transitions. [2020-07-01 13:06:57,940 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 90 transitions. Word has length 16 [2020-07-01 13:06:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:57,941 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 90 transitions. [2020-07-01 13:06:57,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:06:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 90 transitions. [2020-07-01 13:06:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 13:06:57,942 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:57,942 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:06:57,942 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-01 13:06:57,942 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:57,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2070293942, now seen corresponding path program 1 times [2020-07-01 13:06:57,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:57,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454013173] [2020-07-01 13:06:57,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:58,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454013173] [2020-07-01 13:06:58,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:06:58,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-01 13:06:58,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29827919] [2020-07-01 13:06:58,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 13:06:58,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:58,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 13:06:58,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-01 13:06:58,031 INFO L87 Difference]: Start difference. First operand 43 states and 90 transitions. Second operand 7 states. [2020-07-01 13:06:58,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:58,196 INFO L93 Difference]: Finished difference Result 85 states and 178 transitions. [2020-07-01 13:06:58,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 13:06:58,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-07-01 13:06:58,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:58,197 INFO L225 Difference]: With dead ends: 85 [2020-07-01 13:06:58,197 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 13:06:58,198 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-01 13:06:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 13:06:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-01 13:06:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 13:06:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 89 transitions. [2020-07-01 13:06:58,202 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 89 transitions. Word has length 16 [2020-07-01 13:06:58,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:58,203 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 89 transitions. [2020-07-01 13:06:58,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 13:06:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 89 transitions. [2020-07-01 13:06:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 13:06:58,204 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:58,204 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:06:58,204 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-01 13:06:58,204 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:58,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:58,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1208994071, now seen corresponding path program 1 times [2020-07-01 13:06:58,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:58,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598881631] [2020-07-01 13:06:58,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:58,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598881631] [2020-07-01 13:06:58,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088563879] [2020-07-01 13:06:58,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:06:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:58,416 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-01 13:06:58,422 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:06:58,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 13:06:58,491 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:06:58,502 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:06:58,505 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 13:06:58,505 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-07-01 13:06:58,600 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:06:58,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-07-01 13:06:58,602 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:06:58,605 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:06:58,617 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:06:58,620 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 13:06:58,623 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 13:06:58,624 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 13:06:58,624 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-07-01 13:06:58,657 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:06:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:58,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:06:58,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-01 13:06:58,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528833616] [2020-07-01 13:06:58,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-01 13:06:58,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:58,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-01 13:06:58,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-01 13:06:58,680 INFO L87 Difference]: Start difference. First operand 43 states and 89 transitions. Second operand 13 states. [2020-07-01 13:06:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:59,470 INFO L93 Difference]: Finished difference Result 54 states and 101 transitions. [2020-07-01 13:06:59,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 13:06:59,470 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2020-07-01 13:06:59,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:59,471 INFO L225 Difference]: With dead ends: 54 [2020-07-01 13:06:59,471 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 13:06:59,472 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2020-07-01 13:06:59,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 13:06:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2020-07-01 13:06:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-01 13:06:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 87 transitions. [2020-07-01 13:06:59,478 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 87 transitions. Word has length 16 [2020-07-01 13:06:59,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:59,479 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 87 transitions. [2020-07-01 13:06:59,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-01 13:06:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 87 transitions. [2020-07-01 13:06:59,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 13:06:59,479 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:59,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:06:59,680 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:06:59,681 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:06:59,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:06:59,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1208994072, now seen corresponding path program 1 times [2020-07-01 13:06:59,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:06:59,681 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974621153] [2020-07-01 13:06:59,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:06:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:59,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974621153] [2020-07-01 13:06:59,726 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363282471] [2020-07-01 13:06:59,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:06:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:06:59,772 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 13:06:59,773 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:06:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:06:59,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:06:59,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-07-01 13:06:59,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546879679] [2020-07-01 13:06:59,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:06:59,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:06:59,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:06:59,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 13:06:59,785 INFO L87 Difference]: Start difference. First operand 44 states and 87 transitions. Second operand 4 states. [2020-07-01 13:06:59,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:06:59,878 INFO L93 Difference]: Finished difference Result 49 states and 93 transitions. [2020-07-01 13:06:59,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:06:59,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-07-01 13:06:59,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:06:59,880 INFO L225 Difference]: With dead ends: 49 [2020-07-01 13:06:59,880 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 13:06:59,880 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-01 13:06:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 13:06:59,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2020-07-01 13:06:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 13:06:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 76 transitions. [2020-07-01 13:06:59,886 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 76 transitions. Word has length 16 [2020-07-01 13:06:59,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:06:59,886 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 76 transitions. [2020-07-01 13:06:59,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:06:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 76 transitions. [2020-07-01 13:06:59,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 13:06:59,887 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:06:59,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:00,088 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:00,088 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:07:00,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:00,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1209669325, now seen corresponding path program 1 times [2020-07-01 13:07:00,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:00,089 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200096733] [2020-07-01 13:07:00,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:00,109 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200096733] [2020-07-01 13:07:00,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:07:00,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:07:00,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990997687] [2020-07-01 13:07:00,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:07:00,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:00,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:07:00,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:00,110 INFO L87 Difference]: Start difference. First operand 37 states and 76 transitions. Second operand 3 states. [2020-07-01 13:07:00,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:00,165 INFO L93 Difference]: Finished difference Result 65 states and 141 transitions. [2020-07-01 13:07:00,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:07:00,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-01 13:07:00,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:00,166 INFO L225 Difference]: With dead ends: 65 [2020-07-01 13:07:00,167 INFO L226 Difference]: Without dead ends: 37 [2020-07-01 13:07:00,167 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:07:00,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-01 13:07:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-01 13:07:00,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 13:07:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 70 transitions. [2020-07-01 13:07:00,173 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 70 transitions. Word has length 16 [2020-07-01 13:07:00,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:00,173 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 70 transitions. [2020-07-01 13:07:00,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:07:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 70 transitions. [2020-07-01 13:07:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 13:07:00,174 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:00,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:00,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-01 13:07:00,175 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:07:00,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:00,175 INFO L82 PathProgramCache]: Analyzing trace with hash -2092033459, now seen corresponding path program 1 times [2020-07-01 13:07:00,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:00,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024967327] [2020-07-01 13:07:00,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:00,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024967327] [2020-07-01 13:07:00,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983069895] [2020-07-01 13:07:00,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:00,266 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 13:07:00,267 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:07:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:00,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:07:00,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 13:07:00,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353068096] [2020-07-01 13:07:00,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 13:07:00,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:00,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 13:07:00,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:07:00,281 INFO L87 Difference]: Start difference. First operand 37 states and 70 transitions. Second operand 4 states. [2020-07-01 13:07:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:00,361 INFO L93 Difference]: Finished difference Result 62 states and 121 transitions. [2020-07-01 13:07:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 13:07:00,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-01 13:07:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:00,362 INFO L225 Difference]: With dead ends: 62 [2020-07-01 13:07:00,362 INFO L226 Difference]: Without dead ends: 60 [2020-07-01 13:07:00,363 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 13:07:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-01 13:07:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 37. [2020-07-01 13:07:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 13:07:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 68 transitions. [2020-07-01 13:07:00,368 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 68 transitions. Word has length 18 [2020-07-01 13:07:00,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:00,368 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 68 transitions. [2020-07-01 13:07:00,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 13:07:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 68 transitions. [2020-07-01 13:07:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-01 13:07:00,369 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:00,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:00,570 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-07-01 13:07:00,570 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:07:00,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:00,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2092033460, now seen corresponding path program 1 times [2020-07-01 13:07:00,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:00,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749050841] [2020-07-01 13:07:00,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:00,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749050841] [2020-07-01 13:07:00,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531407516] [2020-07-01 13:07:00,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:00,916 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-01 13:07:00,918 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:07:00,923 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_20|], 1=[|v_#valid_31|]} [2020-07-01 13:07:00,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 13:07:00,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 13:07:00,930 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:00,940 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:00,949 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 13:07:00,950 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:00,959 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:00,960 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:00,960 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2020-07-01 13:07:01,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 13:07:01,004 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:01,016 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:01,016 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:01,017 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2020-07-01 13:07:01,057 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-07-01 13:07:01,058 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:01,068 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:01,069 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-01 13:07:01,070 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:40 [2020-07-01 13:07:01,119 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:01,119 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-07-01 13:07:01,120 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:07:01,121 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:07:01,134 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:01,135 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 13:07:01,136 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:01,136 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:34 [2020-07-01 13:07:01,183 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:07:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:01,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:07:01,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2020-07-01 13:07:01,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128908979] [2020-07-01 13:07:01,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 13:07:01,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:01,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 13:07:01,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2020-07-01 13:07:01,236 INFO L87 Difference]: Start difference. First operand 37 states and 68 transitions. Second operand 17 states. [2020-07-01 13:07:01,940 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2020-07-01 13:07:02,071 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2020-07-01 13:07:02,329 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2020-07-01 13:07:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:02,670 INFO L93 Difference]: Finished difference Result 112 states and 228 transitions. [2020-07-01 13:07:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-01 13:07:02,671 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 18 [2020-07-01 13:07:02,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:02,672 INFO L225 Difference]: With dead ends: 112 [2020-07-01 13:07:02,672 INFO L226 Difference]: Without dead ends: 110 [2020-07-01 13:07:02,673 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2020-07-01 13:07:02,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-07-01 13:07:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 62. [2020-07-01 13:07:02,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-01 13:07:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 123 transitions. [2020-07-01 13:07:02,683 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 123 transitions. Word has length 18 [2020-07-01 13:07:02,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:02,683 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 123 transitions. [2020-07-01 13:07:02,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 13:07:02,683 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 123 transitions. [2020-07-01 13:07:02,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-01 13:07:02,684 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:02,684 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:02,885 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:02,886 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:07:02,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:02,886 INFO L82 PathProgramCache]: Analyzing trace with hash 810608415, now seen corresponding path program 2 times [2020-07-01 13:07:02,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:02,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2762601] [2020-07-01 13:07:02,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:03,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2762601] [2020-07-01 13:07:03,057 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386527519] [2020-07-01 13:07:03,058 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:03,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 13:07:03,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 13:07:03,103 INFO L264 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 23 conjunts are in the unsatisfiable core [2020-07-01 13:07:03,105 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:07:03,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:03,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-01 13:07:03,123 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:03,138 INFO L619 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2020-07-01 13:07:03,139 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:03,139 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2020-07-01 13:07:03,155 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 13:07:03,155 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:03,157 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:03,157 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:03,157 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 13:07:03,190 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:03,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 13:07:03,191 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:07:03,192 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:07:03,199 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:03,199 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:03,199 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-07-01 13:07:03,222 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:07:03,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-01 13:07:03,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:07:03,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-01 13:07:03,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746755175] [2020-07-01 13:07:03,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-01 13:07:03,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:03,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-01 13:07:03,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-07-01 13:07:03,238 INFO L87 Difference]: Start difference. First operand 62 states and 123 transitions. Second operand 13 states. [2020-07-01 13:07:03,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:03,734 INFO L93 Difference]: Finished difference Result 75 states and 140 transitions. [2020-07-01 13:07:03,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 13:07:03,734 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2020-07-01 13:07:03,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:03,735 INFO L225 Difference]: With dead ends: 75 [2020-07-01 13:07:03,735 INFO L226 Difference]: Without dead ends: 74 [2020-07-01 13:07:03,736 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2020-07-01 13:07:03,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-01 13:07:03,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 41. [2020-07-01 13:07:03,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 13:07:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 73 transitions. [2020-07-01 13:07:03,743 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 73 transitions. Word has length 22 [2020-07-01 13:07:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:03,744 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 73 transitions. [2020-07-01 13:07:03,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-01 13:07:03,744 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 73 transitions. [2020-07-01 13:07:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-01 13:07:03,744 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:03,744 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:03,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2020-07-01 13:07:03,946 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:07:03,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:03,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2036773443, now seen corresponding path program 2 times [2020-07-01 13:07:03,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:03,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383411851] [2020-07-01 13:07:03,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:07:04,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383411851] [2020-07-01 13:07:04,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006729452] [2020-07-01 13:07:04,323 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:04,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 13:07:04,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 13:07:04,379 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-01 13:07:04,381 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:07:04,385 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_22|], 1=[|v_#valid_32|]} [2020-07-01 13:07:04,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 13:07:04,390 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 13:07:04,390 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:04,398 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:04,404 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 13:07:04,405 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:04,413 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:04,413 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:04,414 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-07-01 13:07:04,444 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 13:07:04,444 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:04,455 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:04,455 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:04,455 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-07-01 13:07:04,488 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-07-01 13:07:04,489 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:04,501 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:04,502 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 13:07:04,502 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-07-01 13:07:04,562 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:04,562 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-07-01 13:07:04,563 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:07:04,564 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:07:04,572 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:04,572 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:04,573 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2020-07-01 13:07:04,599 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:07:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 13:07:04,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:07:04,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2020-07-01 13:07:04,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242089798] [2020-07-01 13:07:04,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-01 13:07:04,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:04,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-01 13:07:04,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2020-07-01 13:07:04,647 INFO L87 Difference]: Start difference. First operand 41 states and 73 transitions. Second operand 17 states. [2020-07-01 13:07:06,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:06,065 INFO L93 Difference]: Finished difference Result 83 states and 158 transitions. [2020-07-01 13:07:06,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-01 13:07:06,065 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2020-07-01 13:07:06,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:06,066 INFO L225 Difference]: With dead ends: 83 [2020-07-01 13:07:06,066 INFO L226 Difference]: Without dead ends: 81 [2020-07-01 13:07:06,067 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=294, Invalid=762, Unknown=0, NotChecked=0, Total=1056 [2020-07-01 13:07:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-01 13:07:06,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 53. [2020-07-01 13:07:06,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-01 13:07:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 99 transitions. [2020-07-01 13:07:06,074 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 99 transitions. Word has length 29 [2020-07-01 13:07:06,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:06,075 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 99 transitions. [2020-07-01 13:07:06,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-01 13:07:06,075 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 99 transitions. [2020-07-01 13:07:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-01 13:07:06,076 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:06,076 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:06,276 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:06,277 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:07:06,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:06,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1957620845, now seen corresponding path program 1 times [2020-07-01 13:07:06,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:06,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038637211] [2020-07-01 13:07:06,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 13:07:06,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038637211] [2020-07-01 13:07:06,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415957211] [2020-07-01 13:07:06,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:06,456 INFO L264 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 13:07:06,458 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:07:06,598 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:06,598 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2020-07-01 13:07:06,600 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 13:07:06,601 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 13:07:06,602 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 13:07:06,617 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:06,618 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:06,618 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:9 [2020-07-01 13:07:06,640 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-01 13:07:06,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:07:06,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2020-07-01 13:07:06,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646536873] [2020-07-01 13:07:06,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 13:07:06,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:06,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 13:07:06,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-07-01 13:07:06,642 INFO L87 Difference]: Start difference. First operand 53 states and 99 transitions. Second operand 8 states. [2020-07-01 13:07:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:07,069 INFO L93 Difference]: Finished difference Result 130 states and 236 transitions. [2020-07-01 13:07:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 13:07:07,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-07-01 13:07:07,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:07,071 INFO L225 Difference]: With dead ends: 130 [2020-07-01 13:07:07,071 INFO L226 Difference]: Without dead ends: 89 [2020-07-01 13:07:07,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2020-07-01 13:07:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-01 13:07:07,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2020-07-01 13:07:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-01 13:07:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 144 transitions. [2020-07-01 13:07:07,082 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 144 transitions. Word has length 40 [2020-07-01 13:07:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:07,082 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 144 transitions. [2020-07-01 13:07:07,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 13:07:07,082 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 144 transitions. [2020-07-01 13:07:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-01 13:07:07,083 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:07,083 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:07,283 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2020-07-01 13:07:07,284 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:07:07,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:07,284 INFO L82 PathProgramCache]: Analyzing trace with hash -594536116, now seen corresponding path program 1 times [2020-07-01 13:07:07,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:07,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243625702] [2020-07-01 13:07:07,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 13:07:07,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243625702] [2020-07-01 13:07:07,361 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432360673] [2020-07-01 13:07:07,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:07,416 INFO L264 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 13:07:07,418 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:07:07,444 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-01 13:07:07,445 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:07,447 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:07,447 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:07,447 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-01 13:07:07,465 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-07-01 13:07:07,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 13:07:07,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2020-07-01 13:07:07,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114868064] [2020-07-01 13:07:07,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 13:07:07,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:07,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 13:07:07,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-07-01 13:07:07,467 INFO L87 Difference]: Start difference. First operand 73 states and 144 transitions. Second operand 5 states. [2020-07-01 13:07:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:07,584 INFO L93 Difference]: Finished difference Result 151 states and 293 transitions. [2020-07-01 13:07:07,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 13:07:07,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2020-07-01 13:07:07,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:07,585 INFO L225 Difference]: With dead ends: 151 [2020-07-01 13:07:07,585 INFO L226 Difference]: Without dead ends: 88 [2020-07-01 13:07:07,586 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-07-01 13:07:07,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-01 13:07:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 73. [2020-07-01 13:07:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-01 13:07:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 129 transitions. [2020-07-01 13:07:07,596 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 129 transitions. Word has length 40 [2020-07-01 13:07:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:07,596 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 129 transitions. [2020-07-01 13:07:07,596 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 13:07:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2020-07-01 13:07:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-01 13:07:07,597 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:07:07,597 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:07:07,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-07-01 13:07:07,798 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-07-01 13:07:07,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:07:07,798 INFO L82 PathProgramCache]: Analyzing trace with hash -590842032, now seen corresponding path program 1 times [2020-07-01 13:07:07,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:07:07,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143467556] [2020-07-01 13:07:07,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:07:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 13:07:07,876 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143467556] [2020-07-01 13:07:07,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000610270] [2020-07-01 13:07:07,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 13:07:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:07:07,931 INFO L264 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 38 conjunts are in the unsatisfiable core [2020-07-01 13:07:07,933 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 13:07:07,937 INFO L435 ElimStorePlain]: Different costs {0=[|v_#length_23|], 1=[|v_#valid_33|]} [2020-07-01 13:07:07,940 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-07-01 13:07:07,941 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-01 13:07:07,942 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:07,948 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:07,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-01 13:07:07,952 INFO L539 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:07,958 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:07,958 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:07,959 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2020-07-01 13:07:07,976 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 13:07:07,976 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:07,981 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:07,982 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:07,982 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2020-07-01 13:07:08,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-07-01 13:07:08,002 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:08,008 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:08,009 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 13:07:08,009 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-07-01 13:07:08,260 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 13:07:08,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 76 [2020-07-01 13:07:08,262 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-01 13:07:08,262 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-01 13:07:08,263 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-01 13:07:08,264 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 13:07:08,379 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2020-07-01 13:07:08,379 INFO L619 ElimStorePlain]: treesize reduction 28, result has 85.6 percent of original size [2020-07-01 13:07:08,382 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 13:07:08,382 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 13:07:08,384 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:07:08,384 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 13:07:08,385 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 13:07:08,385 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:63, output treesize:26 [2020-07-01 13:07:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-01 13:07:08,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 13:07:08,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 19 [2020-07-01 13:07:08,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857922684] [2020-07-01 13:07:08,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-01 13:07:08,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:07:08,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-01 13:07:08,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2020-07-01 13:07:08,471 INFO L87 Difference]: Start difference. First operand 73 states and 129 transitions. Second operand 19 states. [2020-07-01 13:07:11,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:07:11,251 INFO L93 Difference]: Finished difference Result 291 states and 495 transitions. [2020-07-01 13:07:11,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-07-01 13:07:11,252 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2020-07-01 13:07:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:07:11,253 INFO L225 Difference]: With dead ends: 291 [2020-07-01 13:07:11,253 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:07:11,254 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=711, Invalid=2481, Unknown=0, NotChecked=0, Total=3192 [2020-07-01 13:07:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:07:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:07:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:07:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:07:11,255 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2020-07-01 13:07:11,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:07:11,256 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:07:11,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-01 13:07:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:07:11,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:07:11,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-07-01 13:07:11,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:07:11,686 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 188 [2020-07-01 13:07:12,004 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 210 [2020-07-01 13:07:33,687 WARN L192 SmtUtils]: Spent 21.68 s on a formula simplification. DAG size of input: 187 DAG size of output: 108 [2020-07-01 13:08:49,467 WARN L192 SmtUtils]: Spent 1.26 m on a formula simplification. DAG size of input: 208 DAG size of output: 114 [2020-07-01 13:08:49,471 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 20) no Hoare annotation was computed. [2020-07-01 13:08:49,471 INFO L268 CegarLoopResult]: For program point L31-1(lines 31 33) no Hoare annotation was computed. [2020-07-01 13:08:49,472 INFO L268 CegarLoopResult]: For program point L19(lines 19 20) no Hoare annotation was computed. [2020-07-01 13:08:49,472 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 13:08:49,472 INFO L268 CegarLoopResult]: For program point L17-2(line 17) no Hoare annotation was computed. [2020-07-01 13:08:49,472 INFO L268 CegarLoopResult]: For program point L17-3(line 17) no Hoare annotation was computed. [2020-07-01 13:08:49,472 INFO L268 CegarLoopResult]: For program point L17-4(line 17) no Hoare annotation was computed. [2020-07-01 13:08:49,472 INFO L268 CegarLoopResult]: For program point L17-6(lines 17 18) no Hoare annotation was computed. [2020-07-01 13:08:49,473 INFO L264 CegarLoopResult]: At program point L17-8(lines 17 18) the Hoare annotation is: (let ((.cse0 (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base)) (.cse2 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse4 (= .cse2 ULTIMATE.start_main_~length1~0)) (.cse6 (<= ULTIMATE.start_cstrspn_~s1.base ULTIMATE.start_cstrspn_~sc1~0.base)) (.cse7 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~s2.base))) (.cse26 (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base)) (.cse11 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse12 (not (= 0 ULTIMATE.start_cstrspn_~c~0))) (.cse13 (<= 1 |#StackHeapBarrier|)) (.cse25 (= 0 ULTIMATE.start_cstrspn_~s~0.offset)) (.cse14 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse15 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~s~0.base))) (.cse17 (= 0 ULTIMATE.start_cstrspn_~s2.offset)) (.cse16 (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) (.cse18 (not (= 0 (select .cse0 ULTIMATE.start_cstrspn_~sc1~0.offset)))) (.cse27 (select |#length| ULTIMATE.start_cstrspn_~s2.base)) (.cse19 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse20 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse21 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse23 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~sc1~0.base))) (.cse24 (<= ULTIMATE.start_cstrspn_~sc1~0.base ULTIMATE.start_cstrspn_~s1.base)) (.cse28 (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base)) (.cse10 (select |#length| ULTIMATE.start_cstrspn_~s~0.base))) (or (let ((.cse1 (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base))) (and (= 0 (select .cse0 (+ .cse1 (- 1)))) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~sc1~0.base)))) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse2 (- 1)))) (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) .cse1) (let ((.cse3 (<= 0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (.cse5 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse8 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= 1 ULTIMATE.start_main_~length2~0) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) (select |#length| ULTIMATE.start_cstrspn_~s2.base)) (<= ULTIMATE.start_cstrspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))))))) (.cse9 (= 0 (select .cse28 (+ .cse10 (- 1))))) (.cse22 (= (select .cse26 (+ .cse27 (- 1))) 0))) (or (and .cse3 .cse4 .cse5 .cse6 (<= 1 ULTIMATE.start_cstrspn_~s~0.offset) .cse7 .cse8 .cse9 (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 1) .cse10) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_cstrspn_~s~0.offset ULTIMATE.start_main_~nondetString2~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) (select |#length| ULTIMATE.start_cstrspn_~s~0.base)))) .cse17 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))))) (and .cse4 .cse6 .cse7 (= 0 (select .cse26 ULTIMATE.start_cstrspn_~s2.offset)) .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) .cse17 .cse16 .cse18 (<= 1 .cse27) .cse19 .cse20 .cse21 .cse23 .cse24 (= 0 (select .cse28 ULTIMATE.start_cstrspn_~s~0.offset)) (<= 1 .cse10))))) [2020-07-01 13:08:49,473 INFO L268 CegarLoopResult]: For program point L17-9(lines 17 18) no Hoare annotation was computed. [2020-07-01 13:08:49,473 INFO L268 CegarLoopResult]: For program point L36(line 36) no Hoare annotation was computed. [2020-07-01 13:08:49,473 INFO L268 CegarLoopResult]: For program point L36-1(line 36) no Hoare annotation was computed. [2020-07-01 13:08:49,473 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:08:49,473 INFO L268 CegarLoopResult]: For program point L28(lines 28 30) no Hoare annotation was computed. [2020-07-01 13:08:49,473 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 22) no Hoare annotation was computed. [2020-07-01 13:08:49,473 INFO L268 CegarLoopResult]: For program point L28-2(lines 25 39) no Hoare annotation was computed. [2020-07-01 13:08:49,474 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:08:49,474 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 13:08:49,474 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:08:49,474 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 13:08:49,474 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:08:49,474 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:08:49,474 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:08:49,474 INFO L268 CegarLoopResult]: For program point L14-1(lines 14 21) no Hoare annotation was computed. [2020-07-01 13:08:49,474 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:08:49,474 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:08:49,475 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:08:49,475 INFO L264 CegarLoopResult]: At program point L14-4(lines 14 21) the Hoare annotation is: (let ((.cse3 (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base)) (.cse25 (select |#length| ULTIMATE.start_cstrspn_~s2.base)) (.cse7 (select |#length| ULTIMATE.start_cstrspn_~sc1~0.base)) (.cse24 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (let ((.cse13 (<= 1 ULTIMATE.start_main_~length1~0)) (.cse0 (= .cse24 ULTIMATE.start_main_~length1~0)) (.cse18 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse1 (<= ULTIMATE.start_cstrspn_~s1.base ULTIMATE.start_cstrspn_~sc1~0.base)) (.cse2 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~s2.base))) (.cse19 (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~sc1~0.base) (+ .cse7 (- 1))))) (.cse20 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse4 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) (.cse5 (<= 1 |#StackHeapBarrier|)) (.cse21 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrspn_~sc1~0.base))))) (.cse6 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse8 (= 0 ULTIMATE.start_cstrspn_~s2.offset)) (.cse9 (= 0 ULTIMATE.start_main_~nondetString2~0.offset)) (.cse12 (= 0 ULTIMATE.start_main_~nondetString1~0.offset)) (.cse10 (<= 1 .cse25)) (.cse11 (= 0 ULTIMATE.start_cstrspn_~sc1~0.offset)) (.cse14 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse15 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~sc1~0.base))) (.cse22 (= (select .cse3 (+ .cse25 (- 1))) 0)) (.cse16 (<= ULTIMATE.start_cstrspn_~sc1~0.base ULTIMATE.start_cstrspn_~s1.base)) (.cse23 (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse24 (- 1)))))) (or (and .cse0 .cse1 .cse2 (= 0 (select .cse3 ULTIMATE.start_cstrspn_~s2.offset)) .cse4 .cse5 .cse6 (<= 1 .cse7) (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (let ((.cse17 (select |#length| ULTIMATE.start_cstrspn_~s~0.base))) (and .cse5 .cse6 (= 1 (select |#valid| ULTIMATE.start_cstrspn_~s~0.base)) .cse8 (<= 0 ULTIMATE.start_cstrspn_~s~0.offset) .cse12 (<= (+ ULTIMATE.start_cstrspn_~s~0.offset 2) .cse17) .cse14 .cse15 .cse16 .cse0 .cse18 .cse1 .cse2 .cse19 (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (<= 1 ULTIMATE.start_main_~length2~0) (<= (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset) (select |#length| ULTIMATE.start_cstrspn_~s2.base)) (<= ULTIMATE.start_cstrspn_~s2.offset ULTIMATE.start_main_~nondetString2~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s~0.base) (+ .cse17 (- 1)))) .cse20 .cse4 (not (= 0 ULTIMATE.start_cstrspn_~c~0)) .cse21 .cse9 .cse13 (<= 1 ULTIMATE.start_cstrspn_~sc1~0.offset) .cse22 .cse23 (<= (+ ULTIMATE.start_cstrspn_~sc1~0.offset 1) .cse7))) (and .cse0 .cse18 .cse1 .cse2 .cse19 .cse20 .cse4 .cse5 .cse21 .cse6 (or (<= 2 .cse7) (= 1 .cse7)) .cse8 .cse9 .cse12 .cse10 .cse11 .cse14 .cse15 .cse22 .cse16 .cse23 (<= 1 .cse24))))) [2020-07-01 13:08:49,475 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:08:49,475 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-07-01 13:08:49,475 INFO L268 CegarLoopResult]: For program point L14-5(lines 14 21) no Hoare annotation was computed. [2020-07-01 13:08:49,475 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. [2020-07-01 13:08:49,476 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:08:49,476 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-07-01 13:08:49,476 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. [2020-07-01 13:08:49,478 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:08:49,487 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,488 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,489 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,490 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,496 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,497 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,497 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,498 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,498 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,498 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,498 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,499 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,499 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,499 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,499 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,501 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,501 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,501 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,501 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,503 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,504 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,505 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,505 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,505 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,505 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,505 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,506 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,506 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,522 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,522 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,522 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,522 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,523 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,523 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,523 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,523 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,524 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,524 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,524 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,524 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,525 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,525 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,525 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,525 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,529 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,530 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,533 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,534 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,535 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,536 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,537 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,537 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,537 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,537 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,538 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,538 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,538 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,539 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,539 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,539 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,539 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,543 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,543 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,543 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,543 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,543 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,544 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,544 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,544 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,546 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,546 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,546 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,546 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,547 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,547 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,547 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,547 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,548 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,548 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,548 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,548 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,549 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,549 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,549 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,549 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,550 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,550 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,550 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,550 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,550 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,552 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,553 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,554 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,555 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,556 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,557 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,560 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,561 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,561 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,561 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,561 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,562 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,563 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,564 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,565 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,566 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,566 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,566 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,566 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,567 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,567 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,567 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,567 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,567 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:08:49 BasicIcfg [2020-07-01 13:08:49,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:08:49,571 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:08:49,571 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:08:49,574 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:08:49,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:08:49,575 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:06:53" (1/5) ... [2020-07-01 13:08:49,576 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e6d25ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:08:49, skipping insertion in model container [2020-07-01 13:08:49,576 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:08:49,576 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:06:54" (2/5) ... [2020-07-01 13:08:49,576 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e6d25ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:08:49, skipping insertion in model container [2020-07-01 13:08:49,576 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:08:49,576 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:06:54" (3/5) ... [2020-07-01 13:08:49,576 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e6d25ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:08:49, skipping insertion in model container [2020-07-01 13:08:49,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:08:49,577 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:06:54" (4/5) ... [2020-07-01 13:08:49,577 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e6d25ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:08:49, skipping insertion in model container [2020-07-01 13:08:49,577 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:08:49,577 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:08:49" (5/5) ... [2020-07-01 13:08:49,578 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:08:49,599 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:08:49,599 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:08:49,599 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:08:49,599 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:08:49,599 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:08:49,599 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:08:49,599 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:08:49,599 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:08:49,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-07-01 13:08:49,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-01 13:08:49,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:08:49,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:08:49,612 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:08:49,613 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:08:49,613 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:08:49,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states. [2020-07-01 13:08:49,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-01 13:08:49,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:08:49,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:08:49,615 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:08:49,615 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:08:49,620 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue [239] ULTIMATE.startENTRY-->L28: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 29#L28true [122] L28-->L28-2: Formula: (and (= v_ULTIMATE.start_main_~length1~0_4 1) (< v_ULTIMATE.start_main_~length1~0_5 1)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_5} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length1~0] 25#L28-2true [137] L28-2-->L31-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 10#L31-1true [164] L31-1-->L36: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2| 1))) (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc10.base_2|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< 0 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_2|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc11.offset_2|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc10.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_2| v_ULTIMATE.start_main_~length2~0_7)) (= 0 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_2| 1) |v_#valid_3|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc10.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_2|) (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_2|) (< |v_ULTIMATE.start_main_#t~malloc10.base_2| 0))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_2|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_2|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 23#L36true [113] L36-->L36-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= 1 .cse0) (= 1 (select |v_#valid_6| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (<= .cse0 (select |v_#length_4| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_6|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_4|} AuxVars[] AssignedVars[#memory_int] 21#L36-1true [240] L36-1-->L14-4: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (<= 1 .cse0) (= v_ULTIMATE.start_cstrspn_~s1.offset_5 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_16 v_ULTIMATE.start_cstrspn_~s1.base_7) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_cstrspn_~s1.base_7) (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_12 v_ULTIMATE.start_cstrspn_~s1.offset_5) (= v_ULTIMATE.start_cstrspn_~s2.offset_4 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= 1 (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s1.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s1.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_cstrspn_#in~s2.offset_2|) (= |v_ULTIMATE.start_cstrspn_#in~s2.base_2| v_ULTIMATE.start_cstrspn_~s2.base_4) (= |v_#memory_int_10| (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0))))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_cstrspn_~s1.base=v_ULTIMATE.start_cstrspn_~s1.base_7, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_7, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_12, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_4|, ULTIMATE.start_cstrspn_#res=|v_ULTIMATE.start_cstrspn_#res_5|, ULTIMATE.start_cstrspn_~s1.offset=v_ULTIMATE.start_cstrspn_~s1.offset_5, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_cstrspn_#t~post6.base=|v_ULTIMATE.start_cstrspn_#t~post6.base_4|, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_7|, ULTIMATE.start_cstrspn_#t~post6.offset=|v_ULTIMATE.start_cstrspn_#t~post6.offset_4|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_4|, #length=|v_#length_18|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_4, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_cstrspn_#in~s2.offset=|v_ULTIMATE.start_cstrspn_#in~s2.offset_2|, ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_10|, ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_4, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_7|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_6|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_6|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_15, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_16, ULTIMATE.start_cstrspn_#in~s2.base=|v_ULTIMATE.start_cstrspn_#in~s2.base_2|, ULTIMATE.start_cstrspn_#in~s1.offset=|v_ULTIMATE.start_cstrspn_#in~s1.offset_2|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_12, ULTIMATE.start_cstrspn_#in~s1.base=|v_ULTIMATE.start_cstrspn_#in~s1.base_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s1.base, ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~post0.offset, ULTIMATE.start_cstrspn_#res, ULTIMATE.start_cstrspn_~s1.offset, ULTIMATE.start_cstrspn_#t~post6.base, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post6.offset, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_~s2.base, ULTIMATE.start_cstrspn_#in~s2.offset, ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_~s2.offset, ULTIMATE.start_cstrspn_#t~mem2, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3, ULTIMATE.start_cstrspn_~s~0.base, ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_#in~s2.base, ULTIMATE.start_cstrspn_#in~s1.offset, #memory_int, ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#in~s1.base] 15#L14-4true [2020-07-01 13:08:49,620 INFO L796 eck$LassoCheckResult]: Loop: 15#L14-4true [102] L14-4-->L14-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_4 1) (select |v_#length_8| v_ULTIMATE.start_cstrspn_~sc1~0.base_4)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrspn_~sc1~0.base_4) v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem1_2|) (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_4) (= 1 (select |v_#valid_10| v_ULTIMATE.start_cstrspn_~sc1~0.base_4))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, #length=|v_#length_8|, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_4, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_4, #valid=|v_#valid_10|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_2|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem1] 19#L14-1true [177] L14-1-->L16: Formula: (and (= v_ULTIMATE.start_cstrspn_~s~0.base_3 v_ULTIMATE.start_cstrspn_~s2.base_3) (= v_ULTIMATE.start_cstrspn_~s~0.offset_3 v_ULTIMATE.start_cstrspn_~s2.offset_3) (> 0 |v_ULTIMATE.start_cstrspn_#t~mem1_6|)) InVars {ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_6|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3} OutVars{ULTIMATE.start_cstrspn_~s2.offset=v_ULTIMATE.start_cstrspn_~s2.offset_3, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_3, ULTIMATE.start_cstrspn_#t~mem1=|v_ULTIMATE.start_cstrspn_#t~mem1_5|, ULTIMATE.start_cstrspn_~s2.base=v_ULTIMATE.start_cstrspn_~s2.base_3, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~s~0.offset, ULTIMATE.start_cstrspn_#t~mem1, ULTIMATE.start_cstrspn_~s~0.base] 4#L16true [241] L16-->L17-8: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~sc1~0.offset_13) (= 1 (select |v_#valid_26| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (<= (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_13 1) (select |v_#length_19| v_ULTIMATE.start_cstrspn_~sc1~0.base_17)) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_cstrspn_~sc1~0.base_17) v_ULTIMATE.start_cstrspn_~sc1~0.offset_13) v_ULTIMATE.start_cstrspn_~c~0_8)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_17, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_8, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_13, #valid=|v_#valid_26|, ULTIMATE.start_cstrspn_#t~mem2=|v_ULTIMATE.start_cstrspn_#t~mem2_6|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~c~0, ULTIMATE.start_cstrspn_#t~mem2] 11#L17-8true [96] L17-8-->L17-1: Formula: (and (= 1 (select |v_#valid_14| v_ULTIMATE.start_cstrspn_~s~0.base_4)) (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_4) (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_4 1) (select |v_#length_12| v_ULTIMATE.start_cstrspn_~s~0.base_4)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrspn_~s~0.base_4) v_ULTIMATE.start_cstrspn_~s~0.offset_4) |v_ULTIMATE.start_cstrspn_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, #valid=|v_#valid_14|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} OutVars{#valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_4, #length=|v_#length_12|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_2|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem3] 27#L17-1true [201] L17-1-->L17-2: Formula: (and (not |v_ULTIMATE.start_cstrspn_#t~short5_2|) (= 0 |v_ULTIMATE.start_cstrspn_#t~mem3_3|)) InVars {ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_2|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5] 24#L17-2true [117] L17-2-->L17-6: Formula: (not |v_ULTIMATE.start_cstrspn_#t~short5_5|) InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_5|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_5|} AuxVars[] AssignedVars[] 35#L17-6true [129] L17-6-->L17-9: Formula: (not |v_ULTIMATE.start_cstrspn_#t~short5_7|) InVars {ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_7|} OutVars{ULTIMATE.start_cstrspn_#t~short5=|v_ULTIMATE.start_cstrspn_#t~short5_6|, ULTIMATE.start_cstrspn_#t~mem4=|v_ULTIMATE.start_cstrspn_#t~mem4_4|, ULTIMATE.start_cstrspn_#t~mem3=|v_ULTIMATE.start_cstrspn_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~short5, ULTIMATE.start_cstrspn_#t~mem4, ULTIMATE.start_cstrspn_#t~mem3] 8#L17-9true [91] L17-9-->L19: Formula: (and (<= 0 v_ULTIMATE.start_cstrspn_~s~0.offset_10) (<= (+ v_ULTIMATE.start_cstrspn_~s~0.offset_10 1) (select |v_#length_16| v_ULTIMATE.start_cstrspn_~s~0.base_12)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_cstrspn_~s~0.base_12)) (= |v_ULTIMATE.start_cstrspn_#t~mem7_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_cstrspn_~s~0.base_12) v_ULTIMATE.start_cstrspn_~s~0.offset_10))) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_10, #length=|v_#length_16|, #valid=|v_#valid_18|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_12} OutVars{ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_cstrspn_~s~0.offset=v_ULTIMATE.start_cstrspn_~s~0.offset_10, #length=|v_#length_16|, ULTIMATE.start_cstrspn_~s~0.base=v_ULTIMATE.start_cstrspn_~s~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_#t~mem7] 31#L19true [244] L19-->L14-4: Formula: (and (= v_ULTIMATE.start_cstrspn_~sc1~0.offset_14 (+ v_ULTIMATE.start_cstrspn_~sc1~0.offset_15 1)) (= |v_ULTIMATE.start_cstrspn_#t~mem7_9| v_ULTIMATE.start_cstrspn_~c~0_9) (= v_ULTIMATE.start_cstrspn_~sc1~0.base_19 v_ULTIMATE.start_cstrspn_~sc1~0.base_18)) InVars {ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_19, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_9, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_15, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_9|} OutVars{ULTIMATE.start_cstrspn_~sc1~0.base=v_ULTIMATE.start_cstrspn_~sc1~0.base_18, ULTIMATE.start_cstrspn_~c~0=v_ULTIMATE.start_cstrspn_~c~0_9, ULTIMATE.start_cstrspn_~sc1~0.offset=v_ULTIMATE.start_cstrspn_~sc1~0.offset_14, ULTIMATE.start_cstrspn_#t~mem7=|v_ULTIMATE.start_cstrspn_#t~mem7_8|, ULTIMATE.start_cstrspn_#t~post0.base=|v_ULTIMATE.start_cstrspn_#t~post0.base_5|, ULTIMATE.start_cstrspn_#t~post0.offset=|v_ULTIMATE.start_cstrspn_#t~post0.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrspn_~sc1~0.base, ULTIMATE.start_cstrspn_~sc1~0.offset, ULTIMATE.start_cstrspn_#t~mem7, ULTIMATE.start_cstrspn_#t~post0.base, ULTIMATE.start_cstrspn_#t~post0.offset] 15#L14-4true [2020-07-01 13:08:49,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:49,621 INFO L82 PathProgramCache]: Analyzing trace with hash -743151546, now seen corresponding path program 1 times [2020-07-01 13:08:49,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:49,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324255139] [2020-07-01 13:08:49,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:49,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:49,633 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324255139] [2020-07-01 13:08:49,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:49,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:08:49,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415937259] [2020-07-01 13:08:49,635 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:08:49,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:08:49,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1444170099, now seen corresponding path program 1 times [2020-07-01 13:08:49,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:08:49,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480346307] [2020-07-01 13:08:49,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:08:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:08:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:08:49,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480346307] [2020-07-01 13:08:49,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:08:49,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 13:08:49,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487854241] [2020-07-01 13:08:49,683 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:08:49,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:08:49,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:08:49,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:08:49,685 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-01 13:08:49,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:08:49,746 INFO L93 Difference]: Finished difference Result 35 states and 67 transitions. [2020-07-01 13:08:49,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:08:49,749 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:08:49,752 INFO L168 Benchmark]: Toolchain (without parser) took 115845.13 ms. Allocated memory was 649.6 MB in the beginning and 929.0 MB in the end (delta: 279.4 MB). Free memory was 556.1 MB in the beginning and 733.1 MB in the end (delta: -177.0 MB). Peak memory consumption was 102.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:49,753 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 577.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:08:49,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.32 ms. Allocated memory was 649.6 MB in the beginning and 686.8 MB in the end (delta: 37.2 MB). Free memory was 556.1 MB in the beginning and 648.8 MB in the end (delta: -92.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:49,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.74 ms. Allocated memory is still 686.8 MB. Free memory was 648.8 MB in the beginning and 646.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:49,754 INFO L168 Benchmark]: Boogie Preprocessor took 33.01 ms. Allocated memory is still 686.8 MB. Free memory was 646.1 MB in the beginning and 643.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:49,754 INFO L168 Benchmark]: RCFGBuilder took 374.51 ms. Allocated memory is still 686.8 MB. Free memory was 643.4 MB in the beginning and 616.9 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:49,754 INFO L168 Benchmark]: BlockEncodingV2 took 144.89 ms. Allocated memory is still 686.8 MB. Free memory was 616.9 MB in the beginning and 604.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:49,755 INFO L168 Benchmark]: TraceAbstraction took 114731.23 ms. Allocated memory was 686.8 MB in the beginning and 929.0 MB in the end (delta: 242.2 MB). Free memory was 603.4 MB in the beginning and 763.7 MB in the end (delta: -160.3 MB). Peak memory consumption was 491.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:49,755 INFO L168 Benchmark]: BuchiAutomizer took 180.35 ms. Allocated memory is still 929.0 MB. Free memory was 763.7 MB in the beginning and 733.1 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 50.3 GB. [2020-07-01 13:08:49,757 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 43 locations, 50 edges - StatisticsResult: Encoded RCFG 35 locations, 72 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 577.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 329.32 ms. Allocated memory was 649.6 MB in the beginning and 686.8 MB in the end (delta: 37.2 MB). Free memory was 556.1 MB in the beginning and 648.8 MB in the end (delta: -92.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 45.74 ms. Allocated memory is still 686.8 MB. Free memory was 648.8 MB in the beginning and 646.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 33.01 ms. Allocated memory is still 686.8 MB. Free memory was 646.1 MB in the beginning and 643.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * RCFGBuilder took 374.51 ms. Allocated memory is still 686.8 MB. Free memory was 643.4 MB in the beginning and 616.9 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 144.89 ms. Allocated memory is still 686.8 MB. Free memory was 616.9 MB in the beginning and 604.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 114731.23 ms. Allocated memory was 686.8 MB in the beginning and 929.0 MB in the end (delta: 242.2 MB). Free memory was 603.4 MB in the beginning and 763.7 MB in the end (delta: -160.3 MB). Peak memory consumption was 491.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 180.35 ms. Allocated memory is still 929.0 MB. Free memory was 763.7 MB in the beginning and 733.1 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 36]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 36]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 13:08:49,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,771 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,772 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,773 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,775 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,775 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,775 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,775 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,775 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,776 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,776 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,776 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,776 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,777 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,777 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,777 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,777 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,778 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,778 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,778 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,778 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,778 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,779 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,780 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,780 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,780 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,780 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,780 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,781 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,782 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,787 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,787 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,787 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,788 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,788 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,788 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,788 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,788 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,789 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,789 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,789 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,789 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,790 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,790 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,790 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,790 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,790 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,791 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,791 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,791 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,791 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,791 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,792 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,792 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,792 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,792 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,792 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,793 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,794 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((unknown-#length-unknown[nondetString1] == length1 && s1 <= sc1) && 1 == \valid[s2]) && 0 == unknown-#memory_int-unknown[s2][s2]) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[nondetString2] == length2) && 1 <= unknown-#length-unknown[sc1]) && 1 == length2 + nondetString2) && 0 == s2) && 0 == nondetString2) && 1 <= unknown-#length-unknown[s2]) && 0 == sc1) && 0 == nondetString1) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[sc1]) && sc1 <= s1) || ((((((((((((((((((((((((((1 <= unknown-#StackHeapBarrier-unknown && unknown-#length-unknown[nondetString2] == length2) && 1 == \valid[s]) && 0 == s2) && 0 <= s) && 0 == nondetString1) && s + 2 <= unknown-#length-unknown[s]) && 1 == \valid[nondetString1]) && 1 == \valid[sc1]) && sc1 <= s1) && unknown-#length-unknown[nondetString1] == length1) && 1 <= length2) && s1 <= sc1) && 1 == \valid[s2]) && 0 == unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1]) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((1 <= ULTIMATE.start_main_~length2~0 && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[s2]) && s2 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1])) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && !(0 == c)) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == sc1))) && 0 == nondetString2) && 1 <= length1) && 1 <= sc1) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && 0 == unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1]) && sc1 + 1 <= unknown-#length-unknown[sc1])) || (((((((((((((((((((((unknown-#length-unknown[nondetString1] == length1 && 1 <= length2) && s1 <= sc1) && 1 == \valid[s2]) && 0 == unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1]) && !(nondetString1 == nondetString2)) && 1 == \valid[nondetString2]) && 1 <= unknown-#StackHeapBarrier-unknown) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == sc1))) && unknown-#length-unknown[nondetString2] == length2) && (2 <= unknown-#length-unknown[sc1] || 1 == unknown-#length-unknown[sc1])) && 0 == s2) && 0 == nondetString2) && 0 == nondetString1) && 1 <= unknown-#length-unknown[s2]) && 0 == sc1) && 1 == \valid[nondetString1]) && 1 == \valid[sc1]) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && sc1 <= s1) && 0 == unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1]) && 1 <= unknown-#length-unknown[nondetString1]) - InvariantResult [Line: 17]: Loop Invariant [2020-07-01 13:08:49,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,800 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,801 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,801 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,802 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,803 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,804 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,804 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,804 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,804 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,804 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,805 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,806 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,807 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,808 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,808 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,808 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,808 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,808 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,809 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] [2020-07-01 13:08:49,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,811 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~length2~0,QUANTIFIED] [2020-07-01 13:08:49,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] [2020-07-01 13:08:49,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,817 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,817 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,817 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,817 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,817 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,818 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,822 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,822 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,822 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:08:49,822 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,822 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,823 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:08:49,823 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 13:08:49,823 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((0 == unknown-#memory_int-unknown[sc1][unknown-#length-unknown[sc1] + -1] && !(nondetString1 == nondetString2)) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == sc1))) && 0 == unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1]) && sc1 + 1 <= unknown-#length-unknown[sc1]) && (((((((((((((((((((((((0 <= sc1 && unknown-#length-unknown[nondetString1] == length1) && 1 <= length2) && s1 <= sc1) && 1 <= s) && 1 == \valid[s2]) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((1 <= ULTIMATE.start_main_~length2~0 && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[s2]) && s2 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1])) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && s + 1 <= unknown-#length-unknown[s]) && 1 == \valid[nondetString2]) && !(0 == c)) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[nondetString2] == length2) && 1 == \valid[s]) && 0 == nondetString2) && 0 == s2) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && 0 == nondetString1) && 1 <= length1) && 1 == \valid[nondetString1]) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && 1 == \valid[sc1]) && sc1 <= s1) || ((((((((((((((((((((((0 <= sc1 && unknown-#length-unknown[nondetString1] == length1) && 1 <= length2) && s1 <= sc1) && 1 == \valid[s2]) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((1 <= ULTIMATE.start_main_~length2~0 && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[s2]) && s2 <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s2][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1])) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && 1 == \valid[nondetString2]) && !(0 == c)) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == s) && unknown-#length-unknown[nondetString2] == length2) && 1 == \valid[s]) && (\exists ULTIMATE.start_main_~length2~0 : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: ((1 <= ULTIMATE.start_main_~length2~0 && s <= ULTIMATE.start_main_~nondetString2~0.offset) && 0 == unknown-#memory_int-unknown[s][ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset + -1]) && ULTIMATE.start_main_~length2~0 + ULTIMATE.start_main_~nondetString2~0.offset <= unknown-#length-unknown[s])) && 0 == s2) && 0 == nondetString2) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && 0 == nondetString1) && 1 <= length1) && 1 == \valid[nondetString1]) && unknown-#memory_int-unknown[s2][unknown-#length-unknown[s2] + -1] == 0) && 1 == \valid[sc1]) && sc1 <= s1))) || (((((((((((((((((((((unknown-#length-unknown[nondetString1] == length1 && s1 <= sc1) && 1 == \valid[s2]) && 0 == unknown-#memory_int-unknown[s2][s2]) && 1 == \valid[nondetString2]) && !(0 == c)) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == s) && unknown-#length-unknown[nondetString2] == length2) && 1 == \valid[s]) && 1 == length2 + nondetString2) && 0 == s2) && 0 == nondetString2) && !(0 == unknown-#memory_int-unknown[sc1][sc1])) && 1 <= unknown-#length-unknown[s2]) && 0 == nondetString1) && 1 <= length1) && 1 == \valid[nondetString1]) && 1 == \valid[sc1]) && sc1 <= s1) && 0 == unknown-#memory_int-unknown[s][s]) && 1 <= unknown-#length-unknown[s]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 16 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 16.5s, OverallIterations: 28, TraceHistogramMax: 3, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 98.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 303 SDtfs, 4428 SDslu, 1147 SDs, 0 SdLazy, 3280 SolverSat, 331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 28 MinimizatonAttempts, 239 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 40 NumberOfFragments, 821 HoareAnnotationTreeSize, 2 FomulaSimplifications, 267430 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 2 FomulaSimplificationsInter, 181492 FormulaSimplificationTreeSizeReductionInter, 97.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 653 NumberOfCodeBlocks, 653 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 616 ConstructedInterpolants, 56 QuantifiedInterpolants, 144209 SizeOfPredicates, 81 NumberOfNonLiveVariables, 1347 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 37 InterpolantComputations, 23 PerfectInterpolantSequences, 202/271 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:06:50.616 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_QN2ZE_/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:08:50.050 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check