/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/condaf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:34:59,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:34:59,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:34:59,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:34:59,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:34:59,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:34:59,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:34:59,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:34:59,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:34:59,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:34:59,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:34:59,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:34:59,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:34:59,878 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:34:59,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:34:59,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:34:59,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:34:59,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:34:59,884 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:34:59,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:34:59,888 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:34:59,889 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:34:59,890 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:34:59,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:34:59,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:34:59,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:34:59,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:34:59,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:34:59,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:34:59,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:34:59,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:34:59,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:34:59,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:34:59,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:34:59,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:34:59,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:34:59,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:34:59,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:34:59,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:34:59,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:34:59,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:34:59,905 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:34:59,915 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:34:59,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:34:59,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:34:59,916 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:34:59,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:34:59,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:34:59,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:34:59,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:34:59,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:34:59,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:34:59,918 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:34:59,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:34:59,918 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:34:59,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:34:59,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:34:59,919 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:34:59,919 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:34:59,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:34:59,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:34:59,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:34:59,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:34:59,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:34:59,920 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,196 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:35:00,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:35:00,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:35:00,212 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:35:00,212 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:35:00,213 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condaf.c [2020-07-08 23:35:00,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e1ba380/1b5ba2c4121f40468915126e7e014328/FLAG55e2e587f [2020-07-08 23:35:00,745 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:35:00,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condaf.c [2020-07-08 23:35:00,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e1ba380/1b5ba2c4121f40468915126e7e014328/FLAG55e2e587f [2020-07-08 23:35:01,264 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e1ba380/1b5ba2c4121f40468915126e7e014328 [2020-07-08 23:35:01,275 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:35:01,277 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:35:01,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:35:01,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:35:01,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:35:01,287 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,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5b7a8e 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,290 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,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:35:01,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:35:01,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:35:01,526 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:35:01,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:35:01,653 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:35:01,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:01 WrapperNode [2020-07-08 23:35:01,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:35:01,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:35:01,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:35:01,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:35:01,669 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:01" (1/1) ... [2020-07-08 23:35:01,669 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:01" (1/1) ... [2020-07-08 23:35:01,688 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:01" (1/1) ... [2020-07-08 23:35:01,689 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:01" (1/1) ... [2020-07-08 23:35:01,714 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:01" (1/1) ... [2020-07-08 23:35:01,725 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:01" (1/1) ... [2020-07-08 23:35:01,727 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:01" (1/1) ... [2020-07-08 23:35:01,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:35:01,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:35:01,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:35:01,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:35:01,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:01" (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:01,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:35:01,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:35:01,800 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:35:01,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:35:01,800 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:35:01,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:35:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:35:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:35:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:35:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:35:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 23:35:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:35:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 23:35:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 23:35:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 23:35:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 23:35:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 23:35:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:35:01,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:35:02,216 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:35:02,216 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-08 23:35:02,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:35:02 BoogieIcfgContainer [2020-07-08 23:35:02,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:35:02,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:35:02,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:35:02,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:35:02,226 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:02,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774e4171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:35:02, skipping insertion in model container [2020-07-08 23:35:02,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:01" (2/3) ... [2020-07-08 23:35:02,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774e4171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:35:02, skipping insertion in model container [2020-07-08 23:35:02,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:35:02" (3/3) ... [2020-07-08 23:35:02,229 INFO L109 eAbstractionObserver]: Analyzing ICFG condaf.c [2020-07-08 23:35:02,239 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:35:02,252 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:35:02,270 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:35:02,291 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:35:02,292 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:35:02,292 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:35:02,292 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:35:02,292 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:35:02,292 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:35:02,293 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:35:02,293 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:35:02,309 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2020-07-08 23:35:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 23:35:02,321 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:02,322 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] [2020-07-08 23:35:02,322 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:02,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:02,329 INFO L82 PathProgramCache]: Analyzing trace with hash -2050446892, now seen corresponding path program 1 times [2020-07-08 23:35:02,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:02,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1961523500] [2020-07-08 23:35:02,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:02,573 INFO L280 TraceCheckUtils]: 0: Hoare triple {86#(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; {74#true} is VALID [2020-07-08 23:35:02,574 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#true} #valid := #valid[0 := 0]; {74#true} is VALID [2020-07-08 23:35:02,576 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} assume 0 < #StackHeapBarrier; {74#true} is VALID [2020-07-08 23:35:02,577 INFO L280 TraceCheckUtils]: 3: Hoare triple {74#true} ~N~0 := 0; {74#true} is VALID [2020-07-08 23:35:02,577 INFO L280 TraceCheckUtils]: 4: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-08 23:35:02,578 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {74#true} {74#true} #122#return; {74#true} is VALID [2020-07-08 23:35:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:02,590 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#true} ~cond := #in~cond; {74#true} is VALID [2020-07-08 23:35:02,591 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#true} assume !(0 == ~cond); {74#true} is VALID [2020-07-08 23:35:02,591 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-08 23:35:02,592 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {74#true} {74#true} #118#return; {74#true} is VALID [2020-07-08 23:35:02,594 INFO L263 TraceCheckUtils]: 0: Hoare triple {74#true} call ULTIMATE.init(); {86#(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:02,594 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#(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; {74#true} is VALID [2020-07-08 23:35:02,595 INFO L280 TraceCheckUtils]: 2: Hoare triple {74#true} #valid := #valid[0 := 0]; {74#true} is VALID [2020-07-08 23:35:02,595 INFO L280 TraceCheckUtils]: 3: Hoare triple {74#true} assume 0 < #StackHeapBarrier; {74#true} is VALID [2020-07-08 23:35:02,596 INFO L280 TraceCheckUtils]: 4: Hoare triple {74#true} ~N~0 := 0; {74#true} is VALID [2020-07-08 23:35:02,596 INFO L280 TraceCheckUtils]: 5: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-08 23:35:02,596 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {74#true} {74#true} #122#return; {74#true} is VALID [2020-07-08 23:35:02,597 INFO L263 TraceCheckUtils]: 7: Hoare triple {74#true} call #t~ret11 := main(); {74#true} is VALID [2020-07-08 23:35:02,597 INFO L280 TraceCheckUtils]: 8: Hoare triple {74#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {74#true} is VALID [2020-07-08 23:35:02,598 INFO L280 TraceCheckUtils]: 9: Hoare triple {74#true} ~N~0 := #t~nondet0; {74#true} is VALID [2020-07-08 23:35:02,598 INFO L280 TraceCheckUtils]: 10: Hoare triple {74#true} havoc #t~nondet0; {74#true} is VALID [2020-07-08 23:35:02,598 INFO L280 TraceCheckUtils]: 11: Hoare triple {74#true} assume !(~N~0 <= 0); {74#true} is VALID [2020-07-08 23:35:02,599 INFO L263 TraceCheckUtils]: 12: Hoare triple {74#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {74#true} is VALID [2020-07-08 23:35:02,599 INFO L280 TraceCheckUtils]: 13: Hoare triple {74#true} ~cond := #in~cond; {74#true} is VALID [2020-07-08 23:35:02,599 INFO L280 TraceCheckUtils]: 14: Hoare triple {74#true} assume !(0 == ~cond); {74#true} is VALID [2020-07-08 23:35:02,600 INFO L280 TraceCheckUtils]: 15: Hoare triple {74#true} assume true; {74#true} is VALID [2020-07-08 23:35:02,600 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {74#true} {74#true} #118#return; {74#true} is VALID [2020-07-08 23:35:02,601 INFO L280 TraceCheckUtils]: 17: Hoare triple {74#true} havoc ~i~0; {74#true} is VALID [2020-07-08 23:35:02,601 INFO L280 TraceCheckUtils]: 18: Hoare triple {74#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4); srcloc: L26 {74#true} is VALID [2020-07-08 23:35:02,601 INFO L280 TraceCheckUtils]: 19: Hoare triple {74#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {74#true} is VALID [2020-07-08 23:35:02,602 INFO L280 TraceCheckUtils]: 20: Hoare triple {74#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {74#true} is VALID [2020-07-08 23:35:02,602 INFO L280 TraceCheckUtils]: 21: Hoare triple {74#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4); srcloc: L29 {74#true} is VALID [2020-07-08 23:35:02,603 INFO L280 TraceCheckUtils]: 22: Hoare triple {74#true} ~i~0 := 0; {74#true} is VALID [2020-07-08 23:35:02,604 INFO L280 TraceCheckUtils]: 23: Hoare triple {74#true} assume !true; {75#false} is VALID [2020-07-08 23:35:02,604 INFO L280 TraceCheckUtils]: 24: Hoare triple {75#false} ~i~0 := 0; {75#false} is VALID [2020-07-08 23:35:02,605 INFO L280 TraceCheckUtils]: 25: Hoare triple {75#false} assume !true; {75#false} is VALID [2020-07-08 23:35:02,605 INFO L280 TraceCheckUtils]: 26: Hoare triple {75#false} ~i~0 := 0; {75#false} is VALID [2020-07-08 23:35:02,606 INFO L280 TraceCheckUtils]: 27: Hoare triple {75#false} assume !true; {75#false} is VALID [2020-07-08 23:35:02,606 INFO L280 TraceCheckUtils]: 28: Hoare triple {75#false} SUMMARY for call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 4); srcloc: L44-6 {75#false} is VALID [2020-07-08 23:35:02,606 INFO L263 TraceCheckUtils]: 29: Hoare triple {75#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {75#false} is VALID [2020-07-08 23:35:02,607 INFO L280 TraceCheckUtils]: 30: Hoare triple {75#false} ~cond := #in~cond; {75#false} is VALID [2020-07-08 23:35:02,607 INFO L280 TraceCheckUtils]: 31: Hoare triple {75#false} assume 0 == ~cond; {75#false} is VALID [2020-07-08 23:35:02,608 INFO L280 TraceCheckUtils]: 32: Hoare triple {75#false} assume !false; {75#false} is VALID [2020-07-08 23:35:02,613 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:02,614 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1961523500] [2020-07-08 23:35:02,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:35:02,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 23:35:02,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389516941] [2020-07-08 23:35:02,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-08 23:35:02,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:02,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 23:35:02,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:02,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 23:35:02,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:02,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 23:35:02,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:35:02,712 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2020-07-08 23:35:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:03,145 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2020-07-08 23:35:03,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 23:35:03,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-08 23:35:03,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:03,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:35:03,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2020-07-08 23:35:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:35:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2020-07-08 23:35:03,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 142 transitions. [2020-07-08 23:35:03,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:03,353 INFO L225 Difference]: With dead ends: 125 [2020-07-08 23:35:03,353 INFO L226 Difference]: Without dead ends: 59 [2020-07-08 23:35:03,357 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:03,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-08 23:35:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-08 23:35:03,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:35:03,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2020-07-08 23:35:03,457 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-08 23:35:03,457 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-08 23:35:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:03,467 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-07-08 23:35:03,467 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-08 23:35:03,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:03,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:03,469 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-08 23:35:03,470 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-08 23:35:03,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:03,481 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-07-08 23:35:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-08 23:35:03,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:03,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:03,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:35:03,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:35:03,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-08 23:35:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2020-07-08 23:35:03,504 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 33 [2020-07-08 23:35:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:35:03,511 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2020-07-08 23:35:03,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 23:35:03,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states and 62 transitions. [2020-07-08 23:35:03,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-08 23:35:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 23:35:03,597 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:03,598 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] [2020-07-08 23:35:03,598 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:35:03,600 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:03,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:03,601 INFO L82 PathProgramCache]: Analyzing trace with hash -341126016, now seen corresponding path program 1 times [2020-07-08 23:35:03,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:03,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [666875014] [2020-07-08 23:35:03,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:03,750 INFO L280 TraceCheckUtils]: 0: Hoare triple {589#(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; {575#true} is VALID [2020-07-08 23:35:03,750 INFO L280 TraceCheckUtils]: 1: Hoare triple {575#true} #valid := #valid[0 := 0]; {575#true} is VALID [2020-07-08 23:35:03,751 INFO L280 TraceCheckUtils]: 2: Hoare triple {575#true} assume 0 < #StackHeapBarrier; {575#true} is VALID [2020-07-08 23:35:03,751 INFO L280 TraceCheckUtils]: 3: Hoare triple {575#true} ~N~0 := 0; {575#true} is VALID [2020-07-08 23:35:03,751 INFO L280 TraceCheckUtils]: 4: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-08 23:35:03,752 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {575#true} {575#true} #122#return; {575#true} is VALID [2020-07-08 23:35:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:03,760 INFO L280 TraceCheckUtils]: 0: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID [2020-07-08 23:35:03,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID [2020-07-08 23:35:03,760 INFO L280 TraceCheckUtils]: 2: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-08 23:35:03,761 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {575#true} {583#(<= 1 ~N~0)} #118#return; {583#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,763 INFO L263 TraceCheckUtils]: 0: Hoare triple {575#true} call ULTIMATE.init(); {589#(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,763 INFO L280 TraceCheckUtils]: 1: Hoare triple {589#(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; {575#true} is VALID [2020-07-08 23:35:03,763 INFO L280 TraceCheckUtils]: 2: Hoare triple {575#true} #valid := #valid[0 := 0]; {575#true} is VALID [2020-07-08 23:35:03,763 INFO L280 TraceCheckUtils]: 3: Hoare triple {575#true} assume 0 < #StackHeapBarrier; {575#true} is VALID [2020-07-08 23:35:03,764 INFO L280 TraceCheckUtils]: 4: Hoare triple {575#true} ~N~0 := 0; {575#true} is VALID [2020-07-08 23:35:03,764 INFO L280 TraceCheckUtils]: 5: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-08 23:35:03,764 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {575#true} {575#true} #122#return; {575#true} is VALID [2020-07-08 23:35:03,765 INFO L263 TraceCheckUtils]: 7: Hoare triple {575#true} call #t~ret11 := main(); {575#true} is VALID [2020-07-08 23:35:03,765 INFO L280 TraceCheckUtils]: 8: Hoare triple {575#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {575#true} is VALID [2020-07-08 23:35:03,765 INFO L280 TraceCheckUtils]: 9: Hoare triple {575#true} ~N~0 := #t~nondet0; {575#true} is VALID [2020-07-08 23:35:03,765 INFO L280 TraceCheckUtils]: 10: Hoare triple {575#true} havoc #t~nondet0; {575#true} is VALID [2020-07-08 23:35:03,766 INFO L280 TraceCheckUtils]: 11: Hoare triple {575#true} assume !(~N~0 <= 0); {583#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,767 INFO L263 TraceCheckUtils]: 12: Hoare triple {583#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {575#true} is VALID [2020-07-08 23:35:03,767 INFO L280 TraceCheckUtils]: 13: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID [2020-07-08 23:35:03,767 INFO L280 TraceCheckUtils]: 14: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID [2020-07-08 23:35:03,767 INFO L280 TraceCheckUtils]: 15: Hoare triple {575#true} assume true; {575#true} is VALID [2020-07-08 23:35:03,768 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {575#true} {583#(<= 1 ~N~0)} #118#return; {583#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,769 INFO L280 TraceCheckUtils]: 17: Hoare triple {583#(<= 1 ~N~0)} havoc ~i~0; {583#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,770 INFO L280 TraceCheckUtils]: 18: Hoare triple {583#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4); srcloc: L26 {583#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,770 INFO L280 TraceCheckUtils]: 19: Hoare triple {583#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {583#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,771 INFO L280 TraceCheckUtils]: 20: Hoare triple {583#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {583#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,772 INFO L280 TraceCheckUtils]: 21: Hoare triple {583#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4); srcloc: L29 {583#(<= 1 ~N~0)} is VALID [2020-07-08 23:35:03,773 INFO L280 TraceCheckUtils]: 22: Hoare triple {583#(<= 1 ~N~0)} ~i~0 := 0; {588#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 23:35:03,774 INFO L280 TraceCheckUtils]: 23: Hoare triple {588#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {576#false} is VALID [2020-07-08 23:35:03,774 INFO L280 TraceCheckUtils]: 24: Hoare triple {576#false} ~i~0 := 0; {576#false} is VALID [2020-07-08 23:35:03,774 INFO L280 TraceCheckUtils]: 25: Hoare triple {576#false} assume !(~i~0 < ~N~0); {576#false} is VALID [2020-07-08 23:35:03,774 INFO L280 TraceCheckUtils]: 26: Hoare triple {576#false} ~i~0 := 0; {576#false} is VALID [2020-07-08 23:35:03,775 INFO L280 TraceCheckUtils]: 27: Hoare triple {576#false} assume !(~i~0 < ~N~0); {576#false} is VALID [2020-07-08 23:35:03,775 INFO L280 TraceCheckUtils]: 28: Hoare triple {576#false} SUMMARY for call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 4); srcloc: L44-6 {576#false} is VALID [2020-07-08 23:35:03,775 INFO L263 TraceCheckUtils]: 29: Hoare triple {576#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {576#false} is VALID [2020-07-08 23:35:03,776 INFO L280 TraceCheckUtils]: 30: Hoare triple {576#false} ~cond := #in~cond; {576#false} is VALID [2020-07-08 23:35:03,776 INFO L280 TraceCheckUtils]: 31: Hoare triple {576#false} assume 0 == ~cond; {576#false} is VALID [2020-07-08 23:35:03,776 INFO L280 TraceCheckUtils]: 32: Hoare triple {576#false} assume !false; {576#false} is VALID [2020-07-08 23:35:03,778 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,778 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [666875014] [2020-07-08 23:35:03,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:35:03,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 23:35:03,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818079543] [2020-07-08 23:35:03,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-08 23:35:03,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:03,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:35:03,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:03,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:35:03,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:03,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:35:03,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:35:03,820 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 5 states. [2020-07-08 23:35:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:04,329 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2020-07-08 23:35:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:35:04,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-08 23:35:04,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:35:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2020-07-08 23:35:04,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:35:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2020-07-08 23:35:04,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2020-07-08 23:35:04,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:04,478 INFO L225 Difference]: With dead ends: 115 [2020-07-08 23:35:04,479 INFO L226 Difference]: Without dead ends: 84 [2020-07-08 23:35:04,480 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:04,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-07-08 23:35:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2020-07-08 23:35:04,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:35:04,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 62 states. [2020-07-08 23:35:04,569 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 62 states. [2020-07-08 23:35:04,569 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 62 states. [2020-07-08 23:35:04,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:04,575 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2020-07-08 23:35:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2020-07-08 23:35:04,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:04,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:04,576 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 84 states. [2020-07-08 23:35:04,576 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 84 states. [2020-07-08 23:35:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:04,580 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2020-07-08 23:35:04,581 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2020-07-08 23:35:04,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:04,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:04,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:35:04,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:35:04,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-08 23:35:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2020-07-08 23:35:04,585 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 33 [2020-07-08 23:35:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:35:04,585 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2020-07-08 23:35:04,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:35:04,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2020-07-08 23:35:04,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-08 23:35:04,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-08 23:35:04,668 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:04,668 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] [2020-07-08 23:35:04,668 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:35:04,668 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:04,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:04,669 INFO L82 PathProgramCache]: Analyzing trace with hash 746418975, now seen corresponding path program 1 times [2020-07-08 23:35:04,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:04,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1503009315] [2020-07-08 23:35:04,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:05,364 INFO L280 TraceCheckUtils]: 0: Hoare triple {1138#(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; {1117#true} is VALID [2020-07-08 23:35:05,364 INFO L280 TraceCheckUtils]: 1: Hoare triple {1117#true} #valid := #valid[0 := 0]; {1117#true} is VALID [2020-07-08 23:35:05,365 INFO L280 TraceCheckUtils]: 2: Hoare triple {1117#true} assume 0 < #StackHeapBarrier; {1117#true} is VALID [2020-07-08 23:35:05,365 INFO L280 TraceCheckUtils]: 3: Hoare triple {1117#true} ~N~0 := 0; {1117#true} is VALID [2020-07-08 23:35:05,365 INFO L280 TraceCheckUtils]: 4: Hoare triple {1117#true} assume true; {1117#true} is VALID [2020-07-08 23:35:05,366 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1117#true} {1117#true} #122#return; {1117#true} is VALID [2020-07-08 23:35:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:05,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {1117#true} ~cond := #in~cond; {1117#true} is VALID [2020-07-08 23:35:05,372 INFO L280 TraceCheckUtils]: 1: Hoare triple {1117#true} assume !(0 == ~cond); {1117#true} is VALID [2020-07-08 23:35:05,372 INFO L280 TraceCheckUtils]: 2: Hoare triple {1117#true} assume true; {1117#true} is VALID [2020-07-08 23:35:05,373 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1117#true} {1117#true} #118#return; {1117#true} is VALID [2020-07-08 23:35:05,376 INFO L263 TraceCheckUtils]: 0: Hoare triple {1117#true} call ULTIMATE.init(); {1138#(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:05,376 INFO L280 TraceCheckUtils]: 1: Hoare triple {1138#(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; {1117#true} is VALID [2020-07-08 23:35:05,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {1117#true} #valid := #valid[0 := 0]; {1117#true} is VALID [2020-07-08 23:35:05,376 INFO L280 TraceCheckUtils]: 3: Hoare triple {1117#true} assume 0 < #StackHeapBarrier; {1117#true} is VALID [2020-07-08 23:35:05,377 INFO L280 TraceCheckUtils]: 4: Hoare triple {1117#true} ~N~0 := 0; {1117#true} is VALID [2020-07-08 23:35:05,377 INFO L280 TraceCheckUtils]: 5: Hoare triple {1117#true} assume true; {1117#true} is VALID [2020-07-08 23:35:05,377 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1117#true} {1117#true} #122#return; {1117#true} is VALID [2020-07-08 23:35:05,378 INFO L263 TraceCheckUtils]: 7: Hoare triple {1117#true} call #t~ret11 := main(); {1117#true} is VALID [2020-07-08 23:35:05,378 INFO L280 TraceCheckUtils]: 8: Hoare triple {1117#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1117#true} is VALID [2020-07-08 23:35:05,378 INFO L280 TraceCheckUtils]: 9: Hoare triple {1117#true} ~N~0 := #t~nondet0; {1117#true} is VALID [2020-07-08 23:35:05,381 INFO L280 TraceCheckUtils]: 10: Hoare triple {1117#true} havoc #t~nondet0; {1117#true} is VALID [2020-07-08 23:35:05,381 INFO L280 TraceCheckUtils]: 11: Hoare triple {1117#true} assume !(~N~0 <= 0); {1117#true} is VALID [2020-07-08 23:35:05,382 INFO L263 TraceCheckUtils]: 12: Hoare triple {1117#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1117#true} is VALID [2020-07-08 23:35:05,382 INFO L280 TraceCheckUtils]: 13: Hoare triple {1117#true} ~cond := #in~cond; {1117#true} is VALID [2020-07-08 23:35:05,382 INFO L280 TraceCheckUtils]: 14: Hoare triple {1117#true} assume !(0 == ~cond); {1117#true} is VALID [2020-07-08 23:35:05,382 INFO L280 TraceCheckUtils]: 15: Hoare triple {1117#true} assume true; {1117#true} is VALID [2020-07-08 23:35:05,383 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1117#true} {1117#true} #118#return; {1117#true} is VALID [2020-07-08 23:35:05,383 INFO L280 TraceCheckUtils]: 17: Hoare triple {1117#true} havoc ~i~0; {1117#true} is VALID [2020-07-08 23:35:05,383 INFO L280 TraceCheckUtils]: 18: Hoare triple {1117#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4); srcloc: L26 {1117#true} is VALID [2020-07-08 23:35:05,384 INFO L280 TraceCheckUtils]: 19: Hoare triple {1117#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {1129#(= 0 |main_#t~malloc1.offset|)} is VALID [2020-07-08 23:35:05,384 INFO L280 TraceCheckUtils]: 20: Hoare triple {1129#(= 0 |main_#t~malloc1.offset|)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1130#(= 0 main_~a~0.offset)} is VALID [2020-07-08 23:35:05,385 INFO L280 TraceCheckUtils]: 21: Hoare triple {1130#(= 0 main_~a~0.offset)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4); srcloc: L29 {1130#(= 0 main_~a~0.offset)} is VALID [2020-07-08 23:35:05,385 INFO L280 TraceCheckUtils]: 22: Hoare triple {1130#(= 0 main_~a~0.offset)} ~i~0 := 0; {1131#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} is VALID [2020-07-08 23:35:05,386 INFO L280 TraceCheckUtils]: 23: Hoare triple {1131#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0); {1131#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} is VALID [2020-07-08 23:35:05,387 INFO L280 TraceCheckUtils]: 24: Hoare triple {1131#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} SUMMARY for call write~int(1, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {1132#(and (= 0 main_~a~0.offset) (= 0 main_~i~0) (or (<= 536870912 ~N~0) (not (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))))))} is VALID [2020-07-08 23:35:05,398 INFO L280 TraceCheckUtils]: 25: Hoare triple {1132#(and (= 0 main_~a~0.offset) (= 0 main_~i~0) (or (<= 536870912 ~N~0) (not (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))))))} #t~post2 := ~i~0; {1133#(and (or (and (not (= 0 (select (select |#memory_int| main_~a~0.base) 0))) (<= ~N~0 536870911)) (and (<= 536870912 ~N~0) (= |main_#t~post2| 0))) (= 0 main_~a~0.offset))} is VALID [2020-07-08 23:35:05,399 INFO L280 TraceCheckUtils]: 26: Hoare triple {1133#(and (or (and (not (= 0 (select (select |#memory_int| main_~a~0.base) 0))) (<= ~N~0 536870911)) (and (<= 536870912 ~N~0) (= |main_#t~post2| 0))) (= 0 main_~a~0.offset))} ~i~0 := 1 + #t~post2; {1134#(and (or (<= (+ main_~i~0 536870911) ~N~0) (and (not (= 0 (select (select |#memory_int| main_~a~0.base) 0))) (<= ~N~0 536870911))) (= 0 main_~a~0.offset))} is VALID [2020-07-08 23:35:05,400 INFO L280 TraceCheckUtils]: 27: Hoare triple {1134#(and (or (<= (+ main_~i~0 536870911) ~N~0) (and (not (= 0 (select (select |#memory_int| main_~a~0.base) 0))) (<= ~N~0 536870911))) (= 0 main_~a~0.offset))} havoc #t~post2; {1134#(and (or (<= (+ main_~i~0 536870911) ~N~0) (and (not (= 0 (select (select |#memory_int| main_~a~0.base) 0))) (<= ~N~0 536870911))) (= 0 main_~a~0.offset))} is VALID [2020-07-08 23:35:05,401 INFO L280 TraceCheckUtils]: 28: Hoare triple {1134#(and (or (<= (+ main_~i~0 536870911) ~N~0) (and (not (= 0 (select (select |#memory_int| main_~a~0.base) 0))) (<= ~N~0 536870911))) (= 0 main_~a~0.offset))} assume !(~i~0 < ~N~0); {1135#(and (not (= 0 (select (select |#memory_int| main_~a~0.base) 0))) (= 0 main_~a~0.offset) (<= ~N~0 536870911))} is VALID [2020-07-08 23:35:05,405 INFO L280 TraceCheckUtils]: 29: Hoare triple {1135#(and (not (= 0 (select (select |#memory_int| main_~a~0.base) 0))) (= 0 main_~a~0.offset) (<= ~N~0 536870911))} ~i~0 := 0; {1136#(and (= 0 main_~a~0.offset) (= 0 main_~i~0) (not (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))) (<= ~N~0 536870911))} is VALID [2020-07-08 23:35:05,406 INFO L280 TraceCheckUtils]: 30: Hoare triple {1136#(and (= 0 main_~a~0.offset) (= 0 main_~i~0) (not (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))) (<= ~N~0 536870911))} assume !!(~i~0 < ~N~0); {1136#(and (= 0 main_~a~0.offset) (= 0 main_~i~0) (not (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))) (<= ~N~0 536870911))} is VALID [2020-07-08 23:35:05,407 INFO L280 TraceCheckUtils]: 31: Hoare triple {1136#(and (= 0 main_~a~0.offset) (= 0 main_~i~0) (not (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))) (<= ~N~0 536870911))} SUMMARY for call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L37 {1137#(and (not (= 0 |main_#t~mem4|)) (= 0 main_~a~0.offset) (= 0 main_~i~0) (<= ~N~0 536870911))} is VALID [2020-07-08 23:35:05,408 INFO L280 TraceCheckUtils]: 32: Hoare triple {1137#(and (not (= 0 |main_#t~mem4|)) (= 0 main_~a~0.offset) (= 0 main_~i~0) (<= ~N~0 536870911))} assume 0 == #t~mem4; {1118#false} is VALID [2020-07-08 23:35:05,409 INFO L280 TraceCheckUtils]: 33: Hoare triple {1118#false} havoc #t~mem4; {1118#false} is VALID [2020-07-08 23:35:05,409 INFO L280 TraceCheckUtils]: 34: Hoare triple {1118#false} SUMMARY for call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L38 {1118#false} is VALID [2020-07-08 23:35:05,409 INFO L280 TraceCheckUtils]: 35: Hoare triple {1118#false} SUMMARY for call write~int(1 + #t~mem5, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L38-1 {1118#false} is VALID [2020-07-08 23:35:05,409 INFO L280 TraceCheckUtils]: 36: Hoare triple {1118#false} havoc #t~mem5; {1118#false} is VALID [2020-07-08 23:35:05,410 INFO L280 TraceCheckUtils]: 37: Hoare triple {1118#false} #t~post3 := ~i~0; {1118#false} is VALID [2020-07-08 23:35:05,410 INFO L280 TraceCheckUtils]: 38: Hoare triple {1118#false} ~i~0 := 1 + #t~post3; {1118#false} is VALID [2020-07-08 23:35:05,410 INFO L280 TraceCheckUtils]: 39: Hoare triple {1118#false} havoc #t~post3; {1118#false} is VALID [2020-07-08 23:35:05,410 INFO L280 TraceCheckUtils]: 40: Hoare triple {1118#false} assume !(~i~0 < ~N~0); {1118#false} is VALID [2020-07-08 23:35:05,410 INFO L280 TraceCheckUtils]: 41: Hoare triple {1118#false} ~i~0 := 0; {1118#false} is VALID [2020-07-08 23:35:05,411 INFO L280 TraceCheckUtils]: 42: Hoare triple {1118#false} assume !!(~i~0 < ~N~0); {1118#false} is VALID [2020-07-08 23:35:05,411 INFO L280 TraceCheckUtils]: 43: Hoare triple {1118#false} SUMMARY for call #t~mem8 := read~int(~#sum~0.base, ~#sum~0.offset, 4); srcloc: L46 {1118#false} is VALID [2020-07-08 23:35:05,411 INFO L280 TraceCheckUtils]: 44: Hoare triple {1118#false} SUMMARY for call #t~mem9 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L46-1 {1118#false} is VALID [2020-07-08 23:35:05,411 INFO L280 TraceCheckUtils]: 45: Hoare triple {1118#false} SUMMARY for call write~int(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 4); srcloc: L46-2 {1118#false} is VALID [2020-07-08 23:35:05,411 INFO L280 TraceCheckUtils]: 46: Hoare triple {1118#false} havoc #t~mem8; {1118#false} is VALID [2020-07-08 23:35:05,412 INFO L280 TraceCheckUtils]: 47: Hoare triple {1118#false} havoc #t~mem9; {1118#false} is VALID [2020-07-08 23:35:05,412 INFO L280 TraceCheckUtils]: 48: Hoare triple {1118#false} #t~post7 := ~i~0; {1118#false} is VALID [2020-07-08 23:35:05,412 INFO L280 TraceCheckUtils]: 49: Hoare triple {1118#false} ~i~0 := 1 + #t~post7; {1118#false} is VALID [2020-07-08 23:35:05,412 INFO L280 TraceCheckUtils]: 50: Hoare triple {1118#false} havoc #t~post7; {1118#false} is VALID [2020-07-08 23:35:05,412 INFO L280 TraceCheckUtils]: 51: Hoare triple {1118#false} assume !(~i~0 < ~N~0); {1118#false} is VALID [2020-07-08 23:35:05,413 INFO L280 TraceCheckUtils]: 52: Hoare triple {1118#false} SUMMARY for call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 4); srcloc: L44-6 {1118#false} is VALID [2020-07-08 23:35:05,413 INFO L263 TraceCheckUtils]: 53: Hoare triple {1118#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {1118#false} is VALID [2020-07-08 23:35:05,413 INFO L280 TraceCheckUtils]: 54: Hoare triple {1118#false} ~cond := #in~cond; {1118#false} is VALID [2020-07-08 23:35:05,413 INFO L280 TraceCheckUtils]: 55: Hoare triple {1118#false} assume 0 == ~cond; {1118#false} is VALID [2020-07-08 23:35:05,413 INFO L280 TraceCheckUtils]: 56: Hoare triple {1118#false} assume !false; {1118#false} is VALID [2020-07-08 23:35:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-08 23:35:05,421 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1503009315] [2020-07-08 23:35:05,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:35:05,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-07-08 23:35:05,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263704726] [2020-07-08 23:35:05,422 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2020-07-08 23:35:05,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:05,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 23:35:05,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:05,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 23:35:05,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:05,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 23:35:05,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-07-08 23:35:05,500 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 12 states. [2020-07-08 23:35:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:06,807 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2020-07-08 23:35:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 23:35:06,807 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2020-07-08 23:35:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 23:35:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 134 transitions. [2020-07-08 23:35:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 23:35:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 134 transitions. [2020-07-08 23:35:06,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 134 transitions. [2020-07-08 23:35:06,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:06,965 INFO L225 Difference]: With dead ends: 127 [2020-07-08 23:35:06,965 INFO L226 Difference]: Without dead ends: 96 [2020-07-08 23:35:06,966 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2020-07-08 23:35:06,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-07-08 23:35:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 71. [2020-07-08 23:35:07,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:35:07,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 71 states. [2020-07-08 23:35:07,121 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 71 states. [2020-07-08 23:35:07,121 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 71 states. [2020-07-08 23:35:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:07,128 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2020-07-08 23:35:07,129 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2020-07-08 23:35:07,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:07,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:07,139 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 96 states. [2020-07-08 23:35:07,139 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 96 states. [2020-07-08 23:35:07,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:07,143 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2020-07-08 23:35:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2020-07-08 23:35:07,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:35:07,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:35:07,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:35:07,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:35:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-08 23:35:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2020-07-08 23:35:07,147 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 57 [2020-07-08 23:35:07,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:35:07,147 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2020-07-08 23:35:07,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 23:35:07,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 71 states and 75 transitions. [2020-07-08 23:35:07,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:35:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2020-07-08 23:35:07,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-08 23:35:07,265 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:07,265 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] [2020-07-08 23:35:07,266 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:35:07,266 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:07,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:07,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1569346213, now seen corresponding path program 1 times [2020-07-08 23:35:07,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:07,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1491562122] [2020-07-08 23:35:07,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:35:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:35:07,425 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 23:35:07,425 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 23:35:07,426 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:35:07,506 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 23:35:07,506 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:35:07,506 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:35:07,506 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:35:07,506 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 23:35:07,506 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 23:35:07,507 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:35:07,507 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:35:07,507 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:35:07,507 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:35:07,507 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:35:07,507 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 23:35:07,507 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:35:07,507 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:35:07,507 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-08 23:35:07,507 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 23:35:07,508 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-08 23:35:07,508 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-08 23:35:07,508 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-08 23:35:07,508 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:35:07,508 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:35:07,508 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 23:35:07,508 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 23:35:07,508 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 23:35:07,508 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:35:07,509 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:35:07,509 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 23:35:07,509 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 23:35:07,509 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 23:35:07,509 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-08 23:35:07,509 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:35:07,509 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:35:07,509 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-08 23:35:07,509 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 23:35:07,509 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 23:35:07,509 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 23:35:07,509 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-08 23:35:07,509 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-08 23:35:07,509 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 23:35:07,509 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-08 23:35:07,510 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 23:35:07,510 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-08 23:35:07,510 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-08 23:35:07,510 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-08 23:35:07,510 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:35:07,510 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:35:07,510 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:35:07,510 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-08 23:35:07,510 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-08 23:35:07,510 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:35:07,510 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:35:07,510 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:35:07,510 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-08 23:35:07,510 WARN L170 areAnnotationChecker]: L35-6 has no Hoare annotation [2020-07-08 23:35:07,511 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 23:35:07,511 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-08 23:35:07,511 WARN L170 areAnnotationChecker]: L44-5 has no Hoare annotation [2020-07-08 23:35:07,511 WARN L170 areAnnotationChecker]: L44-5 has no Hoare annotation [2020-07-08 23:35:07,511 WARN L170 areAnnotationChecker]: L44-5 has no Hoare annotation [2020-07-08 23:35:07,511 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-08 23:35:07,511 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-08 23:35:07,511 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 23:35:07,511 WARN L170 areAnnotationChecker]: L44-6 has no Hoare annotation [2020-07-08 23:35:07,511 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-08 23:35:07,511 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-08 23:35:07,511 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-08 23:35:07,511 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-08 23:35:07,511 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-08 23:35:07,511 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-08 23:35:07,512 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 23:35:07,512 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-08 23:35:07,512 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-08 23:35:07,512 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-08 23:35:07,512 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-08 23:35:07,512 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-08 23:35:07,512 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-08 23:35:07,512 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-08 23:35:07,512 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-08 23:35:07,512 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-08 23:35:07,512 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-08 23:35:07,512 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 23:35:07,512 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-08 23:35:07,512 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-08 23:35:07,513 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-08 23:35:07,513 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:07,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:35:07 BoogieIcfgContainer [2020-07-08 23:35:07,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:35:07,518 INFO L168 Benchmark]: Toolchain (without parser) took 6241.85 ms. Allocated memory was 141.6 MB in the beginning and 307.2 MB in the end (delta: 165.7 MB). Free memory was 99.5 MB in the beginning and 245.9 MB in the end (delta: -146.4 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:07,519 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 141.6 MB. Free memory was 118.2 MB in the beginning and 118.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:35:07,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.58 ms. Allocated memory was 141.6 MB in the beginning and 198.2 MB in the end (delta: 56.6 MB). Free memory was 99.3 MB in the beginning and 177.0 MB in the end (delta: -77.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:07,521 INFO L168 Benchmark]: Boogie Preprocessor took 76.30 ms. Allocated memory is still 198.2 MB. Free memory was 177.0 MB in the beginning and 174.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:07,521 INFO L168 Benchmark]: RCFGBuilder took 488.84 ms. Allocated memory is still 198.2 MB. Free memory was 174.5 MB in the beginning and 143.6 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:07,522 INFO L168 Benchmark]: TraceAbstraction took 5294.02 ms. Allocated memory was 198.2 MB in the beginning and 307.2 MB in the end (delta: 109.1 MB). Free memory was 142.9 MB in the beginning and 245.9 MB in the end (delta: -103.0 MB). Peak memory consumption was 6.1 MB. Max. memory is 7.1 GB. [2020-07-08 23:35:07,526 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.24 ms. Allocated memory is still 141.6 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 372.58 ms. Allocated memory was 141.6 MB in the beginning and 198.2 MB in the end (delta: 56.6 MB). Free memory was 99.3 MB in the beginning and 177.0 MB in the end (delta: -77.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.30 ms. Allocated memory is still 198.2 MB. Free memory was 177.0 MB in the beginning and 174.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 488.84 ms. Allocated memory is still 198.2 MB. Free memory was 174.5 MB in the beginning and 143.6 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5294.02 ms. Allocated memory was 198.2 MB in the beginning and 307.2 MB in the end (delta: 109.1 MB). Free memory was 142.9 MB in the beginning and 245.9 MB in the end (delta: -103.0 MB). Peak memory consumption was 6.1 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)=6, 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] int sum[1]; VAL [\old(N)=0, N=1, sum={3:0}] [L27] int *a = malloc(sizeof(int)*N); VAL [\old(N)=0, a={-2:0}, malloc(sizeof(int)*N)={-2:0}, N=1, sum={3:0}] [L29] sum[0] = 0 VAL [\old(N)=0, a={-2:0}, malloc(sizeof(int)*N)={-2:0}, N=1, sum={3:0}] [L30] i=0 VAL [\old(N)=0, a={-2:0}, i=0, malloc(sizeof(int)*N)={-2:0}, N=1, sum={3:0}] [L30] COND TRUE i