/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/array-fpi/condgf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:35:00,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:35:00,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:35:00,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:35:00,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:35:00,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:35:00,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:35:00,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:35:00,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:35:00,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:35:00,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:35:00,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:35:00,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:35:00,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:35:00,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:35:00,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:35:00,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:35:00,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:35:00,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:35:00,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:35:00,562 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:35:00,563 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:35:00,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:35:00,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:35:00,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:35:00,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:35:00,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:35:00,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:35:00,569 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:35:00,570 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:35:00,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:35:00,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:35:00,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:35:00,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:35:00,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:35:00,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:35:00,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:35:00,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:35:00,575 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:35:00,576 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:35:00,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:35:00,578 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:35:00,587 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:35:00,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:35:00,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:35:00,589 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:35:00,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:35:00,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:35:00,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:35:00,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:35:00,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:35:00,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:35:00,590 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:35:00,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:35:00,590 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:35:00,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:35:00,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:35:00,591 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:35:00,591 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:35:00,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:35:00,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:35:00,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:35:00,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:35:00,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:35:00,592 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:35:00,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:35:00,895 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:35:00,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:35:00,900 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:35:00,901 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:35:00,901 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condgf.c [2020-07-08 23:35:00,963 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d8dbfb9/cc17ed45bf3e4966886d287cd911347a/FLAG5bb978db7 [2020-07-08 23:35:01,423 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:35:01,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condgf.c [2020-07-08 23:35:01,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d8dbfb9/cc17ed45bf3e4966886d287cd911347a/FLAG5bb978db7 [2020-07-08 23:35:01,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44d8dbfb9/cc17ed45bf3e4966886d287cd911347a [2020-07-08 23:35:01,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:35:01,851 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:35:01,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:35:01,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:35:01,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:35:01,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:35:01" (1/1) ... [2020-07-08 23:35:01,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a37042a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:01, skipping insertion in model container [2020-07-08 23:35:01,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:35:01" (1/1) ... [2020-07-08 23:35:01,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:35:01,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:35:02,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:35:02,175 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:35:02,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:35:02,217 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:35:02,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:02 WrapperNode [2020-07-08 23:35:02,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:35:02,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:35:02,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:35:02,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:35:02,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:02" (1/1) ... [2020-07-08 23:35:02,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:02" (1/1) ... [2020-07-08 23:35:02,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:02" (1/1) ... [2020-07-08 23:35:02,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:02" (1/1) ... [2020-07-08 23:35:02,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:02" (1/1) ... [2020-07-08 23:35:02,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:02" (1/1) ... [2020-07-08 23:35:02,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:02" (1/1) ... [2020-07-08 23:35:02,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:35:02,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:35:02,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:35:02,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:35:02,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:02" (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:35:02,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:35:02,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:35:02,473 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:35:02,474 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:35:02,474 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:35:02,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:35:02,474 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:35:02,474 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:35:02,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:35:02,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:35:02,475 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 23:35:02,475 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:35:02,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 23:35:02,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 23:35:02,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 23:35:02,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 23:35:02,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 23:35:02,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:35:02,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:35:03,061 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:35:03,062 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-08 23:35:03,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:35:03 BoogieIcfgContainer [2020-07-08 23:35:03,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:35:03,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:35:03,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:35:03,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:35:03,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:35:01" (1/3) ... [2020-07-08 23:35:03,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bda352c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:35:03, skipping insertion in model container [2020-07-08 23:35:03,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:02" (2/3) ... [2020-07-08 23:35:03,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bda352c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:35:03, skipping insertion in model container [2020-07-08 23:35:03,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:35:03" (3/3) ... [2020-07-08 23:35:03,078 INFO L109 eAbstractionObserver]: Analyzing ICFG condgf.c [2020-07-08 23:35:03,090 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:35:03,100 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:35:03,117 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:35:03,145 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:35:03,145 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:35:03,146 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:35:03,146 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:35:03,146 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:35:03,147 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:35:03,147 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:35:03,147 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:35:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2020-07-08 23:35:03,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-08 23:35:03,176 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:03,177 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:35:03,177 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:03,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:03,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1924334027, now seen corresponding path program 1 times [2020-07-08 23:35:03,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:03,192 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [787787881] [2020-07-08 23:35:03,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:03,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {79#true} is VALID [2020-07-08 23:35:03,435 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} #valid := #valid[0 := 0]; {79#true} is VALID [2020-07-08 23:35:03,436 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} assume 0 < #StackHeapBarrier; {79#true} is VALID [2020-07-08 23:35:03,436 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} ~N~0 := 0; {79#true} is VALID [2020-07-08 23:35:03,437 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-08 23:35:03,440 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {79#true} {79#true} #138#return; {79#true} is VALID [2020-07-08 23:35:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:03,465 INFO L280 TraceCheckUtils]: 0: Hoare triple {79#true} ~cond := #in~cond; {79#true} is VALID [2020-07-08 23:35:03,465 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} assume !(0 == ~cond); {79#true} is VALID [2020-07-08 23:35:03,466 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-08 23:35:03,466 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {79#true} {79#true} #134#return; {79#true} is VALID [2020-07-08 23:35:03,468 INFO L263 TraceCheckUtils]: 0: Hoare triple {79#true} call ULTIMATE.init(); {91#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:35:03,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {79#true} is VALID [2020-07-08 23:35:03,469 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} #valid := #valid[0 := 0]; {79#true} is VALID [2020-07-08 23:35:03,469 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} assume 0 < #StackHeapBarrier; {79#true} is VALID [2020-07-08 23:35:03,470 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#true} ~N~0 := 0; {79#true} is VALID [2020-07-08 23:35:03,470 INFO L280 TraceCheckUtils]: 5: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-08 23:35:03,471 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {79#true} {79#true} #138#return; {79#true} is VALID [2020-07-08 23:35:03,471 INFO L263 TraceCheckUtils]: 7: Hoare triple {79#true} call #t~ret12 := main(); {79#true} is VALID [2020-07-08 23:35:03,471 INFO L280 TraceCheckUtils]: 8: Hoare triple {79#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {79#true} is VALID [2020-07-08 23:35:03,472 INFO L280 TraceCheckUtils]: 9: Hoare triple {79#true} ~N~0 := #t~nondet0; {79#true} is VALID [2020-07-08 23:35:03,472 INFO L280 TraceCheckUtils]: 10: Hoare triple {79#true} havoc #t~nondet0; {79#true} is VALID [2020-07-08 23:35:03,473 INFO L280 TraceCheckUtils]: 11: Hoare triple {79#true} assume !(~N~0 <= 0); {79#true} is VALID [2020-07-08 23:35:03,473 INFO L263 TraceCheckUtils]: 12: Hoare triple {79#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {79#true} is VALID [2020-07-08 23:35:03,473 INFO L280 TraceCheckUtils]: 13: Hoare triple {79#true} ~cond := #in~cond; {79#true} is VALID [2020-07-08 23:35:03,474 INFO L280 TraceCheckUtils]: 14: Hoare triple {79#true} assume !(0 == ~cond); {79#true} is VALID [2020-07-08 23:35:03,474 INFO L280 TraceCheckUtils]: 15: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-08 23:35:03,475 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {79#true} {79#true} #134#return; {79#true} is VALID [2020-07-08 23:35:03,475 INFO L280 TraceCheckUtils]: 17: Hoare triple {79#true} havoc ~i~0; {79#true} is VALID [2020-07-08 23:35:03,475 INFO L280 TraceCheckUtils]: 18: Hoare triple {79#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {79#true} is VALID [2020-07-08 23:35:03,476 INFO L280 TraceCheckUtils]: 19: Hoare triple {79#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {79#true} is VALID [2020-07-08 23:35:03,476 INFO L280 TraceCheckUtils]: 20: Hoare triple {79#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {79#true} is VALID [2020-07-08 23:35:03,477 INFO L280 TraceCheckUtils]: 21: Hoare triple {79#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {79#true} is VALID [2020-07-08 23:35:03,477 INFO L280 TraceCheckUtils]: 22: Hoare triple {79#true} ~i~0 := 0; {79#true} is VALID [2020-07-08 23:35:03,478 INFO L280 TraceCheckUtils]: 23: Hoare triple {79#true} assume !true; {80#false} is VALID [2020-07-08 23:35:03,479 INFO L280 TraceCheckUtils]: 24: Hoare triple {80#false} ~i~0 := 0; {80#false} is VALID [2020-07-08 23:35:03,479 INFO L280 TraceCheckUtils]: 25: Hoare triple {80#false} assume !true; {80#false} is VALID [2020-07-08 23:35:03,480 INFO L280 TraceCheckUtils]: 26: Hoare triple {80#false} ~i~0 := 0; {80#false} is VALID [2020-07-08 23:35:03,480 INFO L280 TraceCheckUtils]: 27: Hoare triple {80#false} assume !(~i~0 < ~N~0); {80#false} is VALID [2020-07-08 23:35:03,480 INFO L280 TraceCheckUtils]: 28: Hoare triple {80#false} ~i~0 := 0; {80#false} is VALID [2020-07-08 23:35:03,481 INFO L280 TraceCheckUtils]: 29: Hoare triple {80#false} assume !!(~i~0 < ~N~0); {80#false} is VALID [2020-07-08 23:35:03,481 INFO L280 TraceCheckUtils]: 30: Hoare triple {80#false} SUMMARY for call #t~mem11 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L51 {80#false} is VALID [2020-07-08 23:35:03,481 INFO L263 TraceCheckUtils]: 31: Hoare triple {80#false} call __VERIFIER_assert((if 0 == #t~mem11 then 1 else 0)); {80#false} is VALID [2020-07-08 23:35:03,482 INFO L280 TraceCheckUtils]: 32: Hoare triple {80#false} ~cond := #in~cond; {80#false} is VALID [2020-07-08 23:35:03,482 INFO L280 TraceCheckUtils]: 33: Hoare triple {80#false} assume 0 == ~cond; {80#false} is VALID [2020-07-08 23:35:03,483 INFO L280 TraceCheckUtils]: 34: Hoare triple {80#false} assume !false; {80#false} is VALID [2020-07-08 23:35:03,488 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:35:03,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [787787881] [2020-07-08 23:35:03,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:35:03,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 23:35:03,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771474650] [2020-07-08 23:35:03,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-07-08 23:35:03,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:03,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 23:35:03,567 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:35:03,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 23:35:03,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:03,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 23:35:03,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:35:03,581 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2020-07-08 23:35:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:04,080 INFO L93 Difference]: Finished difference Result 135 states and 156 transitions. [2020-07-08 23:35:04,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 23:35:04,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-07-08 23:35:04,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:35:04,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-08 23:35:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:35:04,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-08 23:35:04,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2020-07-08 23:35:04,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:04,389 INFO L225 Difference]: With dead ends: 135 [2020-07-08 23:35:04,389 INFO L226 Difference]: Without dead ends: 67 [2020-07-08 23:35:04,403 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:35:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-08 23:35:04,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-07-08 23:35:04,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:35:04,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2020-07-08 23:35:04,540 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2020-07-08 23:35:04,540 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2020-07-08 23:35:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:04,547 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2020-07-08 23:35:04,547 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2020-07-08 23:35:04,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:04,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:04,549 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2020-07-08 23:35:04,549 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2020-07-08 23:35:04,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:04,555 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2020-07-08 23:35:04,555 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2020-07-08 23:35:04,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:04,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:04,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:35:04,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:35:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-08 23:35:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2020-07-08 23:35:04,564 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 35 [2020-07-08 23:35:04,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:35:04,564 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2020-07-08 23:35:04,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 23:35:04,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 71 transitions. [2020-07-08 23:35:04,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2020-07-08 23:35:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-08 23:35:04,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:04,654 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:35:04,655 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:35:04,655 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:04,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:04,656 INFO L82 PathProgramCache]: Analyzing trace with hash -977702175, now seen corresponding path program 1 times [2020-07-08 23:35:04,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:04,656 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2136398272] [2020-07-08 23:35:04,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:04,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {646#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {632#true} is VALID [2020-07-08 23:35:04,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {632#true} #valid := #valid[0 := 0]; {632#true} is VALID [2020-07-08 23:35:04,780 INFO L280 TraceCheckUtils]: 2: Hoare triple {632#true} assume 0 < #StackHeapBarrier; {632#true} is VALID [2020-07-08 23:35:04,780 INFO L280 TraceCheckUtils]: 3: Hoare triple {632#true} ~N~0 := 0; {632#true} is VALID [2020-07-08 23:35:04,781 INFO L280 TraceCheckUtils]: 4: Hoare triple {632#true} assume true; {632#true} is VALID [2020-07-08 23:35:04,781 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {632#true} {632#true} #138#return; {632#true} is VALID [2020-07-08 23:35:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:04,793 INFO L280 TraceCheckUtils]: 0: Hoare triple {632#true} ~cond := #in~cond; {632#true} is VALID [2020-07-08 23:35:04,793 INFO L280 TraceCheckUtils]: 1: Hoare triple {632#true} assume !(0 == ~cond); {632#true} is VALID [2020-07-08 23:35:04,793 INFO L280 TraceCheckUtils]: 2: Hoare triple {632#true} assume true; {632#true} is VALID [2020-07-08 23:35:04,794 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {632#true} {640#(<= 1 ~N~0)} #134#return; {640#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:04,796 INFO L263 TraceCheckUtils]: 0: Hoare triple {632#true} call ULTIMATE.init(); {646#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:35:04,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {646#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {632#true} is VALID [2020-07-08 23:35:04,796 INFO L280 TraceCheckUtils]: 2: Hoare triple {632#true} #valid := #valid[0 := 0]; {632#true} is VALID [2020-07-08 23:35:04,796 INFO L280 TraceCheckUtils]: 3: Hoare triple {632#true} assume 0 < #StackHeapBarrier; {632#true} is VALID [2020-07-08 23:35:04,797 INFO L280 TraceCheckUtils]: 4: Hoare triple {632#true} ~N~0 := 0; {632#true} is VALID [2020-07-08 23:35:04,797 INFO L280 TraceCheckUtils]: 5: Hoare triple {632#true} assume true; {632#true} is VALID [2020-07-08 23:35:04,797 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {632#true} {632#true} #138#return; {632#true} is VALID [2020-07-08 23:35:04,798 INFO L263 TraceCheckUtils]: 7: Hoare triple {632#true} call #t~ret12 := main(); {632#true} is VALID [2020-07-08 23:35:04,798 INFO L280 TraceCheckUtils]: 8: Hoare triple {632#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {632#true} is VALID [2020-07-08 23:35:04,798 INFO L280 TraceCheckUtils]: 9: Hoare triple {632#true} ~N~0 := #t~nondet0; {632#true} is VALID [2020-07-08 23:35:04,798 INFO L280 TraceCheckUtils]: 10: Hoare triple {632#true} havoc #t~nondet0; {632#true} is VALID [2020-07-08 23:35:04,799 INFO L280 TraceCheckUtils]: 11: Hoare triple {632#true} assume !(~N~0 <= 0); {640#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:04,800 INFO L263 TraceCheckUtils]: 12: Hoare triple {640#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {632#true} is VALID [2020-07-08 23:35:04,800 INFO L280 TraceCheckUtils]: 13: Hoare triple {632#true} ~cond := #in~cond; {632#true} is VALID [2020-07-08 23:35:04,800 INFO L280 TraceCheckUtils]: 14: Hoare triple {632#true} assume !(0 == ~cond); {632#true} is VALID [2020-07-08 23:35:04,800 INFO L280 TraceCheckUtils]: 15: Hoare triple {632#true} assume true; {632#true} is VALID [2020-07-08 23:35:04,801 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {632#true} {640#(<= 1 ~N~0)} #134#return; {640#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:04,802 INFO L280 TraceCheckUtils]: 17: Hoare triple {640#(<= 1 ~N~0)} havoc ~i~0; {640#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:04,803 INFO L280 TraceCheckUtils]: 18: Hoare triple {640#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {640#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:04,804 INFO L280 TraceCheckUtils]: 19: Hoare triple {640#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {640#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:04,804 INFO L280 TraceCheckUtils]: 20: Hoare triple {640#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {640#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:04,805 INFO L280 TraceCheckUtils]: 21: Hoare triple {640#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {640#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:04,806 INFO L280 TraceCheckUtils]: 22: Hoare triple {640#(<= 1 ~N~0)} ~i~0 := 0; {645#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 23:35:04,807 INFO L280 TraceCheckUtils]: 23: Hoare triple {645#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {633#false} is VALID [2020-07-08 23:35:04,807 INFO L280 TraceCheckUtils]: 24: Hoare triple {633#false} ~i~0 := 0; {633#false} is VALID [2020-07-08 23:35:04,807 INFO L280 TraceCheckUtils]: 25: Hoare triple {633#false} assume !(~i~0 < ~N~0); {633#false} is VALID [2020-07-08 23:35:04,808 INFO L280 TraceCheckUtils]: 26: Hoare triple {633#false} ~i~0 := 0; {633#false} is VALID [2020-07-08 23:35:04,808 INFO L280 TraceCheckUtils]: 27: Hoare triple {633#false} assume !(~i~0 < ~N~0); {633#false} is VALID [2020-07-08 23:35:04,808 INFO L280 TraceCheckUtils]: 28: Hoare triple {633#false} ~i~0 := 0; {633#false} is VALID [2020-07-08 23:35:04,809 INFO L280 TraceCheckUtils]: 29: Hoare triple {633#false} assume !!(~i~0 < ~N~0); {633#false} is VALID [2020-07-08 23:35:04,809 INFO L280 TraceCheckUtils]: 30: Hoare triple {633#false} SUMMARY for call #t~mem11 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L51 {633#false} is VALID [2020-07-08 23:35:04,809 INFO L263 TraceCheckUtils]: 31: Hoare triple {633#false} call __VERIFIER_assert((if 0 == #t~mem11 then 1 else 0)); {633#false} is VALID [2020-07-08 23:35:04,810 INFO L280 TraceCheckUtils]: 32: Hoare triple {633#false} ~cond := #in~cond; {633#false} is VALID [2020-07-08 23:35:04,810 INFO L280 TraceCheckUtils]: 33: Hoare triple {633#false} assume 0 == ~cond; {633#false} is VALID [2020-07-08 23:35:04,810 INFO L280 TraceCheckUtils]: 34: Hoare triple {633#false} assume !false; {633#false} is VALID [2020-07-08 23:35:04,814 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:35:04,814 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2136398272] [2020-07-08 23:35:04,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:35:04,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 23:35:04,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508634871] [2020-07-08 23:35:04,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-08 23:35:04,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:04,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:35:04,863 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:35:04,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:35:04,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:04,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:35:04,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:35:04,864 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2020-07-08 23:35:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:05,494 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2020-07-08 23:35:05,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:35:05,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-08 23:35:05,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:35:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2020-07-08 23:35:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:35:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2020-07-08 23:35:05,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 149 transitions. [2020-07-08 23:35:05,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:05,683 INFO L225 Difference]: With dead ends: 137 [2020-07-08 23:35:05,683 INFO L226 Difference]: Without dead ends: 98 [2020-07-08 23:35:05,685 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-08 23:35:05,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-08 23:35:05,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 70. [2020-07-08 23:35:05,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:35:05,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 70 states. [2020-07-08 23:35:05,834 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 70 states. [2020-07-08 23:35:05,834 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 70 states. [2020-07-08 23:35:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:05,841 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2020-07-08 23:35:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2020-07-08 23:35:05,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:05,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:05,843 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 98 states. [2020-07-08 23:35:05,843 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 98 states. [2020-07-08 23:35:05,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:05,850 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2020-07-08 23:35:05,850 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2020-07-08 23:35:05,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:05,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:05,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:35:05,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:35:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-08 23:35:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2020-07-08 23:35:05,856 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 35 [2020-07-08 23:35:05,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:35:05,856 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2020-07-08 23:35:05,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:35:05,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 74 transitions. [2020-07-08 23:35:05,961 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2020-07-08 23:35:05,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-08 23:35:05,965 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:05,965 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, 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:35:05,965 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:35:05,965 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:05,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:05,966 INFO L82 PathProgramCache]: Analyzing trace with hash -269448694, now seen corresponding path program 1 times [2020-07-08 23:35:05,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:05,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1876433811] [2020-07-08 23:35:05,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:06,934 INFO L280 TraceCheckUtils]: 0: Hoare triple {1289#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1262#true} is VALID [2020-07-08 23:35:06,934 INFO L280 TraceCheckUtils]: 1: Hoare triple {1262#true} #valid := #valid[0 := 0]; {1262#true} is VALID [2020-07-08 23:35:06,935 INFO L280 TraceCheckUtils]: 2: Hoare triple {1262#true} assume 0 < #StackHeapBarrier; {1262#true} is VALID [2020-07-08 23:35:06,935 INFO L280 TraceCheckUtils]: 3: Hoare triple {1262#true} ~N~0 := 0; {1262#true} is VALID [2020-07-08 23:35:06,935 INFO L280 TraceCheckUtils]: 4: Hoare triple {1262#true} assume true; {1262#true} is VALID [2020-07-08 23:35:06,936 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1262#true} {1262#true} #138#return; {1262#true} is VALID [2020-07-08 23:35:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:06,944 INFO L280 TraceCheckUtils]: 0: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2020-07-08 23:35:06,945 INFO L280 TraceCheckUtils]: 1: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2020-07-08 23:35:06,945 INFO L280 TraceCheckUtils]: 2: Hoare triple {1262#true} assume true; {1262#true} is VALID [2020-07-08 23:35:06,945 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1262#true} {1262#true} #134#return; {1262#true} is VALID [2020-07-08 23:35:06,946 INFO L263 TraceCheckUtils]: 0: Hoare triple {1262#true} call ULTIMATE.init(); {1289#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:35:06,947 INFO L280 TraceCheckUtils]: 1: Hoare triple {1289#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1262#true} is VALID [2020-07-08 23:35:06,947 INFO L280 TraceCheckUtils]: 2: Hoare triple {1262#true} #valid := #valid[0 := 0]; {1262#true} is VALID [2020-07-08 23:35:06,947 INFO L280 TraceCheckUtils]: 3: Hoare triple {1262#true} assume 0 < #StackHeapBarrier; {1262#true} is VALID [2020-07-08 23:35:06,947 INFO L280 TraceCheckUtils]: 4: Hoare triple {1262#true} ~N~0 := 0; {1262#true} is VALID [2020-07-08 23:35:06,948 INFO L280 TraceCheckUtils]: 5: Hoare triple {1262#true} assume true; {1262#true} is VALID [2020-07-08 23:35:06,948 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1262#true} {1262#true} #138#return; {1262#true} is VALID [2020-07-08 23:35:06,948 INFO L263 TraceCheckUtils]: 7: Hoare triple {1262#true} call #t~ret12 := main(); {1262#true} is VALID [2020-07-08 23:35:06,948 INFO L280 TraceCheckUtils]: 8: Hoare triple {1262#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1262#true} is VALID [2020-07-08 23:35:06,949 INFO L280 TraceCheckUtils]: 9: Hoare triple {1262#true} ~N~0 := #t~nondet0; {1262#true} is VALID [2020-07-08 23:35:06,949 INFO L280 TraceCheckUtils]: 10: Hoare triple {1262#true} havoc #t~nondet0; {1262#true} is VALID [2020-07-08 23:35:06,955 INFO L280 TraceCheckUtils]: 11: Hoare triple {1262#true} assume !(~N~0 <= 0); {1262#true} is VALID [2020-07-08 23:35:06,955 INFO L263 TraceCheckUtils]: 12: Hoare triple {1262#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1262#true} is VALID [2020-07-08 23:35:06,955 INFO L280 TraceCheckUtils]: 13: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2020-07-08 23:35:06,956 INFO L280 TraceCheckUtils]: 14: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2020-07-08 23:35:06,956 INFO L280 TraceCheckUtils]: 15: Hoare triple {1262#true} assume true; {1262#true} is VALID [2020-07-08 23:35:06,956 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1262#true} {1262#true} #134#return; {1262#true} is VALID [2020-07-08 23:35:06,957 INFO L280 TraceCheckUtils]: 17: Hoare triple {1262#true} havoc ~i~0; {1262#true} is VALID [2020-07-08 23:35:06,959 INFO L280 TraceCheckUtils]: 18: Hoare triple {1262#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {1274#(= 1 (select |#valid| |main_~#sum~0.base|))} is VALID [2020-07-08 23:35:06,963 INFO L280 TraceCheckUtils]: 19: Hoare triple {1274#(= 1 (select |#valid| |main_~#sum~0.base|))} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {1275#(and (not (= |main_#t~malloc1.base| |main_~#sum~0.base|)) (= 0 |main_#t~malloc1.offset|))} is VALID [2020-07-08 23:35:06,964 INFO L280 TraceCheckUtils]: 20: Hoare triple {1275#(and (not (= |main_#t~malloc1.base| |main_~#sum~0.base|)) (= 0 |main_#t~malloc1.offset|))} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1276#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-08 23:35:06,982 INFO L280 TraceCheckUtils]: 21: Hoare triple {1276#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_~#sum~0.base|)))} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {1277#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-08 23:35:06,985 INFO L280 TraceCheckUtils]: 22: Hoare triple {1277#(and (= 0 main_~a~0.offset) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} ~i~0 := 0; {1278#(and (= 0 (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 2)) |main_~#sum~0.base|) |main_~#sum~0.offset|)) (= 0 main_~a~0.offset) (= 0 (+ (* 4 main_~i~0) main_~a~0.offset)) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-08 23:35:06,987 INFO L280 TraceCheckUtils]: 23: Hoare triple {1278#(and (= 0 (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 2)) |main_~#sum~0.base|) |main_~#sum~0.offset|)) (= 0 main_~a~0.offset) (= 0 (+ (* 4 main_~i~0) main_~a~0.offset)) (not (= main_~a~0.base |main_~#sum~0.base|)))} assume !!(~i~0 < ~N~0); {1278#(and (= 0 (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 2)) |main_~#sum~0.base|) |main_~#sum~0.offset|)) (= 0 main_~a~0.offset) (= 0 (+ (* 4 main_~i~0) main_~a~0.offset)) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-08 23:35:06,988 INFO L280 TraceCheckUtils]: 24: Hoare triple {1278#(and (= 0 (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 2)) |main_~#sum~0.base|) |main_~#sum~0.offset|)) (= 0 main_~a~0.offset) (= 0 (+ (* 4 main_~i~0) main_~a~0.offset)) (not (= main_~a~0.base |main_~#sum~0.base|)))} SUMMARY for call write~int(2, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {1279#(and (= 0 main_~a~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 (+ (* 4 main_~i~0) main_~a~0.offset)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-08 23:35:06,989 INFO L280 TraceCheckUtils]: 25: Hoare triple {1279#(and (= 0 main_~a~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 (+ (* 4 main_~i~0) main_~a~0.offset)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} #t~post2 := ~i~0; {1280#(and (= 2 (select (select |#memory_int| main_~a~0.base) 0)) (= |main_#t~post2| 0) (= 0 main_~a~0.offset) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-08 23:35:06,990 INFO L280 TraceCheckUtils]: 26: Hoare triple {1280#(and (= 2 (select (select |#memory_int| main_~a~0.base) 0)) (= |main_#t~post2| 0) (= 0 main_~a~0.offset) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} ~i~0 := 1 + #t~post2; {1281#(and (= 2 (select (select |#memory_int| main_~a~0.base) 0)) (= 0 main_~a~0.offset) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-08 23:35:06,992 INFO L280 TraceCheckUtils]: 27: Hoare triple {1281#(and (= 2 (select (select |#memory_int| main_~a~0.base) 0)) (= 0 main_~a~0.offset) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} havoc #t~post2; {1281#(and (= 2 (select (select |#memory_int| main_~a~0.base) 0)) (= 0 main_~a~0.offset) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-08 23:35:06,999 INFO L280 TraceCheckUtils]: 28: Hoare triple {1281#(and (= 2 (select (select |#memory_int| main_~a~0.base) 0)) (= 0 main_~a~0.offset) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} assume !(~i~0 < ~N~0); {1282#(and (= 2 (select (select |#memory_int| main_~a~0.base) 0)) (<= ~N~0 1) (= 0 main_~a~0.offset) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-08 23:35:07,000 INFO L280 TraceCheckUtils]: 29: Hoare triple {1282#(and (= 2 (select (select |#memory_int| main_~a~0.base) 0)) (<= ~N~0 1) (= 0 main_~a~0.offset) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} ~i~0 := 0; {1283#(and (<= ~N~0 1) (= 0 main_~a~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-08 23:35:07,001 INFO L280 TraceCheckUtils]: 30: Hoare triple {1283#(and (<= ~N~0 1) (= 0 main_~a~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} assume !!(~i~0 < ~N~0); {1283#(and (<= ~N~0 1) (= 0 main_~a~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} is VALID [2020-07-08 23:35:07,001 INFO L280 TraceCheckUtils]: 31: Hoare triple {1283#(and (<= ~N~0 1) (= 0 main_~a~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~i~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 0))} SUMMARY for call #t~mem4 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L37 {1284#(and (= 0 |main_#t~mem4|) (<= ~N~0 1) (= 0 main_~a~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~i~0))} is VALID [2020-07-08 23:35:07,002 INFO L280 TraceCheckUtils]: 32: Hoare triple {1284#(and (= 0 |main_#t~mem4|) (<= ~N~0 1) (= 0 main_~a~0.offset) (= 2 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= 0 main_~i~0))} SUMMARY for call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L37-1 {1285#(and (not (= (+ |main_#t~mem4| |main_#t~mem5|) ~N~0)) (= 0 main_~a~0.offset) (= 2 |main_#t~mem5|) (= 0 main_~i~0))} is VALID [2020-07-08 23:35:07,003 INFO L280 TraceCheckUtils]: 33: Hoare triple {1285#(and (not (= (+ |main_#t~mem4| |main_#t~mem5|) ~N~0)) (= 0 main_~a~0.offset) (= 2 |main_#t~mem5|) (= 0 main_~i~0))} SUMMARY for call write~int(#t~mem4 + #t~mem5, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L37-2 {1286#(and (= 0 main_~a~0.offset) (= 0 main_~i~0) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} is VALID [2020-07-08 23:35:07,004 INFO L280 TraceCheckUtils]: 34: Hoare triple {1286#(and (= 0 main_~a~0.offset) (= 0 main_~i~0) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} havoc #t~mem4; {1286#(and (= 0 main_~a~0.offset) (= 0 main_~i~0) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} is VALID [2020-07-08 23:35:07,004 INFO L280 TraceCheckUtils]: 35: Hoare triple {1286#(and (= 0 main_~a~0.offset) (= 0 main_~i~0) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} havoc #t~mem5; {1286#(and (= 0 main_~a~0.offset) (= 0 main_~i~0) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} is VALID [2020-07-08 23:35:07,005 INFO L280 TraceCheckUtils]: 36: Hoare triple {1286#(and (= 0 main_~a~0.offset) (= 0 main_~i~0) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} #t~post3 := ~i~0; {1287#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} is VALID [2020-07-08 23:35:07,006 INFO L280 TraceCheckUtils]: 37: Hoare triple {1287#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} ~i~0 := 1 + #t~post3; {1287#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} is VALID [2020-07-08 23:35:07,006 INFO L280 TraceCheckUtils]: 38: Hoare triple {1287#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} havoc #t~post3; {1287#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} is VALID [2020-07-08 23:35:07,007 INFO L280 TraceCheckUtils]: 39: Hoare triple {1287#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} assume !(~i~0 < ~N~0); {1287#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} is VALID [2020-07-08 23:35:07,007 INFO L280 TraceCheckUtils]: 40: Hoare triple {1287#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} ~i~0 := 0; {1287#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} is VALID [2020-07-08 23:35:07,008 INFO L280 TraceCheckUtils]: 41: Hoare triple {1287#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} assume !!(~i~0 < ~N~0); {1287#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} is VALID [2020-07-08 23:35:07,008 INFO L280 TraceCheckUtils]: 42: Hoare triple {1287#(and (= 0 main_~a~0.offset) (not (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) ~N~0)))} SUMMARY for call #t~mem7 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L42 {1288#(and (not (= ~N~0 |main_#t~mem7|)) (= 0 main_~a~0.offset))} is VALID [2020-07-08 23:35:07,009 INFO L280 TraceCheckUtils]: 43: Hoare triple {1288#(and (not (= ~N~0 |main_#t~mem7|)) (= 0 main_~a~0.offset))} assume #t~mem7 == ~N~0; {1263#false} is VALID [2020-07-08 23:35:07,009 INFO L280 TraceCheckUtils]: 44: Hoare triple {1263#false} havoc #t~mem7; {1263#false} is VALID [2020-07-08 23:35:07,009 INFO L280 TraceCheckUtils]: 45: Hoare triple {1263#false} SUMMARY for call #t~mem8 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L43 {1263#false} is VALID [2020-07-08 23:35:07,009 INFO L280 TraceCheckUtils]: 46: Hoare triple {1263#false} SUMMARY for call write~int(#t~mem8 - 1, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L43-1 {1263#false} is VALID [2020-07-08 23:35:07,010 INFO L280 TraceCheckUtils]: 47: Hoare triple {1263#false} havoc #t~mem8; {1263#false} is VALID [2020-07-08 23:35:07,010 INFO L280 TraceCheckUtils]: 48: Hoare triple {1263#false} #t~post6 := ~i~0; {1263#false} is VALID [2020-07-08 23:35:07,010 INFO L280 TraceCheckUtils]: 49: Hoare triple {1263#false} ~i~0 := 1 + #t~post6; {1263#false} is VALID [2020-07-08 23:35:07,010 INFO L280 TraceCheckUtils]: 50: Hoare triple {1263#false} havoc #t~post6; {1263#false} is VALID [2020-07-08 23:35:07,010 INFO L280 TraceCheckUtils]: 51: Hoare triple {1263#false} assume !(~i~0 < ~N~0); {1263#false} is VALID [2020-07-08 23:35:07,011 INFO L280 TraceCheckUtils]: 52: Hoare triple {1263#false} ~i~0 := 0; {1263#false} is VALID [2020-07-08 23:35:07,011 INFO L280 TraceCheckUtils]: 53: Hoare triple {1263#false} assume !!(~i~0 < ~N~0); {1263#false} is VALID [2020-07-08 23:35:07,011 INFO L280 TraceCheckUtils]: 54: Hoare triple {1263#false} SUMMARY for call #t~mem11 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L51 {1263#false} is VALID [2020-07-08 23:35:07,011 INFO L263 TraceCheckUtils]: 55: Hoare triple {1263#false} call __VERIFIER_assert((if 0 == #t~mem11 then 1 else 0)); {1263#false} is VALID [2020-07-08 23:35:07,011 INFO L280 TraceCheckUtils]: 56: Hoare triple {1263#false} ~cond := #in~cond; {1263#false} is VALID [2020-07-08 23:35:07,011 INFO L280 TraceCheckUtils]: 57: Hoare triple {1263#false} assume 0 == ~cond; {1263#false} is VALID [2020-07-08 23:35:07,012 INFO L280 TraceCheckUtils]: 58: Hoare triple {1263#false} assume !false; {1263#false} is VALID [2020-07-08 23:35:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:35:07,036 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1876433811] [2020-07-08 23:35:07,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:35:07,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-07-08 23:35:07,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262375573] [2020-07-08 23:35:07,037 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2020-07-08 23:35:07,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:07,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-08 23:35:07,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:07,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-08 23:35:07,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:07,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-08 23:35:07,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2020-07-08 23:35:07,114 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 18 states. [2020-07-08 23:35:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:10,957 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2020-07-08 23:35:10,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-07-08 23:35:10,957 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2020-07-08 23:35:10,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 23:35:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 169 transitions. [2020-07-08 23:35:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 23:35:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 169 transitions. [2020-07-08 23:35:10,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 169 transitions. [2020-07-08 23:35:11,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:11,216 INFO L225 Difference]: With dead ends: 157 [2020-07-08 23:35:11,217 INFO L226 Difference]: Without dead ends: 129 [2020-07-08 23:35:11,218 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=325, Invalid=1081, Unknown=0, NotChecked=0, Total=1406 [2020-07-08 23:35:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-07-08 23:35:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 98. [2020-07-08 23:35:11,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:35:11,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 98 states. [2020-07-08 23:35:11,572 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 98 states. [2020-07-08 23:35:11,573 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 98 states. [2020-07-08 23:35:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:11,579 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2020-07-08 23:35:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2020-07-08 23:35:11,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:11,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:11,581 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 129 states. [2020-07-08 23:35:11,581 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 129 states. [2020-07-08 23:35:11,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:11,587 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2020-07-08 23:35:11,588 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2020-07-08 23:35:11,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:11,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:11,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:35:11,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:35:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-08 23:35:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2020-07-08 23:35:11,593 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 59 [2020-07-08 23:35:11,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:35:11,599 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2020-07-08 23:35:11,599 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-08 23:35:11,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 98 states and 105 transitions. [2020-07-08 23:35:11,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2020-07-08 23:35:11,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-08 23:35:11,766 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:11,767 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, 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:35:11,767 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:35:11,767 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:11,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1693383620, now seen corresponding path program 1 times [2020-07-08 23:35:11,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:11,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1447684844] [2020-07-08 23:35:11,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:35:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:35:11,869 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 23:35:11,869 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 23:35:11,870 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:35:11,926 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 23:35:11,927 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:35:11,927 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:35:11,927 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:35:11,927 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 23:35:11,927 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 23:35:11,927 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:35:11,927 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:35:11,928 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:35:11,928 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:35:11,928 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:35:11,928 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 23:35:11,928 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:35:11,928 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:35:11,928 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-08 23:35:11,928 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 23:35:11,929 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-08 23:35:11,929 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-08 23:35:11,929 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-08 23:35:11,929 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:35:11,929 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:35:11,929 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 23:35:11,929 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 23:35:11,929 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 23:35:11,930 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:35:11,930 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:35:11,930 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 23:35:11,930 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 23:35:11,930 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 23:35:11,930 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-08 23:35:11,930 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:35:11,930 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:35:11,931 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-08 23:35:11,931 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 23:35:11,931 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 23:35:11,931 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 23:35:11,931 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-08 23:35:11,931 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-08 23:35:11,931 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 23:35:11,931 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2020-07-08 23:35:11,932 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 23:35:11,932 WARN L170 areAnnotationChecker]: L49-4 has no Hoare annotation [2020-07-08 23:35:11,932 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-08 23:35:11,932 WARN L170 areAnnotationChecker]: L49-5 has no Hoare annotation [2020-07-08 23:35:11,932 WARN L170 areAnnotationChecker]: L49-5 has no Hoare annotation [2020-07-08 23:35:11,932 WARN L170 areAnnotationChecker]: L49-5 has no Hoare annotation [2020-07-08 23:35:11,932 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-08 23:35:11,932 WARN L170 areAnnotationChecker]: L49-6 has no Hoare annotation [2020-07-08 23:35:11,932 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-08 23:35:11,932 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:35:11,932 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:35:11,933 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:35:11,933 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-08 23:35:11,933 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2020-07-08 23:35:11,933 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2020-07-08 23:35:11,933 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-08 23:35:11,933 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-08 23:35:11,933 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-08 23:35:11,933 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:35:11,933 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:35:11,933 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:35:11,933 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-08 23:35:11,934 WARN L170 areAnnotationChecker]: L35-6 has no Hoare annotation [2020-07-08 23:35:11,934 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 23:35:11,934 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-08 23:35:11,934 WARN L170 areAnnotationChecker]: L40-5 has no Hoare annotation [2020-07-08 23:35:11,934 WARN L170 areAnnotationChecker]: L40-5 has no Hoare annotation [2020-07-08 23:35:11,934 WARN L170 areAnnotationChecker]: L40-5 has no Hoare annotation [2020-07-08 23:35:11,934 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-08 23:35:11,934 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 23:35:11,934 WARN L170 areAnnotationChecker]: L40-6 has no Hoare annotation [2020-07-08 23:35:11,934 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-08 23:35:11,935 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-08 23:35:11,935 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-08 23:35:11,935 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-08 23:35:11,935 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-08 23:35:11,935 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-08 23:35:11,935 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-08 23:35:11,935 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-08 23:35:11,935 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-08 23:35:11,935 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-08 23:35:11,935 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-08 23:35:11,935 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-08 23:35:11,935 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2020-07-08 23:35:11,935 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 23:35:11,936 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-08 23:35:11,936 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-08 23:35:11,936 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-08 23:35:11,936 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-08 23:35:11,936 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-08 23:35:11,936 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-08 23:35:11,936 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 23:35:11,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:35:11 BoogieIcfgContainer [2020-07-08 23:35:11,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:35:11,942 INFO L168 Benchmark]: Toolchain (without parser) took 10091.60 ms. Allocated memory was 141.6 MB in the beginning and 328.2 MB in the end (delta: 186.6 MB). Free memory was 98.0 MB in the beginning and 114.8 MB in the end (delta: -16.8 MB). Peak memory consumption was 169.9 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:11,943 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 141.6 MB. Free memory was 117.0 MB in the beginning and 116.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 23:35:11,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.23 ms. Allocated memory is still 141.6 MB. Free memory was 97.8 MB in the beginning and 86.5 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:11,945 INFO L168 Benchmark]: Boogie Preprocessor took 184.38 ms. Allocated memory was 141.6 MB in the beginning and 199.2 MB in the end (delta: 57.7 MB). Free memory was 86.5 MB in the beginning and 176.1 MB in the end (delta: -89.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:11,946 INFO L168 Benchmark]: RCFGBuilder took 664.21 ms. Allocated memory is still 199.2 MB. Free memory was 176.1 MB in the beginning and 144.0 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:11,946 INFO L168 Benchmark]: TraceAbstraction took 8870.71 ms. Allocated memory was 199.2 MB in the beginning and 328.2 MB in the end (delta: 129.0 MB). Free memory was 143.3 MB in the beginning and 118.9 MB in the end (delta: 24.3 MB). Peak memory consumption was 153.3 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:11,950 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 0.28 ms. Allocated memory is still 141.6 MB. Free memory was 117.0 MB in the beginning and 116.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 366.23 ms. Allocated memory is still 141.6 MB. Free memory was 97.8 MB in the beginning and 86.5 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 184.38 ms. Allocated memory was 141.6 MB in the beginning and 199.2 MB in the end (delta: 57.7 MB). Free memory was 86.5 MB in the beginning and 176.1 MB in the end (delta: -89.6 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 664.21 ms. Allocated memory is still 199.2 MB. Free memory was 176.1 MB in the beginning and 144.0 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8870.71 ms. Allocated memory was 199.2 MB in the beginning and 328.2 MB in the end (delta: 129.0 MB). Free memory was 143.3 MB in the beginning and 118.9 MB in the end (delta: 24.3 MB). Peak memory consumption was 153.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=10, N=0] [L21] N = __VERIFIER_nondet_int() VAL [\old(N)=0, __VERIFIER_nondet_int()=1, N=1] [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; VAL [\old(N)=0, N=1] [L26] long long sum[1]; VAL [\old(N)=0, N=1, sum={5:0}] [L27] int *a = malloc(sizeof(int)*N); VAL [\old(N)=0, a={-1:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={5:0}] [L29] sum[0] = 0 VAL [\old(N)=0, a={-1:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={5:0}] [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1, sum={5:0}] [L30] COND TRUE i