/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/condaf.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:48:53,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:48:53,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:48:53,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:48:53,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:48:53,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:48:53,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:48:53,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:48:53,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:48:53,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:48:53,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:48:53,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:48:53,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:48:53,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:48:53,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:48:53,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:48:53,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:48:53,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:48:53,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:48:53,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:48:53,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:48:53,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:48:53,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:48:53,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:48:53,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:48:53,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:48:53,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:48:53,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:48:53,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:48:53,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:48:53,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:48:53,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:48:53,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:48:53,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:48:53,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:48:53,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:48:53,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:48:53,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:48:53,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:48:53,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:48:53,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:48:53,480 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:48:53,502 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:48:53,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:48:53,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:48:53,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:48:53,505 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:48:53,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:48:53,505 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:48:53,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:48:53,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:48:53,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:48:53,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:48:53,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:48:53,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:48:53,507 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:48:53,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:48:53,508 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:48:53,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:48:53,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:48:53,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:48:53,509 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:48:53,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:48:53,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:48:53,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:48:53,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:48:53,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:48:53,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:48:53,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:48:53,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:48:53,510 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:48:53,511 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:48:53,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:48:53,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:48:53,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:48:53,814 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:48:53,815 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:48:53,815 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-17 22:48:53,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5367f1592/330b7b993cd1439fb8fa010f3dd9bf44/FLAGabdc266fd [2020-07-17 22:48:54,339 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:48:54,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condaf.c [2020-07-17 22:48:54,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5367f1592/330b7b993cd1439fb8fa010f3dd9bf44/FLAGabdc266fd [2020-07-17 22:48:54,703 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5367f1592/330b7b993cd1439fb8fa010f3dd9bf44 [2020-07-17 22:48:54,711 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:48:54,714 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:48:54,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:48:54,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:48:54,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:48:54,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:48:54" (1/1) ... [2020-07-17 22:48:54,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d1b6256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:54, skipping insertion in model container [2020-07-17 22:48:54,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:48:54" (1/1) ... [2020-07-17 22:48:54,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:48:54,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:48:54,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:48:54,935 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:48:54,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:48:55,002 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:48:55,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:55 WrapperNode [2020-07-17 22:48:55,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:48:55,004 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:48:55,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:48:55,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:48:55,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:55" (1/1) ... [2020-07-17 22:48:55,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:55" (1/1) ... [2020-07-17 22:48:55,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:55" (1/1) ... [2020-07-17 22:48:55,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:55" (1/1) ... [2020-07-17 22:48:55,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:55" (1/1) ... [2020-07-17 22:48:55,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:55" (1/1) ... [2020-07-17 22:48:55,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:55" (1/1) ... [2020-07-17 22:48:55,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:48:55,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:48:55,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:48:55,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:48:55,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:55" (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-17 22:48:55,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:48:55,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:48:55,187 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:48:55,187 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:48:55,187 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:48:55,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:48:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:48:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:48:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:48:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:48:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:48:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:48:55,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 22:48:55,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:48:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:48:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:48:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:48:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:48:55,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:48:55,571 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:48:55,572 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:48:55,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:48:55 BoogieIcfgContainer [2020-07-17 22:48:55,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:48:55,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:48:55,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:48:55,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:48:55,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:48:54" (1/3) ... [2020-07-17 22:48:55,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62988f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:48:55, skipping insertion in model container [2020-07-17 22:48:55,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:48:55" (2/3) ... [2020-07-17 22:48:55,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62988f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:48:55, skipping insertion in model container [2020-07-17 22:48:55,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:48:55" (3/3) ... [2020-07-17 22:48:55,588 INFO L109 eAbstractionObserver]: Analyzing ICFG condaf.c [2020-07-17 22:48:55,615 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:48:55,625 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:48:55,638 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:48:55,661 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:48:55,661 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:48:55,661 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:48:55,661 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:48:55,662 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:48:55,662 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:48:55,662 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:48:55,662 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:48:55,681 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-07-17 22:48:55,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:48:55,687 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:55,688 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] [2020-07-17 22:48:55,688 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:55,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:55,695 INFO L82 PathProgramCache]: Analyzing trace with hash -88121349, now seen corresponding path program 1 times [2020-07-17 22:48:55,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:55,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760309718] [2020-07-17 22:48:55,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:55,940 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {38#true} is VALID [2020-07-17 22:48:55,940 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-17 22:48:55,941 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-17 22:48:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:55,951 INFO L280 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-17 22:48:55,952 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-17 22:48:55,953 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-17 22:48:55,953 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-17 22:48:55,955 INFO L263 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {47#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:55,956 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {38#true} is VALID [2020-07-17 22:48:55,956 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2020-07-17 22:48:55,956 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #86#return; {38#true} is VALID [2020-07-17 22:48:55,957 INFO L263 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret11 := main(); {38#true} is VALID [2020-07-17 22:48:55,957 INFO L280 TraceCheckUtils]: 5: Hoare triple {38#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {38#true} is VALID [2020-07-17 22:48:55,958 INFO L280 TraceCheckUtils]: 6: Hoare triple {38#true} assume !(~N~0 <= 0); {38#true} is VALID [2020-07-17 22:48:55,958 INFO L263 TraceCheckUtils]: 7: Hoare triple {38#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {38#true} is VALID [2020-07-17 22:48:55,959 INFO L280 TraceCheckUtils]: 8: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2020-07-17 22:48:55,960 INFO L280 TraceCheckUtils]: 9: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2020-07-17 22:48:55,961 INFO L280 TraceCheckUtils]: 10: Hoare triple {39#false} assume true; {39#false} is VALID [2020-07-17 22:48:55,962 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {39#false} {38#true} #82#return; {39#false} is VALID [2020-07-17 22:48:55,962 INFO L280 TraceCheckUtils]: 12: Hoare triple {39#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4);~i~0 := 0; {39#false} is VALID [2020-07-17 22:48:55,963 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-17 22:48:55,963 INFO L280 TraceCheckUtils]: 14: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-17 22:48:55,963 INFO L280 TraceCheckUtils]: 15: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-17 22:48:55,964 INFO L280 TraceCheckUtils]: 16: Hoare triple {39#false} ~i~0 := 0; {39#false} is VALID [2020-07-17 22:48:55,964 INFO L280 TraceCheckUtils]: 17: Hoare triple {39#false} assume !(~i~0 < ~N~0); {39#false} is VALID [2020-07-17 22:48:55,965 INFO L280 TraceCheckUtils]: 18: Hoare triple {39#false} call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 4); {39#false} is VALID [2020-07-17 22:48:55,965 INFO L263 TraceCheckUtils]: 19: Hoare triple {39#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {39#false} is VALID [2020-07-17 22:48:55,965 INFO L280 TraceCheckUtils]: 20: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2020-07-17 22:48:55,966 INFO L280 TraceCheckUtils]: 21: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2020-07-17 22:48:55,966 INFO L280 TraceCheckUtils]: 22: Hoare triple {39#false} assume !false; {39#false} is VALID [2020-07-17 22:48:55,969 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-17 22:48:55,970 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760309718] [2020-07-17 22:48:55,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:55,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:48:55,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406964230] [2020-07-17 22:48:55,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:48:55,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:55,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:48:56,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:56,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:48:56,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:56,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:48:56,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:48:56,047 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2020-07-17 22:48:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:56,243 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2020-07-17 22:48:56,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:48:56,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-17 22:48:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:56,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-17 22:48:56,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:48:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-17 22:48:56,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2020-07-17 22:48:56,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:56,423 INFO L225 Difference]: With dead ends: 60 [2020-07-17 22:48:56,423 INFO L226 Difference]: Without dead ends: 28 [2020-07-17 22:48:56,426 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-17 22:48:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-17 22:48:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-17 22:48:56,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:56,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-17 22:48:56,478 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-17 22:48:56,478 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-17 22:48:56,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:56,483 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-17 22:48:56,483 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-17 22:48:56,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:56,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:56,484 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-17 22:48:56,484 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-17 22:48:56,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:56,488 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-17 22:48:56,489 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-17 22:48:56,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:56,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:56,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:56,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 22:48:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2020-07-17 22:48:56,494 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2020-07-17 22:48:56,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:56,495 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2020-07-17 22:48:56,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:48:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2020-07-17 22:48:56,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:48:56,496 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:56,496 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] [2020-07-17 22:48:56,497 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:48:56,497 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:56,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:56,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1099238599, now seen corresponding path program 1 times [2020-07-17 22:48:56,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:56,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631246392] [2020-07-17 22:48:56,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:56,613 INFO L280 TraceCheckUtils]: 0: Hoare triple {232#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {221#true} is VALID [2020-07-17 22:48:56,614 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:48:56,614 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {221#true} {221#true} #86#return; {221#true} is VALID [2020-07-17 22:48:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:56,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-17 22:48:56,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-17 22:48:56,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:48:56,625 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {226#(<= 1 ~N~0)} #82#return; {226#(<= 1 ~N~0)} is VALID [2020-07-17 22:48:56,626 INFO L263 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {232#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:56,627 INFO L280 TraceCheckUtils]: 1: Hoare triple {232#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {221#true} is VALID [2020-07-17 22:48:56,627 INFO L280 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:48:56,627 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #86#return; {221#true} is VALID [2020-07-17 22:48:56,628 INFO L263 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret11 := main(); {221#true} is VALID [2020-07-17 22:48:56,628 INFO L280 TraceCheckUtils]: 5: Hoare triple {221#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {221#true} is VALID [2020-07-17 22:48:56,629 INFO L280 TraceCheckUtils]: 6: Hoare triple {221#true} assume !(~N~0 <= 0); {226#(<= 1 ~N~0)} is VALID [2020-07-17 22:48:56,629 INFO L263 TraceCheckUtils]: 7: Hoare triple {226#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {221#true} is VALID [2020-07-17 22:48:56,629 INFO L280 TraceCheckUtils]: 8: Hoare triple {221#true} ~cond := #in~cond; {221#true} is VALID [2020-07-17 22:48:56,630 INFO L280 TraceCheckUtils]: 9: Hoare triple {221#true} assume !(0 == ~cond); {221#true} is VALID [2020-07-17 22:48:56,630 INFO L280 TraceCheckUtils]: 10: Hoare triple {221#true} assume true; {221#true} is VALID [2020-07-17 22:48:56,631 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {221#true} {226#(<= 1 ~N~0)} #82#return; {226#(<= 1 ~N~0)} is VALID [2020-07-17 22:48:56,632 INFO L280 TraceCheckUtils]: 12: Hoare triple {226#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4);~i~0 := 0; {231#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-17 22:48:56,633 INFO L280 TraceCheckUtils]: 13: Hoare triple {231#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-17 22:48:56,634 INFO L280 TraceCheckUtils]: 14: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-17 22:48:56,634 INFO L280 TraceCheckUtils]: 15: Hoare triple {222#false} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-17 22:48:56,634 INFO L280 TraceCheckUtils]: 16: Hoare triple {222#false} ~i~0 := 0; {222#false} is VALID [2020-07-17 22:48:56,635 INFO L280 TraceCheckUtils]: 17: Hoare triple {222#false} assume !(~i~0 < ~N~0); {222#false} is VALID [2020-07-17 22:48:56,635 INFO L280 TraceCheckUtils]: 18: Hoare triple {222#false} call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 4); {222#false} is VALID [2020-07-17 22:48:56,635 INFO L263 TraceCheckUtils]: 19: Hoare triple {222#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {222#false} is VALID [2020-07-17 22:48:56,635 INFO L280 TraceCheckUtils]: 20: Hoare triple {222#false} ~cond := #in~cond; {222#false} is VALID [2020-07-17 22:48:56,636 INFO L280 TraceCheckUtils]: 21: Hoare triple {222#false} assume 0 == ~cond; {222#false} is VALID [2020-07-17 22:48:56,636 INFO L280 TraceCheckUtils]: 22: Hoare triple {222#false} assume !false; {222#false} is VALID [2020-07-17 22:48:56,637 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-17 22:48:56,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631246392] [2020-07-17 22:48:56,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:48:56,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:48:56,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027893168] [2020-07-17 22:48:56,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-17 22:48:56,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:56,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:48:56,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:56,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:48:56,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:56,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:48:56,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:48:56,670 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2020-07-17 22:48:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:56,907 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2020-07-17 22:48:56,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:48:56,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-17 22:48:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:48:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-17 22:48:56,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:48:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2020-07-17 22:48:56,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2020-07-17 22:48:57,000 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-17 22:48:57,002 INFO L225 Difference]: With dead ends: 48 [2020-07-17 22:48:57,002 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:48:57,004 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-17 22:48:57,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:48:57,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2020-07-17 22:48:57,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:57,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2020-07-17 22:48:57,036 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2020-07-17 22:48:57,036 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2020-07-17 22:48:57,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:57,039 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-17 22:48:57,039 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-17 22:48:57,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:57,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:57,040 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2020-07-17 22:48:57,041 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2020-07-17 22:48:57,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:57,044 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-17 22:48:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-17 22:48:57,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:57,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:57,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:57,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-17 22:48:57,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-07-17 22:48:57,047 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2020-07-17 22:48:57,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:57,048 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-07-17 22:48:57,048 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:48:57,048 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-07-17 22:48:57,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:48:57,049 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:57,049 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] [2020-07-17 22:48:57,049 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:48:57,050 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:57,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:57,050 INFO L82 PathProgramCache]: Analyzing trace with hash 188437731, now seen corresponding path program 1 times [2020-07-17 22:48:57,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:57,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554971641] [2020-07-17 22:48:57,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:57,492 INFO L280 TraceCheckUtils]: 0: Hoare triple {434#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {419#true} is VALID [2020-07-17 22:48:57,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {419#true} assume true; {419#true} is VALID [2020-07-17 22:48:57,493 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {419#true} {419#true} #86#return; {419#true} is VALID [2020-07-17 22:48:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:57,498 INFO L280 TraceCheckUtils]: 0: Hoare triple {419#true} ~cond := #in~cond; {419#true} is VALID [2020-07-17 22:48:57,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {419#true} assume !(0 == ~cond); {419#true} is VALID [2020-07-17 22:48:57,499 INFO L280 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2020-07-17 22:48:57,499 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #82#return; {419#true} is VALID [2020-07-17 22:48:57,500 INFO L263 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {434#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:48:57,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {434#(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;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {419#true} is VALID [2020-07-17 22:48:57,501 INFO L280 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2020-07-17 22:48:57,501 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #86#return; {419#true} is VALID [2020-07-17 22:48:57,502 INFO L263 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret11 := main(); {419#true} is VALID [2020-07-17 22:48:57,502 INFO L280 TraceCheckUtils]: 5: Hoare triple {419#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {419#true} is VALID [2020-07-17 22:48:57,502 INFO L280 TraceCheckUtils]: 6: Hoare triple {419#true} assume !(~N~0 <= 0); {419#true} is VALID [2020-07-17 22:48:57,502 INFO L263 TraceCheckUtils]: 7: Hoare triple {419#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {419#true} is VALID [2020-07-17 22:48:57,503 INFO L280 TraceCheckUtils]: 8: Hoare triple {419#true} ~cond := #in~cond; {419#true} is VALID [2020-07-17 22:48:57,503 INFO L280 TraceCheckUtils]: 9: Hoare triple {419#true} assume !(0 == ~cond); {419#true} is VALID [2020-07-17 22:48:57,503 INFO L280 TraceCheckUtils]: 10: Hoare triple {419#true} assume true; {419#true} is VALID [2020-07-17 22:48:57,504 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {419#true} {419#true} #82#return; {419#true} is VALID [2020-07-17 22:48:57,505 INFO L280 TraceCheckUtils]: 12: Hoare triple {419#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4);~i~0 := 0; {428#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} is VALID [2020-07-17 22:48:57,506 INFO L280 TraceCheckUtils]: 13: Hoare triple {428#(and (= 0 main_~a~0.offset) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call write~int(1, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {429#(and (or (< 536870911 ~N~0) (not (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))))) (= 0 main_~a~0.offset) (= 0 main_~i~0))} is VALID [2020-07-17 22:48:57,508 INFO L280 TraceCheckUtils]: 14: Hoare triple {429#(and (or (< 536870911 ~N~0) (not (= 0 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))))) (= 0 main_~a~0.offset) (= 0 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {430#(and (or (< 536870911 ~N~0) (not (= 0 (select (select |#memory_int| main_~a~0.base) 0)))) (= 0 main_~a~0.offset) (or (<= (+ main_~i~0 536870911) ~N~0) (<= ~N~0 536870911)))} is VALID [2020-07-17 22:48:57,509 INFO L280 TraceCheckUtils]: 15: Hoare triple {430#(and (or (< 536870911 ~N~0) (not (= 0 (select (select |#memory_int| main_~a~0.base) 0)))) (= 0 main_~a~0.offset) (or (<= (+ main_~i~0 536870911) ~N~0) (<= ~N~0 536870911)))} assume !(~i~0 < ~N~0); {431#(and (not (= 0 (select (select |#memory_int| main_~a~0.base) 0))) (= 0 main_~a~0.offset))} is VALID [2020-07-17 22:48:57,510 INFO L280 TraceCheckUtils]: 16: Hoare triple {431#(and (not (= 0 (select (select |#memory_int| main_~a~0.base) 0))) (= 0 main_~a~0.offset))} ~i~0 := 0; {432#(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)))))} is VALID [2020-07-17 22:48:57,511 INFO L280 TraceCheckUtils]: 17: Hoare triple {432#(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)))))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {433#(not (= 0 |main_#t~mem4|))} is VALID [2020-07-17 22:48:57,511 INFO L280 TraceCheckUtils]: 18: Hoare triple {433#(not (= 0 |main_#t~mem4|))} assume 0 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(1 + #t~mem5, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {420#false} is VALID [2020-07-17 22:48:57,512 INFO L280 TraceCheckUtils]: 19: Hoare triple {420#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {420#false} is VALID [2020-07-17 22:48:57,512 INFO L280 TraceCheckUtils]: 20: Hoare triple {420#false} assume !(~i~0 < ~N~0); {420#false} is VALID [2020-07-17 22:48:57,512 INFO L280 TraceCheckUtils]: 21: Hoare triple {420#false} ~i~0 := 0; {420#false} is VALID [2020-07-17 22:48:57,513 INFO L280 TraceCheckUtils]: 22: Hoare triple {420#false} assume !!(~i~0 < ~N~0);call #t~mem8 := read~int(~#sum~0.base, ~#sum~0.offset, 4);call #t~mem9 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 4);havoc #t~mem8;havoc #t~mem9; {420#false} is VALID [2020-07-17 22:48:57,513 INFO L280 TraceCheckUtils]: 23: Hoare triple {420#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {420#false} is VALID [2020-07-17 22:48:57,513 INFO L280 TraceCheckUtils]: 24: Hoare triple {420#false} assume !(~i~0 < ~N~0); {420#false} is VALID [2020-07-17 22:48:57,513 INFO L280 TraceCheckUtils]: 25: Hoare triple {420#false} call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 4); {420#false} is VALID [2020-07-17 22:48:57,514 INFO L263 TraceCheckUtils]: 26: Hoare triple {420#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {420#false} is VALID [2020-07-17 22:48:57,514 INFO L280 TraceCheckUtils]: 27: Hoare triple {420#false} ~cond := #in~cond; {420#false} is VALID [2020-07-17 22:48:57,514 INFO L280 TraceCheckUtils]: 28: Hoare triple {420#false} assume 0 == ~cond; {420#false} is VALID [2020-07-17 22:48:57,515 INFO L280 TraceCheckUtils]: 29: Hoare triple {420#false} assume !false; {420#false} is VALID [2020-07-17 22:48:57,517 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-17 22:48:57,517 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554971641] [2020-07-17 22:48:57,518 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772337630] [2020-07-17 22:48:57,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:48:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:57,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:48:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:48:57,586 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:48:57,670 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-17 22:48:57,670 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:48:57,675 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:48:57,675 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:48:57,676 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-07-17 22:48:57,737 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-17 22:48:57,740 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:48:57,742 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:48:57,742 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:48:57,743 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-17 22:48:57,745 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:48:57,745 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~a~0.base, main_~a~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) (and (= 1 .cse0) (<= .cse0 |main_#t~mem4|))) [2020-07-17 22:48:57,745 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= 1 |main_#t~mem4|) [2020-07-17 22:48:57,791 INFO L263 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2020-07-17 22:48:57,792 INFO L280 TraceCheckUtils]: 1: Hoare triple {419#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {419#true} is VALID [2020-07-17 22:48:57,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2020-07-17 22:48:57,793 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #86#return; {419#true} is VALID [2020-07-17 22:48:57,793 INFO L263 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret11 := main(); {419#true} is VALID [2020-07-17 22:48:57,793 INFO L280 TraceCheckUtils]: 5: Hoare triple {419#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {419#true} is VALID [2020-07-17 22:48:57,794 INFO L280 TraceCheckUtils]: 6: Hoare triple {419#true} assume !(~N~0 <= 0); {419#true} is VALID [2020-07-17 22:48:57,794 INFO L263 TraceCheckUtils]: 7: Hoare triple {419#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {419#true} is VALID [2020-07-17 22:48:57,795 INFO L280 TraceCheckUtils]: 8: Hoare triple {419#true} ~cond := #in~cond; {419#true} is VALID [2020-07-17 22:48:57,795 INFO L280 TraceCheckUtils]: 9: Hoare triple {419#true} assume !(0 == ~cond); {419#true} is VALID [2020-07-17 22:48:57,796 INFO L280 TraceCheckUtils]: 10: Hoare triple {419#true} assume true; {419#true} is VALID [2020-07-17 22:48:57,796 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {419#true} {419#true} #82#return; {419#true} is VALID [2020-07-17 22:48:57,800 INFO L280 TraceCheckUtils]: 12: Hoare triple {419#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(4);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(0, ~#sum~0.base, ~#sum~0.offset, 4);~i~0 := 0; {474#(= 0 main_~i~0)} is VALID [2020-07-17 22:48:57,801 INFO L280 TraceCheckUtils]: 13: Hoare triple {474#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(1, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {478#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-17 22:48:57,802 INFO L280 TraceCheckUtils]: 14: Hoare triple {478#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {478#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-17 22:48:57,803 INFO L280 TraceCheckUtils]: 15: Hoare triple {478#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} assume !(~i~0 < ~N~0); {478#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-17 22:48:57,804 INFO L280 TraceCheckUtils]: 16: Hoare triple {478#(= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} ~i~0 := 0; {488#(and (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~i~0))} is VALID [2020-07-17 22:48:57,804 INFO L280 TraceCheckUtils]: 17: Hoare triple {488#(and (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {492#(<= 1 |main_#t~mem4|)} is VALID [2020-07-17 22:48:57,805 INFO L280 TraceCheckUtils]: 18: Hoare triple {492#(<= 1 |main_#t~mem4|)} assume 0 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(1 + #t~mem5, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4);havoc #t~mem5; {420#false} is VALID [2020-07-17 22:48:57,805 INFO L280 TraceCheckUtils]: 19: Hoare triple {420#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {420#false} is VALID [2020-07-17 22:48:57,806 INFO L280 TraceCheckUtils]: 20: Hoare triple {420#false} assume !(~i~0 < ~N~0); {420#false} is VALID [2020-07-17 22:48:57,806 INFO L280 TraceCheckUtils]: 21: Hoare triple {420#false} ~i~0 := 0; {420#false} is VALID [2020-07-17 22:48:57,806 INFO L280 TraceCheckUtils]: 22: Hoare triple {420#false} assume !!(~i~0 < ~N~0);call #t~mem8 := read~int(~#sum~0.base, ~#sum~0.offset, 4);call #t~mem9 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem8 + #t~mem9, ~#sum~0.base, ~#sum~0.offset, 4);havoc #t~mem8;havoc #t~mem9; {420#false} is VALID [2020-07-17 22:48:57,807 INFO L280 TraceCheckUtils]: 23: Hoare triple {420#false} #t~post7 := ~i~0;~i~0 := 1 + #t~post7;havoc #t~post7; {420#false} is VALID [2020-07-17 22:48:57,807 INFO L280 TraceCheckUtils]: 24: Hoare triple {420#false} assume !(~i~0 < ~N~0); {420#false} is VALID [2020-07-17 22:48:57,808 INFO L280 TraceCheckUtils]: 25: Hoare triple {420#false} call #t~mem10 := read~int(~#sum~0.base, ~#sum~0.offset, 4); {420#false} is VALID [2020-07-17 22:48:57,808 INFO L263 TraceCheckUtils]: 26: Hoare triple {420#false} call __VERIFIER_assert((if #t~mem10 == 2 * ~N~0 then 1 else 0)); {420#false} is VALID [2020-07-17 22:48:57,808 INFO L280 TraceCheckUtils]: 27: Hoare triple {420#false} ~cond := #in~cond; {420#false} is VALID [2020-07-17 22:48:57,808 INFO L280 TraceCheckUtils]: 28: Hoare triple {420#false} assume 0 == ~cond; {420#false} is VALID [2020-07-17 22:48:57,809 INFO L280 TraceCheckUtils]: 29: Hoare triple {420#false} assume !false; {420#false} is VALID [2020-07-17 22:48:57,810 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-17 22:48:57,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:48:57,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2020-07-17 22:48:57,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966239676] [2020-07-17 22:48:57,812 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-07-17 22:48:57,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:48:57,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-17 22:48:57,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:48:57,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 22:48:57,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:48:57,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 22:48:57,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:48:57,888 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 13 states. [2020-07-17 22:48:58,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,580 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2020-07-17 22:48:58,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:48:58,581 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-07-17 22:48:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:48:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:48:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2020-07-17 22:48:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:48:58,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2020-07-17 22:48:58,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2020-07-17 22:48:58,669 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-17 22:48:58,671 INFO L225 Difference]: With dead ends: 51 [2020-07-17 22:48:58,671 INFO L226 Difference]: Without dead ends: 38 [2020-07-17 22:48:58,672 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:48:58,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-17 22:48:58,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2020-07-17 22:48:58,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:48:58,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 32 states. [2020-07-17 22:48:58,707 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 32 states. [2020-07-17 22:48:58,707 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 32 states. [2020-07-17 22:48:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,711 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-17 22:48:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-17 22:48:58,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:58,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:58,712 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 38 states. [2020-07-17 22:48:58,712 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 38 states. [2020-07-17 22:48:58,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:48:58,714 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-17 22:48:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-17 22:48:58,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:48:58,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:48:58,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:48:58,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:48:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:48:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-17 22:48:58,717 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 30 [2020-07-17 22:48:58,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:48:58,718 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-17 22:48:58,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 22:48:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-17 22:48:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-17 22:48:58,719 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:48:58,719 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] [2020-07-17 22:48:58,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:48:58,925 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:48:58,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:48:58,926 INFO L82 PathProgramCache]: Analyzing trace with hash 446603169, now seen corresponding path program 1 times [2020-07-17 22:48:58,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:48:58,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029860283] [2020-07-17 22:48:58,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:48:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:48:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:48:59,005 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:48:59,006 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:48:59,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:48:59,042 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:48:59,042 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:48:59,042 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:48:59,043 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:48:59,043 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:48:59,043 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:48:59,043 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:48:59,043 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:48:59,043 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:48:59,043 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:48:59,043 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:48:59,044 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:48:59,044 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:48:59,044 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:48:59,044 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:48:59,044 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:48:59,044 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:48:59,044 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:48:59,044 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:48:59,044 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:48:59,045 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:48:59,045 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:48:59,045 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:48:59,045 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:48:59,045 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:48:59,045 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:48:59,045 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:48:59,046 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:48:59,046 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:48:59,046 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:48:59,046 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-17 22:48:59,046 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-17 22:48:59,046 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-17 22:48:59,046 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-17 22:48:59,046 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:48:59,046 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:48:59,047 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-17 22:48:59,047 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-17 22:48:59,047 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:48:59,047 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-17 22:48:59,047 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-17 22:48:59,047 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-17 22:48:59,047 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-17 22:48:59,047 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-17 22:48:59,048 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-17 22:48:59,048 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-17 22:48:59,048 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-17 22:48:59,048 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-17 22:48:59,048 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-17 22:48:59,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:48:59 BoogieIcfgContainer [2020-07-17 22:48:59,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:48:59,053 INFO L168 Benchmark]: Toolchain (without parser) took 4340.64 ms. Allocated memory was 137.9 MB in the beginning and 249.6 MB in the end (delta: 111.7 MB). Free memory was 102.6 MB in the beginning and 152.8 MB in the end (delta: -50.2 MB). Peak memory consumption was 61.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:48:59,054 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:48:59,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.42 ms. Allocated memory is still 137.9 MB. Free memory was 102.2 MB in the beginning and 91.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:48:59,056 INFO L168 Benchmark]: Boogie Preprocessor took 124.92 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 91.1 MB in the beginning and 179.9 MB in the end (delta: -88.8 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:48:59,057 INFO L168 Benchmark]: RCFGBuilder took 446.67 ms. Allocated memory is still 202.4 MB. Free memory was 179.9 MB in the beginning and 153.5 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:48:59,058 INFO L168 Benchmark]: TraceAbstraction took 3474.26 ms. Allocated memory was 202.4 MB in the beginning and 249.6 MB in the end (delta: 47.2 MB). Free memory was 152.8 MB in the beginning and 154.9 MB in the end (delta: -2.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:48:59,063 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.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 288.42 ms. Allocated memory is still 137.9 MB. Free memory was 102.2 MB in the beginning and 91.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.92 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 91.1 MB in the beginning and 179.9 MB in the end (delta: -88.8 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 446.67 ms. Allocated memory is still 202.4 MB. Free memory was 179.9 MB in the beginning and 153.5 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3474.26 ms. Allocated memory was 202.4 MB in the beginning and 249.6 MB in the end (delta: 47.2 MB). Free memory was 152.8 MB in the beginning and 154.9 MB in the end (delta: -2.1 MB). Peak memory consumption was 45.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() [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; [L26] int sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 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