/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/res1f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:26:51,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:26:51,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:26:51,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:26:51,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:26:51,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:26:51,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:26:51,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:26:51,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:26:51,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:26:51,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:26:51,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:26:51,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:26:51,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:26:51,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:26:51,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:26:51,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:26:51,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:26:51,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:26:51,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:26:51,430 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:26:51,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:26:51,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:26:51,433 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:26:51,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:26:51,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:26:51,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:26:51,437 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:26:51,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:26:51,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:26:51,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:26:51,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:26:51,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:26:51,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:26:51,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:26:51,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:26:51,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:26:51,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:26:51,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:26:51,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:26:51,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:26:51,448 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:26:51,459 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:26:51,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:26:51,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:26:51,462 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:26:51,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:26:51,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:26:51,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:26:51,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:26:51,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:26:51,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:26:51,463 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:26:51,463 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:26:51,463 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:26:51,464 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:26:51,464 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:26:51,464 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:26:51,464 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:26:51,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:26:51,465 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:26:51,465 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:26:51,465 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:26:51,465 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:26:51,466 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-11 02:26:51,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:26:51,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:26:51,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:26:51,813 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:26:51,814 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:26:51,815 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/res1f.c [2020-07-11 02:26:51,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb4c38b0/1650e4817a4e48039f4e2e7eded0ce53/FLAGacde1703e [2020-07-11 02:26:52,451 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:26:52,455 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/res1f.c [2020-07-11 02:26:52,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb4c38b0/1650e4817a4e48039f4e2e7eded0ce53/FLAGacde1703e [2020-07-11 02:26:52,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cb4c38b0/1650e4817a4e48039f4e2e7eded0ce53 [2020-07-11 02:26:52,782 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:26:52,784 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:26:52,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:26:52,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:26:52,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:26:52,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:26:52" (1/1) ... [2020-07-11 02:26:52,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b8024a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:52, skipping insertion in model container [2020-07-11 02:26:52,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:26:52" (1/1) ... [2020-07-11 02:26:52,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:26:52,834 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:26:53,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:26:53,124 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:26:53,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:26:53,175 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:26:53,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:53 WrapperNode [2020-07-11 02:26:53,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:26:53,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:26:53,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:26:53,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:26:53,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:53" (1/1) ... [2020-07-11 02:26:53,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:53" (1/1) ... [2020-07-11 02:26:53,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:53" (1/1) ... [2020-07-11 02:26:53,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:53" (1/1) ... [2020-07-11 02:26:53,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:53" (1/1) ... [2020-07-11 02:26:53,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:53" (1/1) ... [2020-07-11 02:26:53,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:53" (1/1) ... [2020-07-11 02:26:53,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:26:53,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:26:53,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:26:53,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:26:53,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:53" (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-11 02:26:53,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:26:53,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:26:53,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:26:53,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:26:53,402 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:26:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:26:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:26:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:26:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:26:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:26:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 02:26:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:26:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 02:26:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 02:26:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 02:26:53,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 02:26:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 02:26:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:26:53,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:26:54,007 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:26:54,008 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-11 02:26:54,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:26:54 BoogieIcfgContainer [2020-07-11 02:26:54,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:26:54,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:26:54,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:26:54,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:26:54,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:26:52" (1/3) ... [2020-07-11 02:26:54,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1ddf7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:26:54, skipping insertion in model container [2020-07-11 02:26:54,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:26:53" (2/3) ... [2020-07-11 02:26:54,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1ddf7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:26:54, skipping insertion in model container [2020-07-11 02:26:54,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:26:54" (3/3) ... [2020-07-11 02:26:54,038 INFO L109 eAbstractionObserver]: Analyzing ICFG res1f.c [2020-07-11 02:26:54,052 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:26:54,062 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:26:54,083 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:26:54,118 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:26:54,118 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:26:54,119 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:26:54,119 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:26:54,119 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:26:54,120 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:26:54,120 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:26:54,120 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:26:54,150 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-07-11 02:26:54,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-11 02:26:54,171 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:26:54,173 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] [2020-07-11 02:26:54,174 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:26:54,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:26:54,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1226656927, now seen corresponding path program 1 times [2020-07-11 02:26:54,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:26:54,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1114108496] [2020-07-11 02:26:54,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:26:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:54,524 INFO L280 TraceCheckUtils]: 0: Hoare triple {89#(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; {77#true} is VALID [2020-07-11 02:26:54,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#true} #valid := #valid[0 := 0]; {77#true} is VALID [2020-07-11 02:26:54,526 INFO L280 TraceCheckUtils]: 2: Hoare triple {77#true} assume 0 < #StackHeapBarrier; {77#true} is VALID [2020-07-11 02:26:54,526 INFO L280 TraceCheckUtils]: 3: Hoare triple {77#true} ~N~0 := 0; {77#true} is VALID [2020-07-11 02:26:54,527 INFO L280 TraceCheckUtils]: 4: Hoare triple {77#true} assume true; {77#true} is VALID [2020-07-11 02:26:54,527 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {77#true} {77#true} #132#return; {77#true} is VALID [2020-07-11 02:26:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:54,545 INFO L280 TraceCheckUtils]: 0: Hoare triple {77#true} ~cond := #in~cond; {77#true} is VALID [2020-07-11 02:26:54,546 INFO L280 TraceCheckUtils]: 1: Hoare triple {77#true} assume !(0 == ~cond); {77#true} is VALID [2020-07-11 02:26:54,546 INFO L280 TraceCheckUtils]: 2: Hoare triple {77#true} assume true; {77#true} is VALID [2020-07-11 02:26:54,547 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {77#true} {77#true} #128#return; {77#true} is VALID [2020-07-11 02:26:54,550 INFO L263 TraceCheckUtils]: 0: Hoare triple {77#true} call ULTIMATE.init(); {89#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:26:54,550 INFO L280 TraceCheckUtils]: 1: Hoare triple {89#(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; {77#true} is VALID [2020-07-11 02:26:54,551 INFO L280 TraceCheckUtils]: 2: Hoare triple {77#true} #valid := #valid[0 := 0]; {77#true} is VALID [2020-07-11 02:26:54,551 INFO L280 TraceCheckUtils]: 3: Hoare triple {77#true} assume 0 < #StackHeapBarrier; {77#true} is VALID [2020-07-11 02:26:54,552 INFO L280 TraceCheckUtils]: 4: Hoare triple {77#true} ~N~0 := 0; {77#true} is VALID [2020-07-11 02:26:54,552 INFO L280 TraceCheckUtils]: 5: Hoare triple {77#true} assume true; {77#true} is VALID [2020-07-11 02:26:54,553 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {77#true} {77#true} #132#return; {77#true} is VALID [2020-07-11 02:26:54,553 INFO L263 TraceCheckUtils]: 7: Hoare triple {77#true} call #t~ret12 := main(); {77#true} is VALID [2020-07-11 02:26:54,554 INFO L280 TraceCheckUtils]: 8: Hoare triple {77#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {77#true} is VALID [2020-07-11 02:26:54,554 INFO L280 TraceCheckUtils]: 9: Hoare triple {77#true} ~N~0 := #t~nondet0; {77#true} is VALID [2020-07-11 02:26:54,555 INFO L280 TraceCheckUtils]: 10: Hoare triple {77#true} havoc #t~nondet0; {77#true} is VALID [2020-07-11 02:26:54,556 INFO L280 TraceCheckUtils]: 11: Hoare triple {77#true} assume !(~N~0 <= 0); {77#true} is VALID [2020-07-11 02:26:54,556 INFO L263 TraceCheckUtils]: 12: Hoare triple {77#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {77#true} is VALID [2020-07-11 02:26:54,557 INFO L280 TraceCheckUtils]: 13: Hoare triple {77#true} ~cond := #in~cond; {77#true} is VALID [2020-07-11 02:26:54,557 INFO L280 TraceCheckUtils]: 14: Hoare triple {77#true} assume !(0 == ~cond); {77#true} is VALID [2020-07-11 02:26:54,558 INFO L280 TraceCheckUtils]: 15: Hoare triple {77#true} assume true; {77#true} is VALID [2020-07-11 02:26:54,558 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {77#true} {77#true} #128#return; {77#true} is VALID [2020-07-11 02:26:54,559 INFO L280 TraceCheckUtils]: 17: Hoare triple {77#true} havoc ~i~0; {77#true} is VALID [2020-07-11 02:26:54,559 INFO L280 TraceCheckUtils]: 18: Hoare triple {77#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {77#true} is VALID [2020-07-11 02:26:54,560 INFO L280 TraceCheckUtils]: 19: Hoare triple {77#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {77#true} is VALID [2020-07-11 02:26:54,560 INFO L280 TraceCheckUtils]: 20: Hoare triple {77#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {77#true} is VALID [2020-07-11 02:26:54,561 INFO L280 TraceCheckUtils]: 21: Hoare triple {77#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L28 {77#true} is VALID [2020-07-11 02:26:54,561 INFO L280 TraceCheckUtils]: 22: Hoare triple {77#true} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {77#true} is VALID [2020-07-11 02:26:54,562 INFO L280 TraceCheckUtils]: 23: Hoare triple {77#true} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L30 {77#true} is VALID [2020-07-11 02:26:54,562 INFO L280 TraceCheckUtils]: 24: Hoare triple {77#true} ~i~0 := 0; {77#true} is VALID [2020-07-11 02:26:54,564 INFO L280 TraceCheckUtils]: 25: Hoare triple {77#true} assume !true; {78#false} is VALID [2020-07-11 02:26:54,564 INFO L280 TraceCheckUtils]: 26: Hoare triple {78#false} ~i~0 := 0; {78#false} is VALID [2020-07-11 02:26:54,565 INFO L280 TraceCheckUtils]: 27: Hoare triple {78#false} assume !(~i~0 < ~N~0); {78#false} is VALID [2020-07-11 02:26:54,566 INFO L280 TraceCheckUtils]: 28: Hoare triple {78#false} ~i~0 := 0; {78#false} is VALID [2020-07-11 02:26:54,566 INFO L280 TraceCheckUtils]: 29: Hoare triple {78#false} assume !(~i~0 < ~N~0); {78#false} is VALID [2020-07-11 02:26:54,567 INFO L280 TraceCheckUtils]: 30: Hoare triple {78#false} ~i~0 := 0; {78#false} is VALID [2020-07-11 02:26:54,567 INFO L280 TraceCheckUtils]: 31: Hoare triple {78#false} assume !true; {78#false} is VALID [2020-07-11 02:26:54,568 INFO L280 TraceCheckUtils]: 32: Hoare triple {78#false} SUMMARY for call #t~mem11 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L46-6 {78#false} is VALID [2020-07-11 02:26:54,568 INFO L263 TraceCheckUtils]: 33: Hoare triple {78#false} call __VERIFIER_assert((if #t~mem11 <= 2 * ~N~0 then 1 else 0)); {78#false} is VALID [2020-07-11 02:26:54,569 INFO L280 TraceCheckUtils]: 34: Hoare triple {78#false} ~cond := #in~cond; {78#false} is VALID [2020-07-11 02:26:54,569 INFO L280 TraceCheckUtils]: 35: Hoare triple {78#false} assume 0 == ~cond; {78#false} is VALID [2020-07-11 02:26:54,570 INFO L280 TraceCheckUtils]: 36: Hoare triple {78#false} assume !false; {78#false} is VALID [2020-07-11 02:26:54,576 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-11 02:26:54,577 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1114108496] [2020-07-11 02:26:54,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:26:54,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 02:26:54,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16202688] [2020-07-11 02:26:54,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-11 02:26:54,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:26:54,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 02:26:54,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:54,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 02:26:54,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:26:54,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 02:26:54,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:26:54,709 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-07-11 02:26:55,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:55,319 INFO L93 Difference]: Finished difference Result 131 states and 150 transitions. [2020-07-11 02:26:55,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 02:26:55,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2020-07-11 02:26:55,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:26:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:26:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-11 02:26:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:26:55,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2020-07-11 02:26:55,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2020-07-11 02:26:55,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:55,603 INFO L225 Difference]: With dead ends: 131 [2020-07-11 02:26:55,603 INFO L226 Difference]: Without dead ends: 62 [2020-07-11 02:26:55,608 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-11 02:26:55,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-11 02:26:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-07-11 02:26:55,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:26:55,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2020-07-11 02:26:55,732 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2020-07-11 02:26:55,733 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2020-07-11 02:26:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:55,741 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-07-11 02:26:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-11 02:26:55,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:55,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:55,743 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2020-07-11 02:26:55,743 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2020-07-11 02:26:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:55,751 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-07-11 02:26:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-11 02:26:55,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:55,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:55,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:26:55,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:26:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-11 02:26:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2020-07-11 02:26:55,761 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 37 [2020-07-11 02:26:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:26:55,762 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2020-07-11 02:26:55,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 02:26:55,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2020-07-11 02:26:55,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-11 02:26:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-11 02:26:55,862 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:26:55,862 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] [2020-07-11 02:26:55,863 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:26:55,863 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:26:55,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:26:55,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1534386935, now seen corresponding path program 1 times [2020-07-11 02:26:55,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:26:55,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [950631245] [2020-07-11 02:26:55,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:26:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:56,050 INFO L280 TraceCheckUtils]: 0: Hoare triple {616#(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; {602#true} is VALID [2020-07-11 02:26:56,051 INFO L280 TraceCheckUtils]: 1: Hoare triple {602#true} #valid := #valid[0 := 0]; {602#true} is VALID [2020-07-11 02:26:56,051 INFO L280 TraceCheckUtils]: 2: Hoare triple {602#true} assume 0 < #StackHeapBarrier; {602#true} is VALID [2020-07-11 02:26:56,052 INFO L280 TraceCheckUtils]: 3: Hoare triple {602#true} ~N~0 := 0; {602#true} is VALID [2020-07-11 02:26:56,053 INFO L280 TraceCheckUtils]: 4: Hoare triple {602#true} assume true; {602#true} is VALID [2020-07-11 02:26:56,053 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {602#true} {602#true} #132#return; {602#true} is VALID [2020-07-11 02:26:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:26:56,065 INFO L280 TraceCheckUtils]: 0: Hoare triple {602#true} ~cond := #in~cond; {602#true} is VALID [2020-07-11 02:26:56,065 INFO L280 TraceCheckUtils]: 1: Hoare triple {602#true} assume !(0 == ~cond); {602#true} is VALID [2020-07-11 02:26:56,066 INFO L280 TraceCheckUtils]: 2: Hoare triple {602#true} assume true; {602#true} is VALID [2020-07-11 02:26:56,068 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {602#true} {610#(<= 1 ~N~0)} #128#return; {610#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:56,070 INFO L263 TraceCheckUtils]: 0: Hoare triple {602#true} call ULTIMATE.init(); {616#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:26:56,071 INFO L280 TraceCheckUtils]: 1: Hoare triple {616#(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; {602#true} is VALID [2020-07-11 02:26:56,071 INFO L280 TraceCheckUtils]: 2: Hoare triple {602#true} #valid := #valid[0 := 0]; {602#true} is VALID [2020-07-11 02:26:56,072 INFO L280 TraceCheckUtils]: 3: Hoare triple {602#true} assume 0 < #StackHeapBarrier; {602#true} is VALID [2020-07-11 02:26:56,072 INFO L280 TraceCheckUtils]: 4: Hoare triple {602#true} ~N~0 := 0; {602#true} is VALID [2020-07-11 02:26:56,073 INFO L280 TraceCheckUtils]: 5: Hoare triple {602#true} assume true; {602#true} is VALID [2020-07-11 02:26:56,073 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {602#true} {602#true} #132#return; {602#true} is VALID [2020-07-11 02:26:56,074 INFO L263 TraceCheckUtils]: 7: Hoare triple {602#true} call #t~ret12 := main(); {602#true} is VALID [2020-07-11 02:26:56,074 INFO L280 TraceCheckUtils]: 8: Hoare triple {602#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {602#true} is VALID [2020-07-11 02:26:56,074 INFO L280 TraceCheckUtils]: 9: Hoare triple {602#true} ~N~0 := #t~nondet0; {602#true} is VALID [2020-07-11 02:26:56,075 INFO L280 TraceCheckUtils]: 10: Hoare triple {602#true} havoc #t~nondet0; {602#true} is VALID [2020-07-11 02:26:56,076 INFO L280 TraceCheckUtils]: 11: Hoare triple {602#true} assume !(~N~0 <= 0); {610#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:56,077 INFO L263 TraceCheckUtils]: 12: Hoare triple {610#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {602#true} is VALID [2020-07-11 02:26:56,078 INFO L280 TraceCheckUtils]: 13: Hoare triple {602#true} ~cond := #in~cond; {602#true} is VALID [2020-07-11 02:26:56,078 INFO L280 TraceCheckUtils]: 14: Hoare triple {602#true} assume !(0 == ~cond); {602#true} is VALID [2020-07-11 02:26:56,079 INFO L280 TraceCheckUtils]: 15: Hoare triple {602#true} assume true; {602#true} is VALID [2020-07-11 02:26:56,080 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {602#true} {610#(<= 1 ~N~0)} #128#return; {610#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:56,082 INFO L280 TraceCheckUtils]: 17: Hoare triple {610#(<= 1 ~N~0)} havoc ~i~0; {610#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:56,084 INFO L280 TraceCheckUtils]: 18: Hoare triple {610#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {610#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:56,085 INFO L280 TraceCheckUtils]: 19: Hoare triple {610#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {610#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:56,086 INFO L280 TraceCheckUtils]: 20: Hoare triple {610#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {610#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:56,087 INFO L280 TraceCheckUtils]: 21: Hoare triple {610#(<= 1 ~N~0)} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L28 {610#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:56,089 INFO L280 TraceCheckUtils]: 22: Hoare triple {610#(<= 1 ~N~0)} ~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset; {610#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:56,090 INFO L280 TraceCheckUtils]: 23: Hoare triple {610#(<= 1 ~N~0)} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L30 {610#(<= 1 ~N~0)} is VALID [2020-07-11 02:26:56,091 INFO L280 TraceCheckUtils]: 24: Hoare triple {610#(<= 1 ~N~0)} ~i~0 := 0; {615#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-11 02:26:56,093 INFO L280 TraceCheckUtils]: 25: Hoare triple {615#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {603#false} is VALID [2020-07-11 02:26:56,093 INFO L280 TraceCheckUtils]: 26: Hoare triple {603#false} ~i~0 := 0; {603#false} is VALID [2020-07-11 02:26:56,093 INFO L280 TraceCheckUtils]: 27: Hoare triple {603#false} assume !(~i~0 < ~N~0); {603#false} is VALID [2020-07-11 02:26:56,094 INFO L280 TraceCheckUtils]: 28: Hoare triple {603#false} ~i~0 := 0; {603#false} is VALID [2020-07-11 02:26:56,094 INFO L280 TraceCheckUtils]: 29: Hoare triple {603#false} assume !(~i~0 < ~N~0); {603#false} is VALID [2020-07-11 02:26:56,095 INFO L280 TraceCheckUtils]: 30: Hoare triple {603#false} ~i~0 := 0; {603#false} is VALID [2020-07-11 02:26:56,095 INFO L280 TraceCheckUtils]: 31: Hoare triple {603#false} assume !(~i~0 < ~N~0); {603#false} is VALID [2020-07-11 02:26:56,095 INFO L280 TraceCheckUtils]: 32: Hoare triple {603#false} SUMMARY for call #t~mem11 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L46-6 {603#false} is VALID [2020-07-11 02:26:56,096 INFO L263 TraceCheckUtils]: 33: Hoare triple {603#false} call __VERIFIER_assert((if #t~mem11 <= 2 * ~N~0 then 1 else 0)); {603#false} is VALID [2020-07-11 02:26:56,096 INFO L280 TraceCheckUtils]: 34: Hoare triple {603#false} ~cond := #in~cond; {603#false} is VALID [2020-07-11 02:26:56,096 INFO L280 TraceCheckUtils]: 35: Hoare triple {603#false} assume 0 == ~cond; {603#false} is VALID [2020-07-11 02:26:56,097 INFO L280 TraceCheckUtils]: 36: Hoare triple {603#false} assume !false; {603#false} is VALID [2020-07-11 02:26:56,101 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-11 02:26:56,102 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [950631245] [2020-07-11 02:26:56,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:26:56,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:26:56,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975959901] [2020-07-11 02:26:56,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-11 02:26:56,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:26:56,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:26:56,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:56,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:26:56,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:26:56,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:26:56,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:26:56,164 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 5 states. [2020-07-11 02:26:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:56,912 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2020-07-11 02:26:56,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:26:56,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2020-07-11 02:26:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:26:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:26:56,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-11 02:26:56,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:26:56,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2020-07-11 02:26:56,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 127 transitions. [2020-07-11 02:26:57,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:57,100 INFO L225 Difference]: With dead ends: 118 [2020-07-11 02:26:57,100 INFO L226 Difference]: Without dead ends: 86 [2020-07-11 02:26:57,102 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-11 02:26:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-07-11 02:26:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2020-07-11 02:26:57,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:26:57,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 66 states. [2020-07-11 02:26:57,213 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 66 states. [2020-07-11 02:26:57,213 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 66 states. [2020-07-11 02:26:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:57,218 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2020-07-11 02:26:57,218 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2020-07-11 02:26:57,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:57,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:57,220 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 86 states. [2020-07-11 02:26:57,220 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 86 states. [2020-07-11 02:26:57,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:26:57,226 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2020-07-11 02:26:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2020-07-11 02:26:57,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:26:57,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:26:57,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:26:57,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:26:57,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-11 02:26:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2020-07-11 02:26:57,232 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 37 [2020-07-11 02:26:57,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:26:57,232 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2020-07-11 02:26:57,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:26:57,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 66 states and 69 transitions. [2020-07-11 02:26:57,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:26:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2020-07-11 02:26:57,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-11 02:26:57,327 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:26:57,328 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, 1, 1, 1, 1, 1] [2020-07-11 02:26:57,329 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:26:57,329 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:26:57,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:26:57,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1623654441, now seen corresponding path program 1 times [2020-07-11 02:26:57,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:26:57,330 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1098570572] [2020-07-11 02:26:57,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:26:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:26:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 02:26:57,555 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 02:26:57,556 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 02:26:57,556 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:26:57,636 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 02:26:57,637 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:26:57,637 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:26:57,637 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:26:57,637 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 02:26:57,637 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-11 02:26:57,638 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:26:57,638 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:26:57,638 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:26:57,638 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-11 02:26:57,638 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-11 02:26:57,638 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-11 02:26:57,638 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 02:26:57,639 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 02:26:57,639 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 02:26:57,639 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 02:26:57,639 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-11 02:26:57,639 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-11 02:26:57,639 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-11 02:26:57,640 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-11 02:26:57,640 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-11 02:26:57,640 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-11 02:26:57,640 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-11 02:26:57,640 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-11 02:26:57,640 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 02:26:57,640 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 02:26:57,641 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 02:26:57,641 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 02:26:57,641 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-11 02:26:57,641 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-11 02:26:57,641 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 02:26:57,641 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 02:26:57,641 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2020-07-11 02:26:57,642 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 02:26:57,642 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-11 02:26:57,642 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 02:26:57,642 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-11 02:26:57,642 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-11 02:26:57,642 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 02:26:57,642 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-11 02:26:57,642 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-11 02:26:57,643 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-11 02:26:57,643 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-11 02:26:57,643 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-11 02:26:57,643 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-11 02:26:57,646 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-11 02:26:57,647 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-11 02:26:57,647 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-11 02:26:57,647 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-11 02:26:57,647 WARN L170 areAnnotationChecker]: L31-5 has no Hoare annotation [2020-07-11 02:26:57,647 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-11 02:26:57,647 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-11 02:26:57,647 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-11 02:26:57,647 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-11 02:26:57,648 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-11 02:26:57,648 WARN L170 areAnnotationChecker]: L36-5 has no Hoare annotation [2020-07-11 02:26:57,648 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-11 02:26:57,648 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2020-07-11 02:26:57,648 WARN L170 areAnnotationChecker]: L41-5 has no Hoare annotation [2020-07-11 02:26:57,648 WARN L170 areAnnotationChecker]: L41-5 has no Hoare annotation [2020-07-11 02:26:57,648 WARN L170 areAnnotationChecker]: L41-5 has no Hoare annotation [2020-07-11 02:26:57,649 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-11 02:26:57,649 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2020-07-11 02:26:57,649 WARN L170 areAnnotationChecker]: L41-6 has no Hoare annotation [2020-07-11 02:26:57,649 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-11 02:26:57,649 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-11 02:26:57,649 WARN L170 areAnnotationChecker]: L46-5 has no Hoare annotation [2020-07-11 02:26:57,649 WARN L170 areAnnotationChecker]: L46-5 has no Hoare annotation [2020-07-11 02:26:57,649 WARN L170 areAnnotationChecker]: L46-5 has no Hoare annotation [2020-07-11 02:26:57,650 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2020-07-11 02:26:57,650 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-11 02:26:57,650 WARN L170 areAnnotationChecker]: L46-6 has no Hoare annotation [2020-07-11 02:26:57,650 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-11 02:26:57,650 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2020-07-11 02:26:57,650 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-11 02:26:57,650 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-11 02:26:57,651 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2020-07-11 02:26:57,651 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2020-07-11 02:26:57,651 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2020-07-11 02:26:57,651 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2020-07-11 02:26:57,651 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2020-07-11 02:26:57,651 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-11 02:26:57,651 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2020-07-11 02:26:57,652 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-11 02:26:57,652 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-11 02:26:57,652 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2020-07-11 02:26:57,652 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-11 02:26:57,653 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-11 02:26:57,653 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-11 02:26:57,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:26:57 BoogieIcfgContainer [2020-07-11 02:26:57,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:26:57,667 INFO L168 Benchmark]: Toolchain (without parser) took 4879.63 ms. Allocated memory was 137.4 MB in the beginning and 248.5 MB in the end (delta: 111.1 MB). Free memory was 103.0 MB in the beginning and 208.9 MB in the end (delta: -105.9 MB). Peak memory consumption was 119.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:57,669 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-11 02:26:57,670 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.97 ms. Allocated memory is still 137.4 MB. Free memory was 102.8 MB in the beginning and 91.5 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:57,672 INFO L168 Benchmark]: Boogie Preprocessor took 149.03 ms. Allocated memory was 137.4 MB in the beginning and 202.9 MB in the end (delta: 65.5 MB). Free memory was 91.5 MB in the beginning and 180.3 MB in the end (delta: -88.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:57,674 INFO L168 Benchmark]: RCFGBuilder took 693.53 ms. Allocated memory is still 202.9 MB. Free memory was 180.3 MB in the beginning and 147.4 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:57,677 INFO L168 Benchmark]: TraceAbstraction took 3637.05 ms. Allocated memory was 202.9 MB in the beginning and 248.5 MB in the end (delta: 45.6 MB). Free memory was 146.7 MB in the beginning and 208.9 MB in the end (delta: -62.2 MB). Peak memory consumption was 97.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:26:57,692 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.32 ms. Allocated memory is still 137.4 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 390.97 ms. Allocated memory is still 137.4 MB. Free memory was 102.8 MB in the beginning and 91.5 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 149.03 ms. Allocated memory was 137.4 MB in the beginning and 202.9 MB in the end (delta: 65.5 MB). Free memory was 91.5 MB in the beginning and 180.3 MB in the end (delta: -88.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 693.53 ms. Allocated memory is still 202.9 MB. Free memory was 180.3 MB in the beginning and 147.4 MB in the end (delta: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3637.05 ms. Allocated memory was 202.9 MB in the beginning and 248.5 MB in the end (delta: 45.6 MB). Free memory was 146.7 MB in the beginning and 208.9 MB in the end (delta: -62.2 MB). Peak memory consumption was 97.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=10, N=0] [L21] N = __VERIFIER_nondet_int() VAL [\old(N)=0, __VERIFIER_nondet_int()=1, N=1] [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; VAL [\old(N)=0, N=1] [L26] long long sum[1]; VAL [\old(N)=0, N=1, sum={7:0}] [L27] int *a = malloc(sizeof(int)*N); VAL [\old(N)=0, a={-1:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={7:0}] [L28] int *b = malloc(sizeof(int)*N); VAL [\old(N)=0, a={-1:0}, b={5:0}, malloc(sizeof(int)*N)={5:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={7:0}] [L30] sum[0] = 1 VAL [\old(N)=0, a={-1:0}, b={5:0}, malloc(sizeof(int)*N)={5:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={7:0}] [L31] i=0 VAL [\old(N)=0, a={-1:0}, b={5:0}, i=0, malloc(sizeof(int)*N)={5:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={7:0}] [L31] COND TRUE i