/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/ss1f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:27:22,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:27:22,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:27:22,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:27:22,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:27:22,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:27:22,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:27:22,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:27:22,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:27:22,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:27:22,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:27:22,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:27:22,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:27:22,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:27:22,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:27:22,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:27:22,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:27:22,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:27:22,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:27:22,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:27:22,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:27:22,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:27:22,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:27:22,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:27:22,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:27:22,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:27:22,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:27:22,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:27:22,563 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:27:22,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:27:22,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:27:22,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:27:22,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:27:22,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:27:22,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:27:22,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:27:22,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:27:22,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:27:22,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:27:22,571 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:27:22,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:27:22,573 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:27:22,582 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:27:22,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:27:22,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:27:22,584 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:27:22,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:27:22,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:27:22,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:27:22,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:27:22,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:27:22,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:27:22,586 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:27:22,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:27:22,586 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:27:22,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:27:22,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:27:22,587 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:27:22,587 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:27:22,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:27:22,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:27:22,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:27:22,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:27:22,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:27:22,588 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:27:22,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:27:22,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:27:22,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:27:22,995 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:27:22,996 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:27:22,996 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ss1f.c [2020-07-11 02:27:23,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8c6aae80/4fd54626e7e7430884c701a2fb3a71a6/FLAG47cad43f7 [2020-07-11 02:27:23,766 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:27:23,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ss1f.c [2020-07-11 02:27:23,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8c6aae80/4fd54626e7e7430884c701a2fb3a71a6/FLAG47cad43f7 [2020-07-11 02:27:24,115 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8c6aae80/4fd54626e7e7430884c701a2fb3a71a6 [2020-07-11 02:27:24,129 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:27:24,134 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:27:24,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:27:24,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:27:24,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:27:24,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:27:24" (1/1) ... [2020-07-11 02:27:24,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ab684d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:24, skipping insertion in model container [2020-07-11 02:27:24,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:27:24" (1/1) ... [2020-07-11 02:27:24,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:27:24,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:27:24,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:27:24,459 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:27:24,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:27:24,610 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:27:24,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:24 WrapperNode [2020-07-11 02:27:24,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:27:24,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:27:24,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:27:24,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:27:24,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:24" (1/1) ... [2020-07-11 02:27:24,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:24" (1/1) ... [2020-07-11 02:27:24,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:24" (1/1) ... [2020-07-11 02:27:24,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:24" (1/1) ... [2020-07-11 02:27:24,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:24" (1/1) ... [2020-07-11 02:27:24,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:24" (1/1) ... [2020-07-11 02:27:24,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:24" (1/1) ... [2020-07-11 02:27:24,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:27:24,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:27:24,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:27:24,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:27:24,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:24" (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:27:24,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:27:24,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:27:24,762 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:27:24,762 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:27:24,762 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:27:24,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:27:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:27:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:27:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:27:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:27:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 02:27:24,763 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:27:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 02:27:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 02:27:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 02:27:24,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 02:27:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 02:27:24,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:27:24,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:27:25,337 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:27:25,338 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-11 02:27:25,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:27:25 BoogieIcfgContainer [2020-07-11 02:27:25,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:27:25,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:27:25,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:27:25,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:27:25,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:27:24" (1/3) ... [2020-07-11 02:27:25,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ca04d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:27:25, skipping insertion in model container [2020-07-11 02:27:25,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:24" (2/3) ... [2020-07-11 02:27:25,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ca04d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:27:25, skipping insertion in model container [2020-07-11 02:27:25,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:27:25" (3/3) ... [2020-07-11 02:27:25,357 INFO L109 eAbstractionObserver]: Analyzing ICFG ss1f.c [2020-07-11 02:27:25,372 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:27:25,384 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:27:25,403 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:27:25,436 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:27:25,436 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:27:25,437 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:27:25,437 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:27:25,437 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:27:25,437 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:27:25,438 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:27:25,438 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:27:25,460 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2020-07-11 02:27:25,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-11 02:27:25,476 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:25,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:25,479 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:25,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:25,488 INFO L82 PathProgramCache]: Analyzing trace with hash 441507982, now seen corresponding path program 1 times [2020-07-11 02:27:25,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:25,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [964961123] [2020-07-11 02:27:25,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:25,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {79#true} is VALID [2020-07-11 02:27:25,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} #valid := #valid[0 := 0]; {79#true} is VALID [2020-07-11 02:27:25,805 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} assume 0 < #StackHeapBarrier; {79#true} is VALID [2020-07-11 02:27:25,805 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} ~N~0 := 0; {79#true} is VALID [2020-07-11 02:27:25,806 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-11 02:27:25,807 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {79#true} {79#true} #134#return; {79#true} is VALID [2020-07-11 02:27:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:25,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {79#true} ~cond := #in~cond; {79#true} is VALID [2020-07-11 02:27:25,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {79#true} assume !(0 == ~cond); {79#true} is VALID [2020-07-11 02:27:25,823 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-11 02:27:25,824 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {79#true} {79#true} #130#return; {79#true} is VALID [2020-07-11 02:27:25,827 INFO L263 TraceCheckUtils]: 0: Hoare triple {79#true} call ULTIMATE.init(); {91#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 02:27:25,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {91#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {79#true} is VALID [2020-07-11 02:27:25,828 INFO L280 TraceCheckUtils]: 2: Hoare triple {79#true} #valid := #valid[0 := 0]; {79#true} is VALID [2020-07-11 02:27:25,829 INFO L280 TraceCheckUtils]: 3: Hoare triple {79#true} assume 0 < #StackHeapBarrier; {79#true} is VALID [2020-07-11 02:27:25,829 INFO L280 TraceCheckUtils]: 4: Hoare triple {79#true} ~N~0 := 0; {79#true} is VALID [2020-07-11 02:27:25,830 INFO L280 TraceCheckUtils]: 5: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-11 02:27:25,830 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {79#true} {79#true} #134#return; {79#true} is VALID [2020-07-11 02:27:25,831 INFO L263 TraceCheckUtils]: 7: Hoare triple {79#true} call #t~ret13 := main(); {79#true} is VALID [2020-07-11 02:27:25,832 INFO L280 TraceCheckUtils]: 8: Hoare triple {79#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {79#true} is VALID [2020-07-11 02:27:25,832 INFO L280 TraceCheckUtils]: 9: Hoare triple {79#true} ~N~0 := #t~nondet0; {79#true} is VALID [2020-07-11 02:27:25,833 INFO L280 TraceCheckUtils]: 10: Hoare triple {79#true} havoc #t~nondet0; {79#true} is VALID [2020-07-11 02:27:25,833 INFO L280 TraceCheckUtils]: 11: Hoare triple {79#true} assume !(~N~0 <= 0); {79#true} is VALID [2020-07-11 02:27:25,834 INFO L263 TraceCheckUtils]: 12: Hoare triple {79#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {79#true} is VALID [2020-07-11 02:27:25,834 INFO L280 TraceCheckUtils]: 13: Hoare triple {79#true} ~cond := #in~cond; {79#true} is VALID [2020-07-11 02:27:25,835 INFO L280 TraceCheckUtils]: 14: Hoare triple {79#true} assume !(0 == ~cond); {79#true} is VALID [2020-07-11 02:27:25,835 INFO L280 TraceCheckUtils]: 15: Hoare triple {79#true} assume true; {79#true} is VALID [2020-07-11 02:27:25,835 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {79#true} {79#true} #130#return; {79#true} is VALID [2020-07-11 02:27:25,836 INFO L280 TraceCheckUtils]: 17: Hoare triple {79#true} havoc ~i~0; {79#true} is VALID [2020-07-11 02:27:25,836 INFO L280 TraceCheckUtils]: 18: Hoare triple {79#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {79#true} is VALID [2020-07-11 02:27:25,837 INFO L280 TraceCheckUtils]: 19: Hoare triple {79#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {79#true} is VALID [2020-07-11 02:27:25,837 INFO L280 TraceCheckUtils]: 20: Hoare triple {79#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {79#true} is VALID [2020-07-11 02:27:25,838 INFO L280 TraceCheckUtils]: 21: Hoare triple {79#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {79#true} is VALID [2020-07-11 02:27:25,838 INFO L280 TraceCheckUtils]: 22: Hoare triple {79#true} ~i~0 := 0; {79#true} is VALID [2020-07-11 02:27:25,840 INFO L280 TraceCheckUtils]: 23: Hoare triple {79#true} assume !true; {80#false} is VALID [2020-07-11 02:27:25,841 INFO L280 TraceCheckUtils]: 24: Hoare triple {80#false} ~i~0 := 0; {80#false} is VALID [2020-07-11 02:27:25,841 INFO L280 TraceCheckUtils]: 25: Hoare triple {80#false} assume !true; {80#false} is VALID [2020-07-11 02:27:25,842 INFO L280 TraceCheckUtils]: 26: Hoare triple {80#false} ~i~0 := 0; {80#false} is VALID [2020-07-11 02:27:25,842 INFO L280 TraceCheckUtils]: 27: Hoare triple {80#false} assume !true; {80#false} is VALID [2020-07-11 02:27:25,843 INFO L280 TraceCheckUtils]: 28: Hoare triple {80#false} ~i~0 := 0; {80#false} is VALID [2020-07-11 02:27:25,844 INFO L280 TraceCheckUtils]: 29: Hoare triple {80#false} assume !true; {80#false} is VALID [2020-07-11 02:27:25,844 INFO L280 TraceCheckUtils]: 30: Hoare triple {80#false} SUMMARY for call #t~mem12 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L44-6 {80#false} is VALID [2020-07-11 02:27:25,845 INFO L263 TraceCheckUtils]: 31: Hoare triple {80#false} call __VERIFIER_assert((if #t~mem12 == ~N~0 * (2 + ~N~0) then 1 else 0)); {80#false} is VALID [2020-07-11 02:27:25,845 INFO L280 TraceCheckUtils]: 32: Hoare triple {80#false} ~cond := #in~cond; {80#false} is VALID [2020-07-11 02:27:25,846 INFO L280 TraceCheckUtils]: 33: Hoare triple {80#false} assume 0 == ~cond; {80#false} is VALID [2020-07-11 02:27:25,846 INFO L280 TraceCheckUtils]: 34: Hoare triple {80#false} assume !false; {80#false} is VALID [2020-07-11 02:27:25,852 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:27:25,853 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [964961123] [2020-07-11 02:27:25,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:27:25,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 02:27:25,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614106597] [2020-07-11 02:27:25,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-07-11 02:27:25,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:25,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 02:27:25,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:25,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 02:27:25,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:25,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 02:27:25,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:27:25,965 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2020-07-11 02:27:26,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:26,697 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2020-07-11 02:27:26,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 02:27:26,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-07-11 02:27:26,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:27:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2020-07-11 02:27:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:27:26,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2020-07-11 02:27:26,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 154 transitions. [2020-07-11 02:27:26,978 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-11 02:27:26,995 INFO L225 Difference]: With dead ends: 135 [2020-07-11 02:27:26,995 INFO L226 Difference]: Without dead ends: 64 [2020-07-11 02:27:27,001 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:27:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-11 02:27:27,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-07-11 02:27:27,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:27,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2020-07-11 02:27:27,120 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2020-07-11 02:27:27,120 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2020-07-11 02:27:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:27,127 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-11 02:27:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-07-11 02:27:27,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:27,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:27,130 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2020-07-11 02:27:27,130 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2020-07-11 02:27:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:27,137 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-11 02:27:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-07-11 02:27:27,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:27,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:27,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:27,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:27,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-11 02:27:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2020-07-11 02:27:27,146 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 35 [2020-07-11 02:27:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:27,147 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2020-07-11 02:27:27,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 02:27:27,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states and 67 transitions. [2020-07-11 02:27:27,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-07-11 02:27:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-11 02:27:27,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:27,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:27:27,252 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:27:27,252 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:27,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:27,253 INFO L82 PathProgramCache]: Analyzing trace with hash 280562238, now seen corresponding path program 1 times [2020-07-11 02:27:27,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:27,254 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [588852586] [2020-07-11 02:27:27,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:27,428 INFO L280 TraceCheckUtils]: 0: Hoare triple {634#(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; {620#true} is VALID [2020-07-11 02:27:27,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {620#true} #valid := #valid[0 := 0]; {620#true} is VALID [2020-07-11 02:27:27,429 INFO L280 TraceCheckUtils]: 2: Hoare triple {620#true} assume 0 < #StackHeapBarrier; {620#true} is VALID [2020-07-11 02:27:27,430 INFO L280 TraceCheckUtils]: 3: Hoare triple {620#true} ~N~0 := 0; {620#true} is VALID [2020-07-11 02:27:27,430 INFO L280 TraceCheckUtils]: 4: Hoare triple {620#true} assume true; {620#true} is VALID [2020-07-11 02:27:27,430 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {620#true} {620#true} #134#return; {620#true} is VALID [2020-07-11 02:27:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:27,442 INFO L280 TraceCheckUtils]: 0: Hoare triple {620#true} ~cond := #in~cond; {620#true} is VALID [2020-07-11 02:27:27,443 INFO L280 TraceCheckUtils]: 1: Hoare triple {620#true} assume !(0 == ~cond); {620#true} is VALID [2020-07-11 02:27:27,443 INFO L280 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2020-07-11 02:27:27,445 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {620#true} {628#(<= 1 ~N~0)} #130#return; {628#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:27,446 INFO L263 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {634#(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:27:27,446 INFO L280 TraceCheckUtils]: 1: Hoare triple {634#(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; {620#true} is VALID [2020-07-11 02:27:27,447 INFO L280 TraceCheckUtils]: 2: Hoare triple {620#true} #valid := #valid[0 := 0]; {620#true} is VALID [2020-07-11 02:27:27,447 INFO L280 TraceCheckUtils]: 3: Hoare triple {620#true} assume 0 < #StackHeapBarrier; {620#true} is VALID [2020-07-11 02:27:27,447 INFO L280 TraceCheckUtils]: 4: Hoare triple {620#true} ~N~0 := 0; {620#true} is VALID [2020-07-11 02:27:27,447 INFO L280 TraceCheckUtils]: 5: Hoare triple {620#true} assume true; {620#true} is VALID [2020-07-11 02:27:27,448 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {620#true} {620#true} #134#return; {620#true} is VALID [2020-07-11 02:27:27,448 INFO L263 TraceCheckUtils]: 7: Hoare triple {620#true} call #t~ret13 := main(); {620#true} is VALID [2020-07-11 02:27:27,449 INFO L280 TraceCheckUtils]: 8: Hoare triple {620#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {620#true} is VALID [2020-07-11 02:27:27,449 INFO L280 TraceCheckUtils]: 9: Hoare triple {620#true} ~N~0 := #t~nondet0; {620#true} is VALID [2020-07-11 02:27:27,449 INFO L280 TraceCheckUtils]: 10: Hoare triple {620#true} havoc #t~nondet0; {620#true} is VALID [2020-07-11 02:27:27,451 INFO L280 TraceCheckUtils]: 11: Hoare triple {620#true} assume !(~N~0 <= 0); {628#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:27,451 INFO L263 TraceCheckUtils]: 12: Hoare triple {628#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {620#true} is VALID [2020-07-11 02:27:27,452 INFO L280 TraceCheckUtils]: 13: Hoare triple {620#true} ~cond := #in~cond; {620#true} is VALID [2020-07-11 02:27:27,452 INFO L280 TraceCheckUtils]: 14: Hoare triple {620#true} assume !(0 == ~cond); {620#true} is VALID [2020-07-11 02:27:27,452 INFO L280 TraceCheckUtils]: 15: Hoare triple {620#true} assume true; {620#true} is VALID [2020-07-11 02:27:27,453 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {620#true} {628#(<= 1 ~N~0)} #130#return; {628#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:27,455 INFO L280 TraceCheckUtils]: 17: Hoare triple {628#(<= 1 ~N~0)} havoc ~i~0; {628#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:27,456 INFO L280 TraceCheckUtils]: 18: Hoare triple {628#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {628#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:27,457 INFO L280 TraceCheckUtils]: 19: Hoare triple {628#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {628#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:27,458 INFO L280 TraceCheckUtils]: 20: Hoare triple {628#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {628#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:27,459 INFO L280 TraceCheckUtils]: 21: Hoare triple {628#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {628#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:27,460 INFO L280 TraceCheckUtils]: 22: Hoare triple {628#(<= 1 ~N~0)} ~i~0 := 0; {633#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-11 02:27:27,461 INFO L280 TraceCheckUtils]: 23: Hoare triple {633#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {621#false} is VALID [2020-07-11 02:27:27,461 INFO L280 TraceCheckUtils]: 24: Hoare triple {621#false} ~i~0 := 0; {621#false} is VALID [2020-07-11 02:27:27,462 INFO L280 TraceCheckUtils]: 25: Hoare triple {621#false} assume !(~i~0 < ~N~0); {621#false} is VALID [2020-07-11 02:27:27,462 INFO L280 TraceCheckUtils]: 26: Hoare triple {621#false} ~i~0 := 0; {621#false} is VALID [2020-07-11 02:27:27,462 INFO L280 TraceCheckUtils]: 27: Hoare triple {621#false} assume !(~i~0 < ~N~0); {621#false} is VALID [2020-07-11 02:27:27,463 INFO L280 TraceCheckUtils]: 28: Hoare triple {621#false} ~i~0 := 0; {621#false} is VALID [2020-07-11 02:27:27,463 INFO L280 TraceCheckUtils]: 29: Hoare triple {621#false} assume !(~i~0 < ~N~0); {621#false} is VALID [2020-07-11 02:27:27,463 INFO L280 TraceCheckUtils]: 30: Hoare triple {621#false} SUMMARY for call #t~mem12 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L44-6 {621#false} is VALID [2020-07-11 02:27:27,464 INFO L263 TraceCheckUtils]: 31: Hoare triple {621#false} call __VERIFIER_assert((if #t~mem12 == ~N~0 * (2 + ~N~0) then 1 else 0)); {621#false} is VALID [2020-07-11 02:27:27,464 INFO L280 TraceCheckUtils]: 32: Hoare triple {621#false} ~cond := #in~cond; {621#false} is VALID [2020-07-11 02:27:27,464 INFO L280 TraceCheckUtils]: 33: Hoare triple {621#false} assume 0 == ~cond; {621#false} is VALID [2020-07-11 02:27:27,465 INFO L280 TraceCheckUtils]: 34: Hoare triple {621#false} assume !false; {621#false} is VALID [2020-07-11 02:27:27,467 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:27:27,468 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [588852586] [2020-07-11 02:27:27,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:27:27,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:27:27,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180006708] [2020-07-11 02:27:27,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-11 02:27:27,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:27,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:27:27,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:27,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:27:27,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:27,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:27:27,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:27:27,522 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 5 states. [2020-07-11 02:27:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:28,286 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2020-07-11 02:27:28,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:27:28,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2020-07-11 02:27:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:27:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2020-07-11 02:27:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:27:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2020-07-11 02:27:28,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 137 transitions. [2020-07-11 02:27:28,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:28,485 INFO L225 Difference]: With dead ends: 128 [2020-07-11 02:27:28,485 INFO L226 Difference]: Without dead ends: 92 [2020-07-11 02:27:28,487 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:27:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-11 02:27:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 68. [2020-07-11 02:27:28,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:28,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 68 states. [2020-07-11 02:27:28,611 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 68 states. [2020-07-11 02:27:28,612 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 68 states. [2020-07-11 02:27:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:28,617 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2020-07-11 02:27:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2020-07-11 02:27:28,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:28,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:28,618 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 92 states. [2020-07-11 02:27:28,619 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 92 states. [2020-07-11 02:27:28,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:28,624 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2020-07-11 02:27:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2020-07-11 02:27:28,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:28,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:28,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:28,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:28,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-11 02:27:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2020-07-11 02:27:28,630 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 35 [2020-07-11 02:27:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:28,630 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2020-07-11 02:27:28,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:27:28,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 71 transitions. [2020-07-11 02:27:28,725 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-07-11 02:27:28,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-11 02:27:28,729 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:28,729 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, 1, 1] [2020-07-11 02:27:28,730 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:27:28,731 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:28,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:28,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1152052174, now seen corresponding path program 1 times [2020-07-11 02:27:28,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:28,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [424603919] [2020-07-11 02:27:28,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:28,780 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-11 02:27:28,781 WARN L168 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2020-07-11 02:27:28,781 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 02:27:28,788 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:27:28,810 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 02:27:28,810 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:27:28,810 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:27:28,810 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:27:28,810 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 02:27:28,811 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-11 02:27:28,811 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:27:28,811 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:27:28,811 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:27:28,811 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-11 02:27:28,811 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-11 02:27:28,811 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-11 02:27:28,811 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 02:27:28,812 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 02:27:28,812 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 02:27:28,812 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 02:27:28,812 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-11 02:27:28,812 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-11 02:27:28,812 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-11 02:27:28,813 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-11 02:27:28,813 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-11 02:27:28,813 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-11 02:27:28,813 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-11 02:27:28,813 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-11 02:27:28,813 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 02:27:28,813 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 02:27:28,814 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 02:27:28,814 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 02:27:28,814 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-11 02:27:28,814 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-11 02:27:28,814 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 02:27:28,814 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 02:27:28,814 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-11 02:27:28,814 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 02:27:28,815 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-11 02:27:28,815 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 02:27:28,815 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-11 02:27:28,815 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-11 02:27:28,815 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 02:27:28,815 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-11 02:27:28,816 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-11 02:27:28,816 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-11 02:27:28,816 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-11 02:27:28,816 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-11 02:27:28,816 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-11 02:27:28,816 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-11 02:27:28,816 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-11 02:27:28,816 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-11 02:27:28,817 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-11 02:27:28,817 WARN L170 areAnnotationChecker]: L34-5 has no Hoare annotation [2020-07-11 02:27:28,817 WARN L170 areAnnotationChecker]: L34-5 has no Hoare annotation [2020-07-11 02:27:28,817 WARN L170 areAnnotationChecker]: L34-5 has no Hoare annotation [2020-07-11 02:27:28,817 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-11 02:27:28,817 WARN L170 areAnnotationChecker]: L34-6 has no Hoare annotation [2020-07-11 02:27:28,817 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-11 02:27:28,817 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-11 02:27:28,817 WARN L170 areAnnotationChecker]: L39-5 has no Hoare annotation [2020-07-11 02:27:28,818 WARN L170 areAnnotationChecker]: L39-5 has no Hoare annotation [2020-07-11 02:27:28,818 WARN L170 areAnnotationChecker]: L39-5 has no Hoare annotation [2020-07-11 02:27:28,818 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2020-07-11 02:27:28,818 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-11 02:27:28,818 WARN L170 areAnnotationChecker]: L39-6 has no Hoare annotation [2020-07-11 02:27:28,818 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-11 02:27:28,818 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-11 02:27:28,818 WARN L170 areAnnotationChecker]: L44-5 has no Hoare annotation [2020-07-11 02:27:28,819 WARN L170 areAnnotationChecker]: L44-5 has no Hoare annotation [2020-07-11 02:27:28,819 WARN L170 areAnnotationChecker]: L44-5 has no Hoare annotation [2020-07-11 02:27:28,819 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-11 02:27:28,819 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2020-07-11 02:27:28,819 WARN L170 areAnnotationChecker]: L44-6 has no Hoare annotation [2020-07-11 02:27:28,819 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-11 02:27:28,819 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-11 02:27:28,819 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2020-07-11 02:27:28,820 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-11 02:27:28,820 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-11 02:27:28,820 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-11 02:27:28,820 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-11 02:27:28,820 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2020-07-11 02:27:28,820 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-11 02:27:28,821 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2020-07-11 02:27:28,821 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2020-07-11 02:27:28,821 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-11 02:27:28,821 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2020-07-11 02:27:28,821 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2020-07-11 02:27:28,821 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-11 02:27:28,821 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2020-07-11 02:27:28,822 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2020-07-11 02:27:28,822 WARN L170 areAnnotationChecker]: L39-4 has no Hoare annotation [2020-07-11 02:27:28,822 WARN L170 areAnnotationChecker]: L44-3 has no Hoare annotation [2020-07-11 02:27:28,822 WARN L170 areAnnotationChecker]: L44-4 has no Hoare annotation [2020-07-11 02:27:28,822 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:27:28,827 WARN L231 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-07-11 02:27:28,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:27:28 BoogieIcfgContainer [2020-07-11 02:27:28,828 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:27:28,832 INFO L168 Benchmark]: Toolchain (without parser) took 4700.39 ms. Allocated memory was 140.5 MB in the beginning and 257.9 MB in the end (delta: 117.4 MB). Free memory was 98.6 MB in the beginning and 98.7 MB in the end (delta: -104.2 kB). Peak memory consumption was 117.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:28,833 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 140.5 MB. Free memory is still 116.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-11 02:27:28,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 476.31 ms. Allocated memory was 140.5 MB in the beginning and 198.2 MB in the end (delta: 57.7 MB). Free memory was 98.1 MB in the beginning and 176.8 MB in the end (delta: -78.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:28,835 INFO L168 Benchmark]: Boogie Preprocessor took 59.85 ms. Allocated memory is still 198.2 MB. Free memory was 176.8 MB in the beginning and 174.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:28,836 INFO L168 Benchmark]: RCFGBuilder took 671.89 ms. Allocated memory is still 198.2 MB. Free memory was 174.3 MB in the beginning and 142.1 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:28,837 INFO L168 Benchmark]: TraceAbstraction took 3481.93 ms. Allocated memory was 198.2 MB in the beginning and 257.9 MB in the end (delta: 59.8 MB). Free memory was 142.1 MB in the beginning and 98.7 MB in the end (delta: 43.5 MB). Peak memory consumption was 103.2 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:28,844 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.39 ms. Allocated memory is still 140.5 MB. Free memory is still 116.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 476.31 ms. Allocated memory was 140.5 MB in the beginning and 198.2 MB in the end (delta: 57.7 MB). Free memory was 98.1 MB in the beginning and 176.8 MB in the end (delta: -78.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.85 ms. Allocated memory is still 198.2 MB. Free memory was 176.8 MB in the beginning and 174.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 671.89 ms. Allocated memory is still 198.2 MB. Free memory was 174.3 MB in the beginning and 142.1 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3481.93 ms. Allocated memory was 198.2 MB in the beginning and 257.9 MB in the end (delta: 59.8 MB). Free memory was 142.1 MB in the beginning and 98.7 MB in the end (delta: 43.5 MB). Peak memory consumption was 103.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 13]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L17] int N; [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) [L11] COND FALSE !(!cond) [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) [L25] int i; [L26] long long sum[1]; [L27] long long *a = malloc(sizeof(long long)*N); [L29] sum[0] = 0 [L30] i=0 [L30] COND TRUE i