/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops/n.c40.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:36:46,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:36:46,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:36:46,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:36:46,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:36:46,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:36:46,768 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:36:46,770 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:36:46,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:36:46,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:36:46,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:36:46,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:36:46,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:36:46,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:36:46,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:36:46,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:36:46,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:36:46,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:36:46,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:36:46,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:36:46,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:36:46,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:36:46,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:36:46,789 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:36:46,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:36:46,792 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:36:46,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:36:46,793 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:36:46,794 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:36:46,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:36:46,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:36:46,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:36:46,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:36:46,797 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:36:46,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:36:46,798 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:36:46,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:36:46,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:36:46,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:36:46,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:36:46,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:36:46,802 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:36:46,811 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:36:46,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:36:46,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:36:46,813 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:36:46,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:36:46,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:36:46,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:36:46,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:36:46,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:36:46,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:36:46,815 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:36:46,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:36:46,815 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:36:46,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:36:46,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:36:46,816 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:36:46,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:36:46,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:36:46,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:36:46,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:36:46,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:36:46,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:36:46,817 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 23:36:47,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:36:47,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:36:47,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:36:47,147 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:36:47,147 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:36:47,148 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/n.c40.c [2020-07-08 23:36:47,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbbb5d61e/64e1b57371c34c3aa5611decdefcebf2/FLAG3188eeab2 [2020-07-08 23:36:47,653 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:36:47,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/n.c40.c [2020-07-08 23:36:47,662 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbbb5d61e/64e1b57371c34c3aa5611decdefcebf2/FLAG3188eeab2 [2020-07-08 23:36:48,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbbb5d61e/64e1b57371c34c3aa5611decdefcebf2 [2020-07-08 23:36:48,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:36:48,057 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:36:48,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:36:48,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:36:48,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:36:48,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:36:48" (1/1) ... [2020-07-08 23:36:48,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b146f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:48, skipping insertion in model container [2020-07-08 23:36:48,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:36:48" (1/1) ... [2020-07-08 23:36:48,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:36:48,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:36:48,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:36:48,330 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:36:48,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:36:48,377 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:36:48,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:48 WrapperNode [2020-07-08 23:36:48,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:36:48,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:36:48,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:36:48,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:36:48,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:48" (1/1) ... [2020-07-08 23:36:48,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:48" (1/1) ... [2020-07-08 23:36:48,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:48" (1/1) ... [2020-07-08 23:36:48,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:48" (1/1) ... [2020-07-08 23:36:48,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:48" (1/1) ... [2020-07-08 23:36:48,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:48" (1/1) ... [2020-07-08 23:36:48,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:48" (1/1) ... [2020-07-08 23:36:48,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:36:48,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:36:48,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:36:48,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:36:48,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:36:48,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:36:48,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:36:48,581 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:36:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:36:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:36:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:36:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 23:36:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 23:36:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:36:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 23:36:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:36:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 23:36:48,923 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:36:48,924 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 23:36:48,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:36:48 BoogieIcfgContainer [2020-07-08 23:36:48,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:36:48,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:36:48,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:36:48,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:36:48,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:36:48" (1/3) ... [2020-07-08 23:36:48,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1e55d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:36:48, skipping insertion in model container [2020-07-08 23:36:48,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:48" (2/3) ... [2020-07-08 23:36:48,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1e55d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:36:48, skipping insertion in model container [2020-07-08 23:36:48,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:36:48" (3/3) ... [2020-07-08 23:36:48,937 INFO L109 eAbstractionObserver]: Analyzing ICFG n.c40.c [2020-07-08 23:36:48,949 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:36:48,958 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:36:48,974 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:36:48,997 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:36:48,997 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:36:48,997 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:36:48,998 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:36:48,998 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:36:48,998 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:36:48,998 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:36:48,998 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:36:49,026 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2020-07-08 23:36:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-08 23:36:49,038 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:49,039 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:36:49,039 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:49,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:49,045 INFO L82 PathProgramCache]: Analyzing trace with hash 814682400, now seen corresponding path program 1 times [2020-07-08 23:36:49,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:49,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [177613986] [2020-07-08 23:36:49,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:49,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0; {44#true} is VALID [2020-07-08 23:36:49,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#true} #valid := #valid[0 := 0]; {44#true} is VALID [2020-07-08 23:36:49,407 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#true} assume 0 < #StackHeapBarrier; {44#true} is VALID [2020-07-08 23:36:49,407 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L5 {44#true} is VALID [2020-07-08 23:36:49,408 INFO L280 TraceCheckUtils]: 4: Hoare triple {44#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {44#true} is VALID [2020-07-08 23:36:49,410 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#true} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L5-2 {44#true} is VALID [2020-07-08 23:36:49,411 INFO L280 TraceCheckUtils]: 6: Hoare triple {44#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {44#true} is VALID [2020-07-08 23:36:49,412 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#true} ~i~0 := 0; {44#true} is VALID [2020-07-08 23:36:49,412 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#true} ~j~0 := 0; {44#true} is VALID [2020-07-08 23:36:49,413 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#true} ~k~0 := 0; {44#true} is VALID [2020-07-08 23:36:49,413 INFO L280 TraceCheckUtils]: 10: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-08 23:36:49,414 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {44#true} {44#true} #61#return; {44#true} is VALID [2020-07-08 23:36:49,422 INFO L263 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {58#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} is VALID [2020-07-08 23:36:49,423 INFO L280 TraceCheckUtils]: 1: Hoare triple {58#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0; {44#true} is VALID [2020-07-08 23:36:49,423 INFO L280 TraceCheckUtils]: 2: Hoare triple {44#true} #valid := #valid[0 := 0]; {44#true} is VALID [2020-07-08 23:36:49,424 INFO L280 TraceCheckUtils]: 3: Hoare triple {44#true} assume 0 < #StackHeapBarrier; {44#true} is VALID [2020-07-08 23:36:49,424 INFO L280 TraceCheckUtils]: 4: Hoare triple {44#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L5 {44#true} is VALID [2020-07-08 23:36:49,425 INFO L280 TraceCheckUtils]: 5: Hoare triple {44#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {44#true} is VALID [2020-07-08 23:36:49,425 INFO L280 TraceCheckUtils]: 6: Hoare triple {44#true} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L5-2 {44#true} is VALID [2020-07-08 23:36:49,426 INFO L280 TraceCheckUtils]: 7: Hoare triple {44#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {44#true} is VALID [2020-07-08 23:36:49,426 INFO L280 TraceCheckUtils]: 8: Hoare triple {44#true} ~i~0 := 0; {44#true} is VALID [2020-07-08 23:36:49,427 INFO L280 TraceCheckUtils]: 9: Hoare triple {44#true} ~j~0 := 0; {44#true} is VALID [2020-07-08 23:36:49,427 INFO L280 TraceCheckUtils]: 10: Hoare triple {44#true} ~k~0 := 0; {44#true} is VALID [2020-07-08 23:36:49,428 INFO L280 TraceCheckUtils]: 11: Hoare triple {44#true} assume true; {44#true} is VALID [2020-07-08 23:36:49,429 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {44#true} {44#true} #61#return; {44#true} is VALID [2020-07-08 23:36:49,430 INFO L263 TraceCheckUtils]: 13: Hoare triple {44#true} call #t~ret5 := main(); {44#true} is VALID [2020-07-08 23:36:49,433 INFO L280 TraceCheckUtils]: 14: Hoare triple {44#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {44#true} is VALID [2020-07-08 23:36:49,433 INFO L280 TraceCheckUtils]: 15: Hoare triple {44#true} ~k~0 := #t~nondet0; {44#true} is VALID [2020-07-08 23:36:49,434 INFO L280 TraceCheckUtils]: 16: Hoare triple {44#true} havoc #t~nondet0; {44#true} is VALID [2020-07-08 23:36:49,434 INFO L280 TraceCheckUtils]: 17: Hoare triple {44#true} ~i~0 := 0; {44#true} is VALID [2020-07-08 23:36:49,436 INFO L280 TraceCheckUtils]: 18: Hoare triple {44#true} assume !true; {45#false} is VALID [2020-07-08 23:36:49,437 INFO L280 TraceCheckUtils]: 19: Hoare triple {45#false} SUMMARY for call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); srcloc: L12-6 {45#false} is VALID [2020-07-08 23:36:49,437 INFO L280 TraceCheckUtils]: 20: Hoare triple {45#false} assume ~k~0 >= 0 && ~k~0 < ~i~0; {45#false} is VALID [2020-07-08 23:36:49,438 INFO L280 TraceCheckUtils]: 21: Hoare triple {45#false} SUMMARY for call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); srcloc: L19 {45#false} is VALID [2020-07-08 23:36:49,439 INFO L280 TraceCheckUtils]: 22: Hoare triple {45#false} assume 0 == #t~mem4; {45#false} is VALID [2020-07-08 23:36:49,440 INFO L280 TraceCheckUtils]: 23: Hoare triple {45#false} havoc #t~mem4; {45#false} is VALID [2020-07-08 23:36:49,440 INFO L280 TraceCheckUtils]: 24: Hoare triple {45#false} assume !false; {45#false} is VALID [2020-07-08 23:36:49,452 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-08 23:36:49,454 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [177613986] [2020-07-08 23:36:49,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:36:49,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 23:36:49,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248310293] [2020-07-08 23:36:49,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 23:36:49,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:49,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 23:36:49,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:49,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 23:36:49,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:49,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 23:36:49,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:36:49,563 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2020-07-08 23:36:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:49,863 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2020-07-08 23:36:49,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 23:36:49,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-08 23:36:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:36:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-08 23:36:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:36:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-08 23:36:49,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2020-07-08 23:36:50,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:50,029 INFO L225 Difference]: With dead ends: 54 [2020-07-08 23:36:50,031 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 23:36:50,035 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 23:36:50,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 23:36:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-08 23:36:50,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:50,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-08 23:36:50,122 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-08 23:36:50,122 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-08 23:36:50,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:50,127 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-08 23:36:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-08 23:36:50,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:50,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:50,129 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-08 23:36:50,129 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-08 23:36:50,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:50,134 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-08 23:36:50,134 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-08 23:36:50,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:50,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:50,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:50,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-08 23:36:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2020-07-08 23:36:50,141 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 25 [2020-07-08 23:36:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:50,141 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2020-07-08 23:36:50,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 23:36:50,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2020-07-08 23:36:50,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:50,195 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-08 23:36:50,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 23:36:50,196 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:50,196 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:36:50,197 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:36:50,197 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:50,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:50,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1790244750, now seen corresponding path program 1 times [2020-07-08 23:36:50,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:50,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [100626308] [2020-07-08 23:36:50,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:50,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0; {309#true} is VALID [2020-07-08 23:36:50,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {309#true} #valid := #valid[0 := 0]; {309#true} is VALID [2020-07-08 23:36:50,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {309#true} assume 0 < #StackHeapBarrier; {309#true} is VALID [2020-07-08 23:36:50,373 INFO L280 TraceCheckUtils]: 3: Hoare triple {309#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L5 {309#true} is VALID [2020-07-08 23:36:50,373 INFO L280 TraceCheckUtils]: 4: Hoare triple {309#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {309#true} is VALID [2020-07-08 23:36:50,374 INFO L280 TraceCheckUtils]: 5: Hoare triple {309#true} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L5-2 {309#true} is VALID [2020-07-08 23:36:50,374 INFO L280 TraceCheckUtils]: 6: Hoare triple {309#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {309#true} is VALID [2020-07-08 23:36:50,374 INFO L280 TraceCheckUtils]: 7: Hoare triple {309#true} ~i~0 := 0; {309#true} is VALID [2020-07-08 23:36:50,374 INFO L280 TraceCheckUtils]: 8: Hoare triple {309#true} ~j~0 := 0; {309#true} is VALID [2020-07-08 23:36:50,375 INFO L280 TraceCheckUtils]: 9: Hoare triple {309#true} ~k~0 := 0; {309#true} is VALID [2020-07-08 23:36:50,375 INFO L280 TraceCheckUtils]: 10: Hoare triple {309#true} assume true; {309#true} is VALID [2020-07-08 23:36:50,375 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {309#true} {309#true} #61#return; {309#true} is VALID [2020-07-08 23:36:50,377 INFO L263 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {324#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} is VALID [2020-07-08 23:36:50,377 INFO L280 TraceCheckUtils]: 1: Hoare triple {324#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0; {309#true} is VALID [2020-07-08 23:36:50,378 INFO L280 TraceCheckUtils]: 2: Hoare triple {309#true} #valid := #valid[0 := 0]; {309#true} is VALID [2020-07-08 23:36:50,378 INFO L280 TraceCheckUtils]: 3: Hoare triple {309#true} assume 0 < #StackHeapBarrier; {309#true} is VALID [2020-07-08 23:36:50,378 INFO L280 TraceCheckUtils]: 4: Hoare triple {309#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L5 {309#true} is VALID [2020-07-08 23:36:50,379 INFO L280 TraceCheckUtils]: 5: Hoare triple {309#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {309#true} is VALID [2020-07-08 23:36:50,379 INFO L280 TraceCheckUtils]: 6: Hoare triple {309#true} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L5-2 {309#true} is VALID [2020-07-08 23:36:50,379 INFO L280 TraceCheckUtils]: 7: Hoare triple {309#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {309#true} is VALID [2020-07-08 23:36:50,379 INFO L280 TraceCheckUtils]: 8: Hoare triple {309#true} ~i~0 := 0; {309#true} is VALID [2020-07-08 23:36:50,380 INFO L280 TraceCheckUtils]: 9: Hoare triple {309#true} ~j~0 := 0; {309#true} is VALID [2020-07-08 23:36:50,380 INFO L280 TraceCheckUtils]: 10: Hoare triple {309#true} ~k~0 := 0; {309#true} is VALID [2020-07-08 23:36:50,380 INFO L280 TraceCheckUtils]: 11: Hoare triple {309#true} assume true; {309#true} is VALID [2020-07-08 23:36:50,381 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {309#true} {309#true} #61#return; {309#true} is VALID [2020-07-08 23:36:50,381 INFO L263 TraceCheckUtils]: 13: Hoare triple {309#true} call #t~ret5 := main(); {309#true} is VALID [2020-07-08 23:36:50,381 INFO L280 TraceCheckUtils]: 14: Hoare triple {309#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {309#true} is VALID [2020-07-08 23:36:50,381 INFO L280 TraceCheckUtils]: 15: Hoare triple {309#true} ~k~0 := #t~nondet0; {309#true} is VALID [2020-07-08 23:36:50,382 INFO L280 TraceCheckUtils]: 16: Hoare triple {309#true} havoc #t~nondet0; {309#true} is VALID [2020-07-08 23:36:50,384 INFO L280 TraceCheckUtils]: 17: Hoare triple {309#true} ~i~0 := 0; {323#(= 0 ~i~0)} is VALID [2020-07-08 23:36:50,385 INFO L280 TraceCheckUtils]: 18: Hoare triple {323#(= 0 ~i~0)} SUMMARY for call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); srcloc: L12-5 {323#(= 0 ~i~0)} is VALID [2020-07-08 23:36:50,386 INFO L280 TraceCheckUtils]: 19: Hoare triple {323#(= 0 ~i~0)} assume !(0 != #t~mem1); {323#(= 0 ~i~0)} is VALID [2020-07-08 23:36:50,386 INFO L280 TraceCheckUtils]: 20: Hoare triple {323#(= 0 ~i~0)} havoc #t~mem1; {323#(= 0 ~i~0)} is VALID [2020-07-08 23:36:50,387 INFO L280 TraceCheckUtils]: 21: Hoare triple {323#(= 0 ~i~0)} SUMMARY for call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); srcloc: L12-6 {323#(= 0 ~i~0)} is VALID [2020-07-08 23:36:50,388 INFO L280 TraceCheckUtils]: 22: Hoare triple {323#(= 0 ~i~0)} assume ~k~0 >= 0 && ~k~0 < ~i~0; {310#false} is VALID [2020-07-08 23:36:50,388 INFO L280 TraceCheckUtils]: 23: Hoare triple {310#false} SUMMARY for call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); srcloc: L19 {310#false} is VALID [2020-07-08 23:36:50,389 INFO L280 TraceCheckUtils]: 24: Hoare triple {310#false} assume 0 == #t~mem4; {310#false} is VALID [2020-07-08 23:36:50,389 INFO L280 TraceCheckUtils]: 25: Hoare triple {310#false} havoc #t~mem4; {310#false} is VALID [2020-07-08 23:36:50,389 INFO L280 TraceCheckUtils]: 26: Hoare triple {310#false} assume !false; {310#false} is VALID [2020-07-08 23:36:50,391 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-08 23:36:50,392 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [100626308] [2020-07-08 23:36:50,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:36:50,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 23:36:50,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307910468] [2020-07-08 23:36:50,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-08 23:36:50,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:50,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 23:36:50,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:50,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 23:36:50,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:50,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 23:36:50,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 23:36:50,430 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 4 states. [2020-07-08 23:36:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:50,730 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-07-08 23:36:50,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 23:36:50,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-07-08 23:36:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:36:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2020-07-08 23:36:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 23:36:50,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2020-07-08 23:36:50,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2020-07-08 23:36:50,819 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:50,822 INFO L225 Difference]: With dead ends: 51 [2020-07-08 23:36:50,822 INFO L226 Difference]: Without dead ends: 43 [2020-07-08 23:36:50,824 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:36:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-08 23:36:50,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2020-07-08 23:36:50,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:50,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 37 states. [2020-07-08 23:36:50,873 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 37 states. [2020-07-08 23:36:50,874 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 37 states. [2020-07-08 23:36:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:50,877 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-08 23:36:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-08 23:36:50,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:50,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:50,879 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 43 states. [2020-07-08 23:36:50,879 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 43 states. [2020-07-08 23:36:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:50,883 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-08 23:36:50,883 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-08 23:36:50,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:50,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:50,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:50,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-08 23:36:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2020-07-08 23:36:50,888 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 27 [2020-07-08 23:36:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:50,888 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2020-07-08 23:36:50,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 23:36:50,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2020-07-08 23:36:50,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2020-07-08 23:36:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-08 23:36:50,940 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:50,941 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:36:50,941 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:36:50,941 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:50,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:50,942 INFO L82 PathProgramCache]: Analyzing trace with hash -189710638, now seen corresponding path program 1 times [2020-07-08 23:36:50,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:50,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1028642541] [2020-07-08 23:36:50,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:51,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {608#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0; {591#true} is VALID [2020-07-08 23:36:51,234 INFO L280 TraceCheckUtils]: 1: Hoare triple {591#true} #valid := #valid[0 := 0]; {591#true} is VALID [2020-07-08 23:36:51,235 INFO L280 TraceCheckUtils]: 2: Hoare triple {591#true} assume 0 < #StackHeapBarrier; {591#true} is VALID [2020-07-08 23:36:51,236 INFO L280 TraceCheckUtils]: 3: Hoare triple {591#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L5 {609#(= 1 (select |#valid| |~#x~0.base|))} is VALID [2020-07-08 23:36:51,237 INFO L280 TraceCheckUtils]: 4: Hoare triple {609#(= 1 (select |#valid| |~#x~0.base|))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {610#(and (= 1 (select |#valid| |~#x~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,239 INFO L280 TraceCheckUtils]: 5: Hoare triple {610#(and (= 1 (select |#valid| |~#x~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L5-2 {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,240 INFO L280 TraceCheckUtils]: 6: Hoare triple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,241 INFO L280 TraceCheckUtils]: 7: Hoare triple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} ~i~0 := 0; {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,242 INFO L280 TraceCheckUtils]: 8: Hoare triple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} ~j~0 := 0; {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,243 INFO L280 TraceCheckUtils]: 9: Hoare triple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} ~k~0 := 0; {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,246 INFO L280 TraceCheckUtils]: 10: Hoare triple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} assume true; {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,248 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} {591#true} #61#return; {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,250 INFO L263 TraceCheckUtils]: 0: Hoare triple {591#true} call ULTIMATE.init(); {608#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} is VALID [2020-07-08 23:36:51,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {608#(and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|))} #NULL.base, #NULL.offset := 0, 0; {591#true} is VALID [2020-07-08 23:36:51,251 INFO L280 TraceCheckUtils]: 2: Hoare triple {591#true} #valid := #valid[0 := 0]; {591#true} is VALID [2020-07-08 23:36:51,251 INFO L280 TraceCheckUtils]: 3: Hoare triple {591#true} assume 0 < #StackHeapBarrier; {591#true} is VALID [2020-07-08 23:36:51,260 INFO L280 TraceCheckUtils]: 4: Hoare triple {591#true} SUMMARY for call ~#x~0.base, ~#x~0.offset := #Ultimate.allocOnStack(100); srcloc: L5 {609#(= 1 (select |#valid| |~#x~0.base|))} is VALID [2020-07-08 23:36:51,261 INFO L280 TraceCheckUtils]: 5: Hoare triple {609#(= 1 (select |#valid| |~#x~0.base|))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {610#(and (= 1 (select |#valid| |~#x~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,262 INFO L280 TraceCheckUtils]: 6: Hoare triple {610#(and (= 1 (select |#valid| |~#x~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} SUMMARY for call ~#y~0.base, ~#y~0.offset := #Ultimate.allocOnStack(100); srcloc: L5-2 {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,264 INFO L280 TraceCheckUtils]: 7: Hoare triple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#y~0.base); {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,267 INFO L280 TraceCheckUtils]: 8: Hoare triple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} ~i~0 := 0; {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,268 INFO L280 TraceCheckUtils]: 9: Hoare triple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} ~j~0 := 0; {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,269 INFO L280 TraceCheckUtils]: 10: Hoare triple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} ~k~0 := 0; {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,270 INFO L280 TraceCheckUtils]: 11: Hoare triple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} assume true; {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,271 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} {591#true} #61#return; {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,272 INFO L263 TraceCheckUtils]: 13: Hoare triple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} call #t~ret5 := main(); {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,273 INFO L280 TraceCheckUtils]: 14: Hoare triple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,274 INFO L280 TraceCheckUtils]: 15: Hoare triple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} ~k~0 := #t~nondet0; {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,275 INFO L280 TraceCheckUtils]: 16: Hoare triple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} havoc #t~nondet0; {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} is VALID [2020-07-08 23:36:51,276 INFO L280 TraceCheckUtils]: 17: Hoare triple {605#(and (not (= |~#x~0.base| |~#y~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|)))} ~i~0 := 0; {606#(and (not (= |~#x~0.base| |~#y~0.base|)) (= 0 (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|))))} is VALID [2020-07-08 23:36:51,277 INFO L280 TraceCheckUtils]: 18: Hoare triple {606#(and (not (= |~#x~0.base| |~#y~0.base|)) (= 0 (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|))))} SUMMARY for call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); srcloc: L12-5 {607#(and (not (= |~#x~0.base| |~#y~0.base|)) (= 0 |main_#t~mem1|) (= 0 (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|))))} is VALID [2020-07-08 23:36:51,277 INFO L280 TraceCheckUtils]: 19: Hoare triple {607#(and (not (= |~#x~0.base| |~#y~0.base|)) (= 0 |main_#t~mem1|) (= 0 (select (select |#memory_int| |~#x~0.base|) (+ ~i~0 |~#x~0.offset|))))} assume !!(0 != #t~mem1); {592#false} is VALID [2020-07-08 23:36:51,278 INFO L280 TraceCheckUtils]: 20: Hoare triple {592#false} havoc #t~mem1; {592#false} is VALID [2020-07-08 23:36:51,278 INFO L280 TraceCheckUtils]: 21: Hoare triple {592#false} SUMMARY for call #t~mem2 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); srcloc: L13 {592#false} is VALID [2020-07-08 23:36:51,278 INFO L280 TraceCheckUtils]: 22: Hoare triple {592#false} SUMMARY for call write~int(#t~mem2, ~#y~0.base, ~#y~0.offset + ~i~0, 1); srcloc: L13-1 {592#false} is VALID [2020-07-08 23:36:51,279 INFO L280 TraceCheckUtils]: 23: Hoare triple {592#false} havoc #t~mem2; {592#false} is VALID [2020-07-08 23:36:51,279 INFO L280 TraceCheckUtils]: 24: Hoare triple {592#false} #t~post3 := ~i~0; {592#false} is VALID [2020-07-08 23:36:51,279 INFO L280 TraceCheckUtils]: 25: Hoare triple {592#false} ~i~0 := 1 + #t~post3; {592#false} is VALID [2020-07-08 23:36:51,279 INFO L280 TraceCheckUtils]: 26: Hoare triple {592#false} havoc #t~post3; {592#false} is VALID [2020-07-08 23:36:51,280 INFO L280 TraceCheckUtils]: 27: Hoare triple {592#false} SUMMARY for call #t~mem1 := read~int(~#x~0.base, ~#x~0.offset + ~i~0, 1); srcloc: L12-5 {592#false} is VALID [2020-07-08 23:36:51,280 INFO L280 TraceCheckUtils]: 28: Hoare triple {592#false} assume !(0 != #t~mem1); {592#false} is VALID [2020-07-08 23:36:51,280 INFO L280 TraceCheckUtils]: 29: Hoare triple {592#false} havoc #t~mem1; {592#false} is VALID [2020-07-08 23:36:51,280 INFO L280 TraceCheckUtils]: 30: Hoare triple {592#false} SUMMARY for call write~int(0, ~#y~0.base, ~#y~0.offset + ~i~0, 1); srcloc: L12-6 {592#false} is VALID [2020-07-08 23:36:51,281 INFO L280 TraceCheckUtils]: 31: Hoare triple {592#false} assume ~k~0 >= 0 && ~k~0 < ~i~0; {592#false} is VALID [2020-07-08 23:36:51,281 INFO L280 TraceCheckUtils]: 32: Hoare triple {592#false} SUMMARY for call #t~mem4 := read~int(~#y~0.base, ~#y~0.offset + ~k~0, 1); srcloc: L19 {592#false} is VALID [2020-07-08 23:36:51,281 INFO L280 TraceCheckUtils]: 33: Hoare triple {592#false} assume 0 == #t~mem4; {592#false} is VALID [2020-07-08 23:36:51,281 INFO L280 TraceCheckUtils]: 34: Hoare triple {592#false} havoc #t~mem4; {592#false} is VALID [2020-07-08 23:36:51,282 INFO L280 TraceCheckUtils]: 35: Hoare triple {592#false} assume !false; {592#false} is VALID [2020-07-08 23:36:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:36:51,286 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1028642541] [2020-07-08 23:36:51,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:36:51,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 23:36:51,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582799661] [2020-07-08 23:36:51,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2020-07-08 23:36:51,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:51,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 23:36:51,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:51,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 23:36:51,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:51,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 23:36:51,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-08 23:36:51,331 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 8 states. [2020-07-08 23:36:51,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:51,686 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-08 23:36:51,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 23:36:51,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2020-07-08 23:36:51,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:36:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2020-07-08 23:36:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 23:36:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2020-07-08 23:36:51,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2020-07-08 23:36:51,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:51,733 INFO L225 Difference]: With dead ends: 37 [2020-07-08 23:36:51,733 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 23:36:51,734 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-08 23:36:51,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 23:36:51,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 23:36:51,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:51,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 23:36:51,735 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:36:51,735 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:36:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:51,735 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:36:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:36:51,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:51,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:51,736 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 23:36:51,736 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 23:36:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:51,736 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 23:36:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:36:51,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:51,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:51,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:51,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:51,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 23:36:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 23:36:51,738 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2020-07-08 23:36:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:51,738 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 23:36:51,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 23:36:51,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-08 23:36:51,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 23:36:51,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:51,739 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:36:51,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 23:36:52,382 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 23:36:52,382 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-08 23:36:52,382 INFO L264 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (not (= |~#x~0.base| |~#y~0.base|)) (= 1 (select |#valid| |~#x~0.base|)) (= 0 ~i~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-08 23:36:52,383 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |~#y~0.offset| |old(~#y~0.offset)|) (= ~i~0 |old(~i~0)|) (= ~j~0 |old(~j~0)|) (= |#valid| |old(#valid)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |~#y~0.base| |old(~#y~0.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#memory_int| |old(#memory_int)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |~#x~0.offset| |old(~#x~0.offset)|) (= |old(#length)| |#length|) (= ~k~0 |old(~k~0)|)) [2020-07-08 23:36:52,383 INFO L264 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: (and (not (= |~#x~0.base| |~#y~0.base|)) (= 1 (select |#valid| |~#x~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-08 23:36:52,383 INFO L271 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: true [2020-07-08 23:36:52,383 INFO L264 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: (and (not (= |~#x~0.base| |~#y~0.base|)) (= 1 (select |#valid| |~#x~0.base|)) (= 0 ~i~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-08 23:36:52,384 INFO L264 CegarLoopResult]: At program point L5-1(line 5) the Hoare annotation is: (= 1 (select |#valid| |~#x~0.base|)) [2020-07-08 23:36:52,384 INFO L264 CegarLoopResult]: At program point L6-2(line 6) the Hoare annotation is: (and (not (= |~#x~0.base| |~#y~0.base|)) (= 1 (select |#valid| |~#x~0.base|)) (= 0 ~i~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-08 23:36:52,384 INFO L264 CegarLoopResult]: At program point L5-2(line 5) the Hoare annotation is: (and (= 1 (select |#valid| |~#x~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-08 23:36:52,384 INFO L264 CegarLoopResult]: At program point L5-3(line 5) the Hoare annotation is: (and (not (= |~#x~0.base| |~#y~0.base|)) (= 1 (select |#valid| |~#x~0.base|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-08 23:36:52,384 INFO L264 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (not (= |~#x~0.base| |~#y~0.base|)) (= 1 (select |#valid| |~#x~0.base|)) (= 0 ~i~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-08 23:36:52,384 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-08 23:36:52,385 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (not (= |~#x~0.base| |~#y~0.base|)) (= 1 (select |#valid| |~#x~0.base|)) (= 0 ~i~0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#x~0.base|))) [2020-07-08 23:36:52,385 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 23:36:52,385 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-08 23:36:52,385 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 8 23) the Hoare annotation is: true [2020-07-08 23:36:52,385 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (= |~#y~0.base| |~#x~0.base|) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,385 INFO L264 CegarLoopResult]: At program point L19-1(lines 19 20) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (= |~#y~0.base| |~#x~0.base|) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,386 INFO L264 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (= |~#y~0.base| |~#x~0.base|) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,386 INFO L271 CegarLoopResult]: At program point L19-4(line 19) the Hoare annotation is: true [2020-07-08 23:36:52,386 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (= |~#y~0.base| |~#x~0.base|) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,386 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 8 23) the Hoare annotation is: true [2020-07-08 23:36:52,386 INFO L264 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (= |~#y~0.base| |~#x~0.base|) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,387 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= 0 |old(~i~0)|)) (and (= 0 ~i~0) (= .cse0 (select |#memory_int| |~#x~0.base|))) (= |~#x~0.base| |~#y~0.base|) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))) (not (= 1 (select |#valid| |~#x~0.base|))))) [2020-07-08 23:36:52,387 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (= |~#y~0.base| |~#x~0.base|) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,387 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (and (= 0 ~i~0) (= |#memory_int| |old(#memory_int)|) (= ~k~0 |old(~k~0)|)) (= |~#x~0.base| |~#y~0.base|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,387 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= 0 |old(~i~0)|)) (and (= 0 ~i~0) (= .cse0 (select |#memory_int| |~#x~0.base|))) (= |~#x~0.base| |~#y~0.base|) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))) (not (= 1 (select |#valid| |~#x~0.base|))))) [2020-07-08 23:36:52,387 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (= |~#y~0.base| |~#x~0.base|) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,388 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 8 23) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (and (= 0 ~i~0) (= |#memory_int| |old(#memory_int)|) (= ~k~0 |old(~k~0)|)) (= |~#x~0.base| |~#y~0.base|) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,388 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (= |~#y~0.base| |~#x~0.base|) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,388 INFO L271 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: true [2020-07-08 23:36:52,388 INFO L264 CegarLoopResult]: At program point L16(lines 8 23) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (= 0 ~i~0) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (= |~#y~0.base| |~#x~0.base|) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,388 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (= |~#y~0.base| |~#x~0.base|) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,388 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (= |~#y~0.base| |~#x~0.base|) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,389 INFO L264 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (= |~#y~0.base| |~#x~0.base|) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,389 INFO L264 CegarLoopResult]: At program point L12-1(lines 12 15) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= 0 |old(~i~0)|)) (and (= 0 |main_#t~mem1|) (= 0 ~i~0) (= .cse0 (select |#memory_int| |~#x~0.base|))) (= |~#x~0.base| |~#y~0.base|) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))) (not (= 1 (select |#valid| |~#x~0.base|))))) [2020-07-08 23:36:52,389 INFO L264 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (= 0 ~i~0) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (= |~#y~0.base| |~#x~0.base|) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,389 INFO L264 CegarLoopResult]: At program point L12-4(line 12) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (= |~#y~0.base| |~#x~0.base|) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,390 INFO L264 CegarLoopResult]: At program point L12-5(lines 12 15) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (= 0 |old(~i~0)|)) (and (= 0 ~i~0) (= .cse0 (select |#memory_int| |~#x~0.base|))) (= |~#x~0.base| |~#y~0.base|) (not (= .cse0 (select |old(#memory_int)| |~#x~0.base|))) (not (= 1 (select |#valid| |~#x~0.base|))))) [2020-07-08 23:36:52,390 INFO L264 CegarLoopResult]: At program point L12-6(lines 12 15) the Hoare annotation is: (or (not (= 0 |old(~i~0)|)) (= 0 ~i~0) (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |~#x~0.base|))) (= |~#y~0.base| |~#x~0.base|) (not (= 1 (select |#valid| |~#x~0.base|)))) [2020-07-08 23:36:52,416 INFO L163 areAnnotationChecker]: CFG has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 23:36:52,423 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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-08 23:36:52,428 INFO L168 Benchmark]: Toolchain (without parser) took 4370.98 ms. Allocated memory was 143.7 MB in the beginning and 249.6 MB in the end (delta: 105.9 MB). Free memory was 102.1 MB in the beginning and 135.6 MB in the end (delta: -33.5 MB). Peak memory consumption was 72.4 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:52,429 INFO L168 Benchmark]: CDTParser took 1.04 ms. Allocated memory is still 143.7 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 23:36:52,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.02 ms. Allocated memory is still 143.7 MB. Free memory was 101.7 MB in the beginning and 91.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:52,431 INFO L168 Benchmark]: Boogie Preprocessor took 141.04 ms. Allocated memory was 143.7 MB in the beginning and 199.8 MB in the end (delta: 56.1 MB). Free memory was 91.5 MB in the beginning and 177.8 MB in the end (delta: -86.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:52,432 INFO L168 Benchmark]: RCFGBuilder took 408.30 ms. Allocated memory is still 199.8 MB. Free memory was 177.8 MB in the beginning and 155.4 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:52,433 INFO L168 Benchmark]: TraceAbstraction took 3495.56 ms. Allocated memory was 199.8 MB in the beginning and 249.6 MB in the end (delta: 49.8 MB). Free memory was 155.4 MB in the beginning and 135.6 MB in the end (delta: 19.8 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:52,437 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04 ms. Allocated memory is still 143.7 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 320.02 ms. Allocated memory is still 143.7 MB. Free memory was 101.7 MB in the beginning and 91.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 141.04 ms. Allocated memory was 143.7 MB in the beginning and 199.8 MB in the end (delta: 56.1 MB). Free memory was 91.5 MB in the beginning and 177.8 MB in the end (delta: -86.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 408.30 ms. Allocated memory is still 199.8 MB. Free memory was 177.8 MB in the beginning and 155.4 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3495.56 ms. Allocated memory was 199.8 MB in the beginning and 249.6 MB in the end (delta: 49.8 MB). Free memory was 155.4 MB in the beginning and 135.6 MB in the end (delta: 19.8 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...