/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/s32iff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:35:56,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:35:56,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:35:56,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:35:56,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:35:56,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:35:56,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:35:56,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:35:56,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:35:56,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:35:56,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:35:56,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:35:56,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:35:56,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:35:56,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:35:56,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:35:56,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:35:56,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:35:56,445 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:35:56,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:35:56,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:35:56,455 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:35:56,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:35:56,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:35:56,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:35:56,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:35:56,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:35:56,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:35:56,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:35:56,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:35:56,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:35:56,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:35:56,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:35:56,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:35:56,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:35:56,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:35:56,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:35:56,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:35:56,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:35:56,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:35:56,478 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:35:56,479 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:35:56,508 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:35:56,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:35:56,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:35:56,510 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:35:56,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:35:56,510 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:35:56,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:35:56,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:35:56,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:35:56,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:35:56,511 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:35:56,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:35:56,512 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:35:56,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:35:56,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:35:56,513 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:35:56,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:35:56,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:35:56,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:35:56,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:35:56,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:35:56,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:35:56,514 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:56,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:35:56,825 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:35:56,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:35:56,830 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:35:56,830 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:35:56,831 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s32iff.c [2020-07-08 23:35:56,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e3968e1/755f9915e1e842c4bfa8b6b0cc4394e4/FLAGae4904171 [2020-07-08 23:35:57,327 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:35:57,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s32iff.c [2020-07-08 23:35:57,341 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e3968e1/755f9915e1e842c4bfa8b6b0cc4394e4/FLAGae4904171 [2020-07-08 23:35:57,664 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60e3968e1/755f9915e1e842c4bfa8b6b0cc4394e4 [2020-07-08 23:35:57,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:35:57,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:35:57,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:35:57,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:35:57,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:35:57,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:35:57" (1/1) ... [2020-07-08 23:35:57,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45ff5312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:57, skipping insertion in model container [2020-07-08 23:35:57,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:35:57" (1/1) ... [2020-07-08 23:35:57,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:35:57,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:35:57,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:35:57,994 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:35:58,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:35:58,163 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:35:58,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:58 WrapperNode [2020-07-08 23:35:58,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:35:58,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:35:58,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:35:58,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:35:58,180 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:58" (1/1) ... [2020-07-08 23:35:58,180 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:58" (1/1) ... [2020-07-08 23:35:58,188 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:58" (1/1) ... [2020-07-08 23:35:58,189 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:58" (1/1) ... [2020-07-08 23:35:58,203 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:58" (1/1) ... [2020-07-08 23:35:58,211 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:58" (1/1) ... [2020-07-08 23:35:58,212 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:58" (1/1) ... [2020-07-08 23:35:58,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:35:58,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:35:58,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:35:58,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:35:58,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:58" (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:58,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:35:58,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:35:58,286 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:35:58,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:35:58,286 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:35:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:35:58,286 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:35:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:35:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:35:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:35:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 23:35:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:35:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 23:35:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 23:35:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 23:35:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 23:35:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 23:35:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:35:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:35:58,816 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:35:58,816 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-08 23:35:58,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:35:58 BoogieIcfgContainer [2020-07-08 23:35:58,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:35:58,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:35:58,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:35:58,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:35:58,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:35:57" (1/3) ... [2020-07-08 23:35:58,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719f1a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:35:58, skipping insertion in model container [2020-07-08 23:35:58,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:35:58" (2/3) ... [2020-07-08 23:35:58,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@719f1a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:35:58, skipping insertion in model container [2020-07-08 23:35:58,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:35:58" (3/3) ... [2020-07-08 23:35:58,834 INFO L109 eAbstractionObserver]: Analyzing ICFG s32iff.c [2020-07-08 23:35:58,847 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:35:58,856 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:35:58,874 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:35:58,901 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:35:58,901 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:35:58,901 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:35:58,902 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:35:58,902 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:35:58,902 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:35:58,903 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:35:58,903 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:35:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2020-07-08 23:35:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 23:35:58,950 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:35:58,951 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:58,952 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:35:58,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:35:58,960 INFO L82 PathProgramCache]: Analyzing trace with hash 350973390, now seen corresponding path program 1 times [2020-07-08 23:35:58,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:35:58,972 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [138294228] [2020-07-08 23:35:58,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:35:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:59,218 INFO L280 TraceCheckUtils]: 0: Hoare triple {95#(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; {83#true} is VALID [2020-07-08 23:35:59,218 INFO L280 TraceCheckUtils]: 1: Hoare triple {83#true} #valid := #valid[0 := 0]; {83#true} is VALID [2020-07-08 23:35:59,219 INFO L280 TraceCheckUtils]: 2: Hoare triple {83#true} assume 0 < #StackHeapBarrier; {83#true} is VALID [2020-07-08 23:35:59,219 INFO L280 TraceCheckUtils]: 3: Hoare triple {83#true} ~N~0 := 0; {83#true} is VALID [2020-07-08 23:35:59,220 INFO L280 TraceCheckUtils]: 4: Hoare triple {83#true} assume true; {83#true} is VALID [2020-07-08 23:35:59,220 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {83#true} {83#true} #135#return; {83#true} is VALID [2020-07-08 23:35:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:35:59,233 INFO L280 TraceCheckUtils]: 0: Hoare triple {83#true} ~cond := #in~cond; {83#true} is VALID [2020-07-08 23:35:59,234 INFO L280 TraceCheckUtils]: 1: Hoare triple {83#true} assume !(0 == ~cond); {83#true} is VALID [2020-07-08 23:35:59,234 INFO L280 TraceCheckUtils]: 2: Hoare triple {83#true} assume true; {83#true} is VALID [2020-07-08 23:35:59,235 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {83#true} {83#true} #131#return; {83#true} is VALID [2020-07-08 23:35:59,237 INFO L263 TraceCheckUtils]: 0: Hoare triple {83#true} call ULTIMATE.init(); {95#(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:59,238 INFO L280 TraceCheckUtils]: 1: Hoare triple {95#(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; {83#true} is VALID [2020-07-08 23:35:59,238 INFO L280 TraceCheckUtils]: 2: Hoare triple {83#true} #valid := #valid[0 := 0]; {83#true} is VALID [2020-07-08 23:35:59,238 INFO L280 TraceCheckUtils]: 3: Hoare triple {83#true} assume 0 < #StackHeapBarrier; {83#true} is VALID [2020-07-08 23:35:59,239 INFO L280 TraceCheckUtils]: 4: Hoare triple {83#true} ~N~0 := 0; {83#true} is VALID [2020-07-08 23:35:59,239 INFO L280 TraceCheckUtils]: 5: Hoare triple {83#true} assume true; {83#true} is VALID [2020-07-08 23:35:59,240 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {83#true} {83#true} #135#return; {83#true} is VALID [2020-07-08 23:35:59,240 INFO L263 TraceCheckUtils]: 7: Hoare triple {83#true} call #t~ret14 := main(); {83#true} is VALID [2020-07-08 23:35:59,240 INFO L280 TraceCheckUtils]: 8: Hoare triple {83#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {83#true} is VALID [2020-07-08 23:35:59,241 INFO L280 TraceCheckUtils]: 9: Hoare triple {83#true} ~N~0 := #t~nondet0; {83#true} is VALID [2020-07-08 23:35:59,241 INFO L280 TraceCheckUtils]: 10: Hoare triple {83#true} havoc #t~nondet0; {83#true} is VALID [2020-07-08 23:35:59,242 INFO L280 TraceCheckUtils]: 11: Hoare triple {83#true} assume !(~N~0 <= 0); {83#true} is VALID [2020-07-08 23:35:59,242 INFO L263 TraceCheckUtils]: 12: Hoare triple {83#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {83#true} is VALID [2020-07-08 23:35:59,243 INFO L280 TraceCheckUtils]: 13: Hoare triple {83#true} ~cond := #in~cond; {83#true} is VALID [2020-07-08 23:35:59,243 INFO L280 TraceCheckUtils]: 14: Hoare triple {83#true} assume !(0 == ~cond); {83#true} is VALID [2020-07-08 23:35:59,243 INFO L280 TraceCheckUtils]: 15: Hoare triple {83#true} assume true; {83#true} is VALID [2020-07-08 23:35:59,244 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {83#true} {83#true} #131#return; {83#true} is VALID [2020-07-08 23:35:59,244 INFO L280 TraceCheckUtils]: 17: Hoare triple {83#true} havoc ~i~0; {83#true} is VALID [2020-07-08 23:35:59,245 INFO L280 TraceCheckUtils]: 18: Hoare triple {83#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {83#true} is VALID [2020-07-08 23:35:59,245 INFO L280 TraceCheckUtils]: 19: Hoare triple {83#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {83#true} is VALID [2020-07-08 23:35:59,245 INFO L280 TraceCheckUtils]: 20: Hoare triple {83#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {83#true} is VALID [2020-07-08 23:35:59,246 INFO L280 TraceCheckUtils]: 21: Hoare triple {83#true} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {83#true} is VALID [2020-07-08 23:35:59,246 INFO L280 TraceCheckUtils]: 22: Hoare triple {83#true} ~i~0 := 0; {83#true} is VALID [2020-07-08 23:35:59,248 INFO L280 TraceCheckUtils]: 23: Hoare triple {83#true} assume !true; {84#false} is VALID [2020-07-08 23:35:59,248 INFO L280 TraceCheckUtils]: 24: Hoare triple {84#false} ~i~0 := 0; {84#false} is VALID [2020-07-08 23:35:59,248 INFO L280 TraceCheckUtils]: 25: Hoare triple {84#false} assume !true; {84#false} is VALID [2020-07-08 23:35:59,249 INFO L280 TraceCheckUtils]: 26: Hoare triple {84#false} ~i~0 := 0; {84#false} is VALID [2020-07-08 23:35:59,249 INFO L280 TraceCheckUtils]: 27: Hoare triple {84#false} assume !true; {84#false} is VALID [2020-07-08 23:35:59,250 INFO L280 TraceCheckUtils]: 28: Hoare triple {84#false} SUMMARY for call #t~mem13 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L44-6 {84#false} is VALID [2020-07-08 23:35:59,250 INFO L263 TraceCheckUtils]: 29: Hoare triple {84#false} call __VERIFIER_assert((if #t~mem13 == 4 * ~N~0 then 1 else 0)); {84#false} is VALID [2020-07-08 23:35:59,250 INFO L280 TraceCheckUtils]: 30: Hoare triple {84#false} ~cond := #in~cond; {84#false} is VALID [2020-07-08 23:35:59,251 INFO L280 TraceCheckUtils]: 31: Hoare triple {84#false} assume 0 == ~cond; {84#false} is VALID [2020-07-08 23:35:59,251 INFO L280 TraceCheckUtils]: 32: Hoare triple {84#false} assume !false; {84#false} is VALID [2020-07-08 23:35:59,256 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:59,258 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [138294228] [2020-07-08 23:35:59,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:35:59,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 23:35:59,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715775805] [2020-07-08 23:35:59,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-08 23:35:59,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:35:59,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 23:35:59,342 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:59,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 23:35:59,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:35:59,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 23:35:59,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:35:59,354 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 3 states. [2020-07-08 23:35:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:35:59,888 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2020-07-08 23:35:59,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 23:35:59,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-07-08 23:35:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:35:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:35:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-08 23:35:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:35:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2020-07-08 23:35:59,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2020-07-08 23:36:00,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:00,145 INFO L225 Difference]: With dead ends: 143 [2020-07-08 23:36:00,145 INFO L226 Difference]: Without dead ends: 68 [2020-07-08 23:36:00,150 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:36:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-08 23:36:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-07-08 23:36:00,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:00,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2020-07-08 23:36:00,250 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2020-07-08 23:36:00,250 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2020-07-08 23:36:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:00,257 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-08 23:36:00,257 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-08 23:36:00,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:00,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:00,259 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2020-07-08 23:36:00,259 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2020-07-08 23:36:00,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:00,266 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2020-07-08 23:36:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-08 23:36:00,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:00,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:00,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:00,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:00,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-08 23:36:00,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2020-07-08 23:36:00,275 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 33 [2020-07-08 23:36:00,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:00,275 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2020-07-08 23:36:00,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 23:36:00,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2020-07-08 23:36:00,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:00,362 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-07-08 23:36:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-08 23:36:00,364 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:00,364 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:36:00,365 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:36:00,365 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:00,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:00,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1688115303, now seen corresponding path program 1 times [2020-07-08 23:36:00,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:00,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1370402407] [2020-07-08 23:36:00,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:00,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {670#(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; {656#true} is VALID [2020-07-08 23:36:00,502 INFO L280 TraceCheckUtils]: 1: Hoare triple {656#true} #valid := #valid[0 := 0]; {656#true} is VALID [2020-07-08 23:36:00,502 INFO L280 TraceCheckUtils]: 2: Hoare triple {656#true} assume 0 < #StackHeapBarrier; {656#true} is VALID [2020-07-08 23:36:00,502 INFO L280 TraceCheckUtils]: 3: Hoare triple {656#true} ~N~0 := 0; {656#true} is VALID [2020-07-08 23:36:00,502 INFO L280 TraceCheckUtils]: 4: Hoare triple {656#true} assume true; {656#true} is VALID [2020-07-08 23:36:00,503 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {656#true} {656#true} #135#return; {656#true} is VALID [2020-07-08 23:36:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:00,515 INFO L280 TraceCheckUtils]: 0: Hoare triple {656#true} ~cond := #in~cond; {656#true} is VALID [2020-07-08 23:36:00,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {656#true} assume !(0 == ~cond); {656#true} is VALID [2020-07-08 23:36:00,516 INFO L280 TraceCheckUtils]: 2: Hoare triple {656#true} assume true; {656#true} is VALID [2020-07-08 23:36:00,517 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {656#true} {664#(<= 1 ~N~0)} #131#return; {664#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:00,518 INFO L263 TraceCheckUtils]: 0: Hoare triple {656#true} call ULTIMATE.init(); {670#(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:36:00,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {670#(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; {656#true} is VALID [2020-07-08 23:36:00,519 INFO L280 TraceCheckUtils]: 2: Hoare triple {656#true} #valid := #valid[0 := 0]; {656#true} is VALID [2020-07-08 23:36:00,519 INFO L280 TraceCheckUtils]: 3: Hoare triple {656#true} assume 0 < #StackHeapBarrier; {656#true} is VALID [2020-07-08 23:36:00,520 INFO L280 TraceCheckUtils]: 4: Hoare triple {656#true} ~N~0 := 0; {656#true} is VALID [2020-07-08 23:36:00,520 INFO L280 TraceCheckUtils]: 5: Hoare triple {656#true} assume true; {656#true} is VALID [2020-07-08 23:36:00,520 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {656#true} {656#true} #135#return; {656#true} is VALID [2020-07-08 23:36:00,521 INFO L263 TraceCheckUtils]: 7: Hoare triple {656#true} call #t~ret14 := main(); {656#true} is VALID [2020-07-08 23:36:00,521 INFO L280 TraceCheckUtils]: 8: Hoare triple {656#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {656#true} is VALID [2020-07-08 23:36:00,521 INFO L280 TraceCheckUtils]: 9: Hoare triple {656#true} ~N~0 := #t~nondet0; {656#true} is VALID [2020-07-08 23:36:00,522 INFO L280 TraceCheckUtils]: 10: Hoare triple {656#true} havoc #t~nondet0; {656#true} is VALID [2020-07-08 23:36:00,523 INFO L280 TraceCheckUtils]: 11: Hoare triple {656#true} assume !(~N~0 <= 0); {664#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:00,523 INFO L263 TraceCheckUtils]: 12: Hoare triple {664#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {656#true} is VALID [2020-07-08 23:36:00,524 INFO L280 TraceCheckUtils]: 13: Hoare triple {656#true} ~cond := #in~cond; {656#true} is VALID [2020-07-08 23:36:00,524 INFO L280 TraceCheckUtils]: 14: Hoare triple {656#true} assume !(0 == ~cond); {656#true} is VALID [2020-07-08 23:36:00,524 INFO L280 TraceCheckUtils]: 15: Hoare triple {656#true} assume true; {656#true} is VALID [2020-07-08 23:36:00,525 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {656#true} {664#(<= 1 ~N~0)} #131#return; {664#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:00,526 INFO L280 TraceCheckUtils]: 17: Hoare triple {664#(<= 1 ~N~0)} havoc ~i~0; {664#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:00,527 INFO L280 TraceCheckUtils]: 18: Hoare triple {664#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {664#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:00,528 INFO L280 TraceCheckUtils]: 19: Hoare triple {664#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {664#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:00,528 INFO L280 TraceCheckUtils]: 20: Hoare triple {664#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {664#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:00,529 INFO L280 TraceCheckUtils]: 21: Hoare triple {664#(<= 1 ~N~0)} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {664#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:00,530 INFO L280 TraceCheckUtils]: 22: Hoare triple {664#(<= 1 ~N~0)} ~i~0 := 0; {669#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 23:36:00,532 INFO L280 TraceCheckUtils]: 23: Hoare triple {669#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {657#false} is VALID [2020-07-08 23:36:00,532 INFO L280 TraceCheckUtils]: 24: Hoare triple {657#false} ~i~0 := 0; {657#false} is VALID [2020-07-08 23:36:00,533 INFO L280 TraceCheckUtils]: 25: Hoare triple {657#false} assume !(~i~0 < ~N~0); {657#false} is VALID [2020-07-08 23:36:00,533 INFO L280 TraceCheckUtils]: 26: Hoare triple {657#false} ~i~0 := 0; {657#false} is VALID [2020-07-08 23:36:00,533 INFO L280 TraceCheckUtils]: 27: Hoare triple {657#false} assume !(~i~0 < ~N~0); {657#false} is VALID [2020-07-08 23:36:00,534 INFO L280 TraceCheckUtils]: 28: Hoare triple {657#false} SUMMARY for call #t~mem13 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L44-6 {657#false} is VALID [2020-07-08 23:36:00,534 INFO L263 TraceCheckUtils]: 29: Hoare triple {657#false} call __VERIFIER_assert((if #t~mem13 == 4 * ~N~0 then 1 else 0)); {657#false} is VALID [2020-07-08 23:36:00,534 INFO L280 TraceCheckUtils]: 30: Hoare triple {657#false} ~cond := #in~cond; {657#false} is VALID [2020-07-08 23:36:00,535 INFO L280 TraceCheckUtils]: 31: Hoare triple {657#false} assume 0 == ~cond; {657#false} is VALID [2020-07-08 23:36:00,535 INFO L280 TraceCheckUtils]: 32: Hoare triple {657#false} assume !false; {657#false} is VALID [2020-07-08 23:36:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:36:00,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1370402407] [2020-07-08 23:36:00,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:36:00,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 23:36:00,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217618554] [2020-07-08 23:36:00,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-08 23:36:00,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:00,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:36:00,587 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:36:00,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:36:00,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:00,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:36:00,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:36:00,588 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2020-07-08 23:36:01,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:01,267 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2020-07-08 23:36:01,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:36:01,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-07-08 23:36:01,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:36:01,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2020-07-08 23:36:01,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:36:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2020-07-08 23:36:01,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 154 transitions. [2020-07-08 23:36:01,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:01,473 INFO L225 Difference]: With dead ends: 142 [2020-07-08 23:36:01,473 INFO L226 Difference]: Without dead ends: 102 [2020-07-08 23:36:01,476 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:36:01,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-07-08 23:36:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 71. [2020-07-08 23:36:01,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:01,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand 71 states. [2020-07-08 23:36:01,620 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 71 states. [2020-07-08 23:36:01,620 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 71 states. [2020-07-08 23:36:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:01,625 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2020-07-08 23:36:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2020-07-08 23:36:01,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:01,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:01,627 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 102 states. [2020-07-08 23:36:01,627 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 102 states. [2020-07-08 23:36:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:01,632 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2020-07-08 23:36:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2020-07-08 23:36:01,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:01,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:01,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:01,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:01,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-08 23:36:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2020-07-08 23:36:01,638 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 33 [2020-07-08 23:36:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:01,638 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2020-07-08 23:36:01,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:36:01,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 71 states and 75 transitions. [2020-07-08 23:36:01,730 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:36:01,730 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2020-07-08 23:36:01,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-08 23:36:01,732 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:01,732 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 23:36:01,732 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:36:01,733 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:01,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:01,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1790069826, now seen corresponding path program 1 times [2020-07-08 23:36:01,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:01,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [440741321] [2020-07-08 23:36:01,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:36:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 23:36:01,899 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 23:36:01,900 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 23:36:01,900 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:36:01,974 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 23:36:01,975 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:36:01,975 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:36:01,975 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:36:01,975 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 23:36:01,975 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 23:36:01,975 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:36:01,975 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:36:01,976 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:36:01,976 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:36:01,976 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:36:01,976 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 23:36:01,976 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:36:01,976 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:36:01,976 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-08 23:36:01,976 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 23:36:01,977 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-08 23:36:01,977 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-08 23:36:01,977 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-08 23:36:01,977 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:36:01,977 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:36:01,977 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 23:36:01,977 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 23:36:01,977 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 23:36:01,977 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:36:01,978 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:36:01,978 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 23:36:01,978 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 23:36:01,978 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 23:36:01,978 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-08 23:36:01,978 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:36:01,978 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:36:01,978 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2020-07-08 23:36:01,979 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 23:36:01,979 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 23:36:01,979 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 23:36:01,979 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-08 23:36:01,979 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-08 23:36:01,979 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 23:36:01,979 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-08 23:36:01,979 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 23:36:01,980 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-08 23:36:01,980 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-08 23:36:01,980 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-08 23:36:01,980 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:36:01,980 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:36:01,980 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:36:01,980 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-08 23:36:01,980 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-08 23:36:01,981 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:36:01,981 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:36:01,981 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:36:01,981 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-08 23:36:01,981 WARN L170 areAnnotationChecker]: L35-6 has no Hoare annotation [2020-07-08 23:36:01,981 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 23:36:01,981 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-08 23:36:01,981 WARN L170 areAnnotationChecker]: L44-5 has no Hoare annotation [2020-07-08 23:36:01,981 WARN L170 areAnnotationChecker]: L44-5 has no Hoare annotation [2020-07-08 23:36:01,982 WARN L170 areAnnotationChecker]: L44-5 has no Hoare annotation [2020-07-08 23:36:01,982 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-08 23:36:01,982 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-08 23:36:01,982 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 23:36:01,982 WARN L170 areAnnotationChecker]: L44-6 has no Hoare annotation [2020-07-08 23:36:01,982 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-08 23:36:01,982 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-08 23:36:01,982 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-08 23:36:01,983 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-08 23:36:01,983 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-08 23:36:01,983 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-08 23:36:01,983 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-08 23:36:01,983 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 23:36:01,983 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-08 23:36:01,983 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-08 23:36:01,983 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-08 23:36:01,983 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-08 23:36:01,984 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-08 23:36:01,984 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-08 23:36:01,984 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-08 23:36:01,984 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-08 23:36:01,984 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-08 23:36:01,984 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-08 23:36:01,984 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-08 23:36:01,985 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-08 23:36:01,985 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-08 23:36:01,985 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-08 23:36:01,985 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 23:36:01,985 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-08 23:36:01,985 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2020-07-08 23:36:01,985 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-08 23:36:01,985 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-08 23:36:01,985 WARN L170 areAnnotationChecker]: L49-4 has no Hoare annotation [2020-07-08 23:36:01,985 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-08 23:36:01,986 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-08 23:36:01,986 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-08 23:36:01,986 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:36:01,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:36:01 BoogieIcfgContainer [2020-07-08 23:36:01,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:36:01,993 INFO L168 Benchmark]: Toolchain (without parser) took 4314.58 ms. Allocated memory was 139.5 MB in the beginning and 246.4 MB in the end (delta: 107.0 MB). Free memory was 103.3 MB in the beginning and 173.4 MB in the end (delta: -70.0 MB). Peak memory consumption was 36.9 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:01,994 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 139.5 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 23:36:01,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 484.64 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.9 MB in the beginning and 183.0 MB in the end (delta: -80.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:01,996 INFO L168 Benchmark]: Boogie Preprocessor took 50.76 ms. Allocated memory is still 203.9 MB. Free memory was 183.0 MB in the beginning and 180.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:01,997 INFO L168 Benchmark]: RCFGBuilder took 607.17 ms. Allocated memory is still 203.9 MB. Free memory was 180.1 MB in the beginning and 146.4 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:01,998 INFO L168 Benchmark]: TraceAbstraction took 3165.50 ms. Allocated memory was 203.9 MB in the beginning and 246.4 MB in the end (delta: 42.5 MB). Free memory was 146.4 MB in the beginning and 173.4 MB in the end (delta: -26.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:02,001 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 139.5 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 484.64 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.9 MB in the beginning and 183.0 MB in the end (delta: -80.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.76 ms. Allocated memory is still 203.9 MB. Free memory was 183.0 MB in the beginning and 180.7 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 607.17 ms. Allocated memory is still 203.9 MB. Free memory was 180.1 MB in the beginning and 146.4 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3165.50 ms. Allocated memory was 203.9 MB in the beginning and 246.4 MB in the end (delta: 42.5 MB). Free memory was 146.4 MB in the beginning and 173.4 MB in the end (delta: -26.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=10, N=0] [L21] N = __VERIFIER_nondet_int() VAL [\old(N)=0, __VERIFIER_nondet_int()=1, N=1] [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; VAL [\old(N)=0, N=1] [L26] long long sum[1]; VAL [\old(N)=0, N=1, sum={2:0}] [L27] int *a = malloc(sizeof(int)*N); VAL [\old(N)=0, a={-1:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={2:0}] [L29] sum[0] = 1 VAL [\old(N)=0, a={-1:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={2:0}] [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1, sum={2:0}] [L30] COND TRUE i