/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/ss4f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 06:33:45,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 06:33:45,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 06:33:45,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 06:33:45,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 06:33:45,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 06:33:45,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 06:33:45,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 06:33:45,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 06:33:45,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 06:33:45,995 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 06:33:45,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 06:33:45,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 06:33:45,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 06:33:45,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 06:33:46,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 06:33:46,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 06:33:46,003 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 06:33:46,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 06:33:46,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 06:33:46,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 06:33:46,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 06:33:46,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 06:33:46,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 06:33:46,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 06:33:46,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 06:33:46,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 06:33:46,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 06:33:46,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 06:33:46,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 06:33:46,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 06:33:46,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 06:33:46,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 06:33:46,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 06:33:46,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 06:33:46,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 06:33:46,022 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 06:33:46,022 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 06:33:46,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 06:33:46,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 06:33:46,024 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 06:33:46,025 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 06:33:46,040 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 06:33:46,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 06:33:46,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 06:33:46,042 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 06:33:46,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 06:33:46,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 06:33:46,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 06:33:46,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 06:33:46,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 06:33:46,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 06:33:46,043 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 06:33:46,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 06:33:46,043 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 06:33:46,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 06:33:46,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 06:33:46,044 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 06:33:46,044 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 06:33:46,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 06:33:46,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 06:33:46,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 06:33:46,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 06:33:46,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 06:33:46,045 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-18 06:33:46,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 06:33:46,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 06:33:46,347 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 06:33:46,349 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 06:33:46,350 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 06:33:46,352 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ss4f.c [2020-07-18 06:33:46,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126c40a6d/d3f32f24a08248f29aee127b3f4dda03/FLAG256b32360 [2020-07-18 06:33:46,923 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 06:33:46,924 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ss4f.c [2020-07-18 06:33:46,932 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126c40a6d/d3f32f24a08248f29aee127b3f4dda03/FLAG256b32360 [2020-07-18 06:33:47,266 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/126c40a6d/d3f32f24a08248f29aee127b3f4dda03 [2020-07-18 06:33:47,280 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 06:33:47,284 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 06:33:47,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 06:33:47,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 06:33:47,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 06:33:47,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:33:47" (1/1) ... [2020-07-18 06:33:47,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3111fca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:33:47, skipping insertion in model container [2020-07-18 06:33:47,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:33:47" (1/1) ... [2020-07-18 06:33:47,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 06:33:47,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 06:33:47,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:33:47,556 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 06:33:47,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:33:47,613 INFO L208 MainTranslator]: Completed translation [2020-07-18 06:33:47,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:33:47 WrapperNode [2020-07-18 06:33:47,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 06:33:47,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 06:33:47,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 06:33:47,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 06:33:47,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:33:47" (1/1) ... [2020-07-18 06:33:47,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:33:47" (1/1) ... [2020-07-18 06:33:47,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:33:47" (1/1) ... [2020-07-18 06:33:47,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:33:47" (1/1) ... [2020-07-18 06:33:47,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:33:47" (1/1) ... [2020-07-18 06:33:47,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:33:47" (1/1) ... [2020-07-18 06:33:47,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:33:47" (1/1) ... [2020-07-18 06:33:47,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 06:33:47,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 06:33:47,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 06:33:47,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 06:33:47,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:33:47" (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-18 06:33:47,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 06:33:47,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 06:33:47,840 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 06:33:47,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 06:33:47,840 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 06:33:47,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 06:33:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 06:33:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 06:33:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 06:33:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 06:33:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 06:33:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 06:33:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 06:33:47,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 06:33:47,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 06:33:47,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 06:33:47,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 06:33:47,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 06:33:47,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 06:33:48,574 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 06:33:48,574 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-18 06:33:48,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:33:48 BoogieIcfgContainer [2020-07-18 06:33:48,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 06:33:48,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 06:33:48,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 06:33:48,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 06:33:48,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 06:33:47" (1/3) ... [2020-07-18 06:33:48,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b29528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:33:48, skipping insertion in model container [2020-07-18 06:33:48,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:33:47" (2/3) ... [2020-07-18 06:33:48,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b29528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:33:48, skipping insertion in model container [2020-07-18 06:33:48,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:33:48" (3/3) ... [2020-07-18 06:33:48,592 INFO L109 eAbstractionObserver]: Analyzing ICFG ss4f.c [2020-07-18 06:33:48,606 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 06:33:48,617 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 06:33:48,636 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 06:33:48,666 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 06:33:48,667 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 06:33:48,667 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 06:33:48,668 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 06:33:48,668 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 06:33:48,668 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 06:33:48,669 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 06:33:48,669 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 06:33:48,689 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2020-07-18 06:33:48,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-18 06:33:48,705 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:33:48,707 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] [2020-07-18 06:33:48,707 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:33:48,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:33:48,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1254588623, now seen corresponding path program 1 times [2020-07-18 06:33:48,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:33:48,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [363374731] [2020-07-18 06:33:48,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:33:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:33:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:33:49,040 INFO L280 TraceCheckUtils]: 0: Hoare triple {92#(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; {80#true} is VALID [2020-07-18 06:33:49,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {80#true} #valid := #valid[0 := 0]; {80#true} is VALID [2020-07-18 06:33:49,041 INFO L280 TraceCheckUtils]: 2: Hoare triple {80#true} assume 0 < #StackHeapBarrier; {80#true} is VALID [2020-07-18 06:33:49,041 INFO L280 TraceCheckUtils]: 3: Hoare triple {80#true} ~N~0 := 0; {80#true} is VALID [2020-07-18 06:33:49,042 INFO L280 TraceCheckUtils]: 4: Hoare triple {80#true} assume true; {80#true} is VALID [2020-07-18 06:33:49,042 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {80#true} {80#true} #135#return; {80#true} is VALID [2020-07-18 06:33:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:33:49,055 INFO L280 TraceCheckUtils]: 0: Hoare triple {80#true} ~cond := #in~cond; {80#true} is VALID [2020-07-18 06:33:49,056 INFO L280 TraceCheckUtils]: 1: Hoare triple {80#true} assume !(0 == ~cond); {80#true} is VALID [2020-07-18 06:33:49,057 INFO L280 TraceCheckUtils]: 2: Hoare triple {80#true} assume true; {80#true} is VALID [2020-07-18 06:33:49,057 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {80#true} {80#true} #131#return; {80#true} is VALID [2020-07-18 06:33:49,060 INFO L263 TraceCheckUtils]: 0: Hoare triple {80#true} call ULTIMATE.init(); {92#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:33:49,061 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#(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; {80#true} is VALID [2020-07-18 06:33:49,061 INFO L280 TraceCheckUtils]: 2: Hoare triple {80#true} #valid := #valid[0 := 0]; {80#true} is VALID [2020-07-18 06:33:49,062 INFO L280 TraceCheckUtils]: 3: Hoare triple {80#true} assume 0 < #StackHeapBarrier; {80#true} is VALID [2020-07-18 06:33:49,062 INFO L280 TraceCheckUtils]: 4: Hoare triple {80#true} ~N~0 := 0; {80#true} is VALID [2020-07-18 06:33:49,062 INFO L280 TraceCheckUtils]: 5: Hoare triple {80#true} assume true; {80#true} is VALID [2020-07-18 06:33:49,063 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {80#true} {80#true} #135#return; {80#true} is VALID [2020-07-18 06:33:49,063 INFO L263 TraceCheckUtils]: 7: Hoare triple {80#true} call #t~ret13 := main(); {80#true} is VALID [2020-07-18 06:33:49,064 INFO L280 TraceCheckUtils]: 8: Hoare triple {80#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {80#true} is VALID [2020-07-18 06:33:49,064 INFO L280 TraceCheckUtils]: 9: Hoare triple {80#true} ~N~0 := #t~nondet0; {80#true} is VALID [2020-07-18 06:33:49,065 INFO L280 TraceCheckUtils]: 10: Hoare triple {80#true} havoc #t~nondet0; {80#true} is VALID [2020-07-18 06:33:49,065 INFO L280 TraceCheckUtils]: 11: Hoare triple {80#true} assume !(~N~0 <= 0); {80#true} is VALID [2020-07-18 06:33:49,066 INFO L263 TraceCheckUtils]: 12: Hoare triple {80#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {80#true} is VALID [2020-07-18 06:33:49,066 INFO L280 TraceCheckUtils]: 13: Hoare triple {80#true} ~cond := #in~cond; {80#true} is VALID [2020-07-18 06:33:49,066 INFO L280 TraceCheckUtils]: 14: Hoare triple {80#true} assume !(0 == ~cond); {80#true} is VALID [2020-07-18 06:33:49,067 INFO L280 TraceCheckUtils]: 15: Hoare triple {80#true} assume true; {80#true} is VALID [2020-07-18 06:33:49,067 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {80#true} {80#true} #131#return; {80#true} is VALID [2020-07-18 06:33:49,068 INFO L280 TraceCheckUtils]: 17: Hoare triple {80#true} havoc ~i~0; {80#true} is VALID [2020-07-18 06:33:49,068 INFO L280 TraceCheckUtils]: 18: Hoare triple {80#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {80#true} is VALID [2020-07-18 06:33:49,069 INFO L280 TraceCheckUtils]: 19: Hoare triple {80#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {80#true} is VALID [2020-07-18 06:33:49,069 INFO L280 TraceCheckUtils]: 20: Hoare triple {80#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {80#true} is VALID [2020-07-18 06:33:49,070 INFO L280 TraceCheckUtils]: 21: Hoare triple {80#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {80#true} is VALID [2020-07-18 06:33:49,070 INFO L280 TraceCheckUtils]: 22: Hoare triple {80#true} ~i~0 := 0; {80#true} is VALID [2020-07-18 06:33:49,071 INFO L280 TraceCheckUtils]: 23: Hoare triple {80#true} assume !true; {81#false} is VALID [2020-07-18 06:33:49,072 INFO L280 TraceCheckUtils]: 24: Hoare triple {81#false} ~i~0 := 0; {81#false} is VALID [2020-07-18 06:33:49,072 INFO L280 TraceCheckUtils]: 25: Hoare triple {81#false} assume !true; {81#false} is VALID [2020-07-18 06:33:49,073 INFO L280 TraceCheckUtils]: 26: Hoare triple {81#false} ~i~0 := 0; {81#false} is VALID [2020-07-18 06:33:49,073 INFO L280 TraceCheckUtils]: 27: Hoare triple {81#false} assume !true; {81#false} is VALID [2020-07-18 06:33:49,074 INFO L280 TraceCheckUtils]: 28: Hoare triple {81#false} SUMMARY for call write~int(~N~0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L40-6 {81#false} is VALID [2020-07-18 06:33:49,074 INFO L280 TraceCheckUtils]: 29: Hoare triple {81#false} ~i~0 := 0; {81#false} is VALID [2020-07-18 06:33:49,075 INFO L280 TraceCheckUtils]: 30: Hoare triple {81#false} assume !true; {81#false} is VALID [2020-07-18 06:33:49,075 INFO L280 TraceCheckUtils]: 31: Hoare triple {81#false} SUMMARY for call #t~mem12 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L46-6 {81#false} is VALID [2020-07-18 06:33:49,076 INFO L263 TraceCheckUtils]: 32: Hoare triple {81#false} call __VERIFIER_assert((if #t~mem12 == ~N~0 * (1 + ~N~0) then 1 else 0)); {81#false} is VALID [2020-07-18 06:33:49,076 INFO L280 TraceCheckUtils]: 33: Hoare triple {81#false} ~cond := #in~cond; {81#false} is VALID [2020-07-18 06:33:49,076 INFO L280 TraceCheckUtils]: 34: Hoare triple {81#false} assume 0 == ~cond; {81#false} is VALID [2020-07-18 06:33:49,077 INFO L280 TraceCheckUtils]: 35: Hoare triple {81#false} assume !false; {81#false} is VALID [2020-07-18 06:33:49,083 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-18 06:33:49,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [363374731] [2020-07-18 06:33:49,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:33:49,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 06:33:49,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700863988] [2020-07-18 06:33:49,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-07-18 06:33:49,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:33:49,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 06:33:49,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:33:49,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 06:33:49,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:33:49,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 06:33:49,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 06:33:49,206 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 3 states. [2020-07-18 06:33:49,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:33:49,829 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2020-07-18 06:33:49,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 06:33:49,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-07-18 06:33:49,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:33:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:33:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-18 06:33:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:33:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2020-07-18 06:33:49,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2020-07-18 06:33:50,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:33:50,161 INFO L225 Difference]: With dead ends: 137 [2020-07-18 06:33:50,162 INFO L226 Difference]: Without dead ends: 65 [2020-07-18 06:33:50,172 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-18 06:33:50,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-18 06:33:50,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-07-18 06:33:50,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:33:50,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2020-07-18 06:33:50,281 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2020-07-18 06:33:50,281 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2020-07-18 06:33:50,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:33:50,289 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2020-07-18 06:33:50,289 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-07-18 06:33:50,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:33:50,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:33:50,291 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2020-07-18 06:33:50,291 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2020-07-18 06:33:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:33:50,298 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2020-07-18 06:33:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-07-18 06:33:50,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:33:50,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:33:50,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:33:50,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:33:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-18 06:33:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2020-07-18 06:33:50,307 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 36 [2020-07-18 06:33:50,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:33:50,308 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2020-07-18 06:33:50,308 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 06:33:50,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states and 68 transitions. [2020-07-18 06:33:50,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:33:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-07-18 06:33:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-18 06:33:50,407 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:33:50,408 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] [2020-07-18 06:33:50,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 06:33:50,409 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:33:50,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:33:50,409 INFO L82 PathProgramCache]: Analyzing trace with hash 626494907, now seen corresponding path program 1 times [2020-07-18 06:33:50,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:33:50,410 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [589041559] [2020-07-18 06:33:50,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:33:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:33:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:33:50,585 INFO L280 TraceCheckUtils]: 0: Hoare triple {643#(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; {629#true} is VALID [2020-07-18 06:33:50,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {629#true} #valid := #valid[0 := 0]; {629#true} is VALID [2020-07-18 06:33:50,587 INFO L280 TraceCheckUtils]: 2: Hoare triple {629#true} assume 0 < #StackHeapBarrier; {629#true} is VALID [2020-07-18 06:33:50,587 INFO L280 TraceCheckUtils]: 3: Hoare triple {629#true} ~N~0 := 0; {629#true} is VALID [2020-07-18 06:33:50,588 INFO L280 TraceCheckUtils]: 4: Hoare triple {629#true} assume true; {629#true} is VALID [2020-07-18 06:33:50,588 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {629#true} {629#true} #135#return; {629#true} is VALID [2020-07-18 06:33:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:33:50,617 INFO L280 TraceCheckUtils]: 0: Hoare triple {629#true} ~cond := #in~cond; {629#true} is VALID [2020-07-18 06:33:50,617 INFO L280 TraceCheckUtils]: 1: Hoare triple {629#true} assume !(0 == ~cond); {629#true} is VALID [2020-07-18 06:33:50,618 INFO L280 TraceCheckUtils]: 2: Hoare triple {629#true} assume true; {629#true} is VALID [2020-07-18 06:33:50,619 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {629#true} {637#(<= 1 ~N~0)} #131#return; {637#(<= 1 ~N~0)} is VALID [2020-07-18 06:33:50,621 INFO L263 TraceCheckUtils]: 0: Hoare triple {629#true} call ULTIMATE.init(); {643#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:33:50,622 INFO L280 TraceCheckUtils]: 1: Hoare triple {643#(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; {629#true} is VALID [2020-07-18 06:33:50,622 INFO L280 TraceCheckUtils]: 2: Hoare triple {629#true} #valid := #valid[0 := 0]; {629#true} is VALID [2020-07-18 06:33:50,623 INFO L280 TraceCheckUtils]: 3: Hoare triple {629#true} assume 0 < #StackHeapBarrier; {629#true} is VALID [2020-07-18 06:33:50,623 INFO L280 TraceCheckUtils]: 4: Hoare triple {629#true} ~N~0 := 0; {629#true} is VALID [2020-07-18 06:33:50,624 INFO L280 TraceCheckUtils]: 5: Hoare triple {629#true} assume true; {629#true} is VALID [2020-07-18 06:33:50,624 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {629#true} {629#true} #135#return; {629#true} is VALID [2020-07-18 06:33:50,624 INFO L263 TraceCheckUtils]: 7: Hoare triple {629#true} call #t~ret13 := main(); {629#true} is VALID [2020-07-18 06:33:50,625 INFO L280 TraceCheckUtils]: 8: Hoare triple {629#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {629#true} is VALID [2020-07-18 06:33:50,628 INFO L280 TraceCheckUtils]: 9: Hoare triple {629#true} ~N~0 := #t~nondet0; {629#true} is VALID [2020-07-18 06:33:50,628 INFO L280 TraceCheckUtils]: 10: Hoare triple {629#true} havoc #t~nondet0; {629#true} is VALID [2020-07-18 06:33:50,632 INFO L280 TraceCheckUtils]: 11: Hoare triple {629#true} assume !(~N~0 <= 0); {637#(<= 1 ~N~0)} is VALID [2020-07-18 06:33:50,632 INFO L263 TraceCheckUtils]: 12: Hoare triple {637#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {629#true} is VALID [2020-07-18 06:33:50,633 INFO L280 TraceCheckUtils]: 13: Hoare triple {629#true} ~cond := #in~cond; {629#true} is VALID [2020-07-18 06:33:50,633 INFO L280 TraceCheckUtils]: 14: Hoare triple {629#true} assume !(0 == ~cond); {629#true} is VALID [2020-07-18 06:33:50,633 INFO L280 TraceCheckUtils]: 15: Hoare triple {629#true} assume true; {629#true} is VALID [2020-07-18 06:33:50,637 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {629#true} {637#(<= 1 ~N~0)} #131#return; {637#(<= 1 ~N~0)} is VALID [2020-07-18 06:33:50,639 INFO L280 TraceCheckUtils]: 17: Hoare triple {637#(<= 1 ~N~0)} havoc ~i~0; {637#(<= 1 ~N~0)} is VALID [2020-07-18 06:33:50,640 INFO L280 TraceCheckUtils]: 18: Hoare triple {637#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {637#(<= 1 ~N~0)} is VALID [2020-07-18 06:33:50,641 INFO L280 TraceCheckUtils]: 19: Hoare triple {637#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {637#(<= 1 ~N~0)} is VALID [2020-07-18 06:33:50,647 INFO L280 TraceCheckUtils]: 20: Hoare triple {637#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {637#(<= 1 ~N~0)} is VALID [2020-07-18 06:33:50,648 INFO L280 TraceCheckUtils]: 21: Hoare triple {637#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {637#(<= 1 ~N~0)} is VALID [2020-07-18 06:33:50,649 INFO L280 TraceCheckUtils]: 22: Hoare triple {637#(<= 1 ~N~0)} ~i~0 := 0; {642#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-18 06:33:50,651 INFO L280 TraceCheckUtils]: 23: Hoare triple {642#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {630#false} is VALID [2020-07-18 06:33:50,651 INFO L280 TraceCheckUtils]: 24: Hoare triple {630#false} ~i~0 := 0; {630#false} is VALID [2020-07-18 06:33:50,652 INFO L280 TraceCheckUtils]: 25: Hoare triple {630#false} assume !(~i~0 < ~N~0); {630#false} is VALID [2020-07-18 06:33:50,652 INFO L280 TraceCheckUtils]: 26: Hoare triple {630#false} ~i~0 := 0; {630#false} is VALID [2020-07-18 06:33:50,652 INFO L280 TraceCheckUtils]: 27: Hoare triple {630#false} assume !(~i~0 < ~N~0); {630#false} is VALID [2020-07-18 06:33:50,652 INFO L280 TraceCheckUtils]: 28: Hoare triple {630#false} SUMMARY for call write~int(~N~0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L40-6 {630#false} is VALID [2020-07-18 06:33:50,653 INFO L280 TraceCheckUtils]: 29: Hoare triple {630#false} ~i~0 := 0; {630#false} is VALID [2020-07-18 06:33:50,653 INFO L280 TraceCheckUtils]: 30: Hoare triple {630#false} assume !(~i~0 < ~N~0); {630#false} is VALID [2020-07-18 06:33:50,653 INFO L280 TraceCheckUtils]: 31: Hoare triple {630#false} SUMMARY for call #t~mem12 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L46-6 {630#false} is VALID [2020-07-18 06:33:50,654 INFO L263 TraceCheckUtils]: 32: Hoare triple {630#false} call __VERIFIER_assert((if #t~mem12 == ~N~0 * (1 + ~N~0) then 1 else 0)); {630#false} is VALID [2020-07-18 06:33:50,654 INFO L280 TraceCheckUtils]: 33: Hoare triple {630#false} ~cond := #in~cond; {630#false} is VALID [2020-07-18 06:33:50,654 INFO L280 TraceCheckUtils]: 34: Hoare triple {630#false} assume 0 == ~cond; {630#false} is VALID [2020-07-18 06:33:50,655 INFO L280 TraceCheckUtils]: 35: Hoare triple {630#false} assume !false; {630#false} is VALID [2020-07-18 06:33:50,658 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-18 06:33:50,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [589041559] [2020-07-18 06:33:50,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:33:50,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 06:33:50,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205974585] [2020-07-18 06:33:50,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-07-18 06:33:50,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:33:50,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 06:33:50,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:33:50,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 06:33:50,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:33:50,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 06:33:50,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 06:33:50,712 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 5 states. [2020-07-18 06:33:51,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:33:51,476 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2020-07-18 06:33:51,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 06:33:51,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-07-18 06:33:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:33:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:33:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2020-07-18 06:33:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:33:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2020-07-18 06:33:51,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 139 transitions. [2020-07-18 06:33:51,668 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:33:51,672 INFO L225 Difference]: With dead ends: 130 [2020-07-18 06:33:51,673 INFO L226 Difference]: Without dead ends: 93 [2020-07-18 06:33:51,674 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-18 06:33:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-07-18 06:33:51,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 69. [2020-07-18 06:33:51,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:33:51,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 69 states. [2020-07-18 06:33:51,806 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 69 states. [2020-07-18 06:33:51,806 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 69 states. [2020-07-18 06:33:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:33:51,812 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2020-07-18 06:33:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2020-07-18 06:33:51,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:33:51,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:33:51,814 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 93 states. [2020-07-18 06:33:51,814 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 93 states. [2020-07-18 06:33:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:33:51,820 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2020-07-18 06:33:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2020-07-18 06:33:51,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:33:51,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:33:51,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:33:51,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:33:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-18 06:33:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2020-07-18 06:33:51,826 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 36 [2020-07-18 06:33:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:33:51,826 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2020-07-18 06:33:51,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 06:33:51,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 69 states and 72 transitions. [2020-07-18 06:33:51,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:33:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-07-18 06:33:51,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-18 06:33:51,932 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:33:51,932 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, 1] [2020-07-18 06:33:51,933 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 06:33:51,933 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:33:51,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:33:51,933 INFO L82 PathProgramCache]: Analyzing trace with hash 290043744, now seen corresponding path program 1 times [2020-07-18 06:33:51,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:33:51,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [358136061] [2020-07-18 06:33:51,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:33:51,996 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-18 06:33:51,997 WARN L168 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2020-07-18 06:33:51,997 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 06:33:52,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 06:33:52,021 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-18 06:33:52,022 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 06:33:52,022 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 06:33:52,022 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 06:33:52,022 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 06:33:52,022 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-18 06:33:52,022 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:33:52,022 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:33:52,022 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:33:52,022 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-18 06:33:52,022 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-18 06:33:52,023 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-18 06:33:52,023 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 06:33:52,023 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 06:33:52,023 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-18 06:33:52,023 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 06:33:52,023 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-18 06:33:52,024 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-18 06:33:52,024 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-18 06:33:52,024 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-18 06:33:52,024 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-18 06:33:52,025 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-18 06:33:52,025 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-18 06:33:52,025 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-18 06:33:52,025 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-18 06:33:52,026 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-18 06:33:52,026 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-18 06:33:52,026 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 06:33:52,026 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-18 06:33:52,026 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-18 06:33:52,026 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-18 06:33:52,026 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-18 06:33:52,026 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2020-07-18 06:33:52,026 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 06:33:52,026 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-18 06:33:52,027 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-18 06:33:52,027 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-18 06:33:52,027 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-18 06:33:52,027 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 06:33:52,027 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-18 06:33:52,027 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-18 06:33:52,027 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-18 06:33:52,027 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-18 06:33:52,027 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-18 06:33:52,028 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-18 06:33:52,028 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-18 06:33:52,028 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-18 06:33:52,028 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-18 06:33:52,028 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-18 06:33:52,028 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-18 06:33:52,028 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-18 06:33:52,028 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-18 06:33:52,029 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-18 06:33:52,029 WARN L170 areAnnotationChecker]: L35-6 has no Hoare annotation [2020-07-18 06:33:52,029 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-18 06:33:52,029 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-18 06:33:52,029 WARN L170 areAnnotationChecker]: L40-5 has no Hoare annotation [2020-07-18 06:33:52,029 WARN L170 areAnnotationChecker]: L40-5 has no Hoare annotation [2020-07-18 06:33:52,029 WARN L170 areAnnotationChecker]: L40-5 has no Hoare annotation [2020-07-18 06:33:52,029 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-18 06:33:52,030 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-18 06:33:52,030 WARN L170 areAnnotationChecker]: L40-6 has no Hoare annotation [2020-07-18 06:33:52,030 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-18 06:33:52,030 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-18 06:33:52,030 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-18 06:33:52,030 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-18 06:33:52,030 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-18 06:33:52,030 WARN L170 areAnnotationChecker]: L46-5 has no Hoare annotation [2020-07-18 06:33:52,031 WARN L170 areAnnotationChecker]: L46-5 has no Hoare annotation [2020-07-18 06:33:52,031 WARN L170 areAnnotationChecker]: L46-5 has no Hoare annotation [2020-07-18 06:33:52,031 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2020-07-18 06:33:52,031 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-18 06:33:52,031 WARN L170 areAnnotationChecker]: L46-6 has no Hoare annotation [2020-07-18 06:33:52,031 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-18 06:33:52,031 WARN L170 areAnnotationChecker]: L42-3 has no Hoare annotation [2020-07-18 06:33:52,031 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-18 06:33:52,031 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-18 06:33:52,032 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-18 06:33:52,032 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2020-07-18 06:33:52,032 WARN L170 areAnnotationChecker]: L42-4 has no Hoare annotation [2020-07-18 06:33:52,032 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-18 06:33:52,032 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2020-07-18 06:33:52,032 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-18 06:33:52,032 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-18 06:33:52,032 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2020-07-18 06:33:52,033 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-18 06:33:52,033 WARN L170 areAnnotationChecker]: L48-4 has no Hoare annotation [2020-07-18 06:33:52,033 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-18 06:33:52,033 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2020-07-18 06:33:52,033 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2020-07-18 06:33:52,033 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2020-07-18 06:33:52,033 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-18 06:33:52,038 WARN L231 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-07-18 06:33:52,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 06:33:52 BoogieIcfgContainer [2020-07-18 06:33:52,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 06:33:52,042 INFO L168 Benchmark]: Toolchain (without parser) took 4759.55 ms. Allocated memory was 136.8 MB in the beginning and 250.6 MB in the end (delta: 113.8 MB). Free memory was 102.2 MB in the beginning and 216.9 MB in the end (delta: -114.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 06:33:52,043 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 136.8 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 06:33:52,044 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.57 ms. Allocated memory is still 136.8 MB. Free memory was 101.8 MB in the beginning and 90.2 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2020-07-18 06:33:52,045 INFO L168 Benchmark]: Boogie Preprocessor took 146.41 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 90.2 MB in the beginning and 178.9 MB in the end (delta: -88.7 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-18 06:33:52,046 INFO L168 Benchmark]: RCFGBuilder took 819.28 ms. Allocated memory is still 201.9 MB. Free memory was 178.9 MB in the beginning and 145.5 MB in the end (delta: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. [2020-07-18 06:33:52,047 INFO L168 Benchmark]: TraceAbstraction took 3456.89 ms. Allocated memory was 201.9 MB in the beginning and 250.6 MB in the end (delta: 48.8 MB). Free memory was 145.5 MB in the beginning and 216.9 MB in the end (delta: -71.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 06:33:52,051 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.31 ms. Allocated memory is still 136.8 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 328.57 ms. Allocated memory is still 136.8 MB. Free memory was 101.8 MB in the beginning and 90.2 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 146.41 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 90.2 MB in the beginning and 178.9 MB in the end (delta: -88.7 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 819.28 ms. Allocated memory is still 201.9 MB. Free memory was 178.9 MB in the beginning and 145.5 MB in the end (delta: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3456.89 ms. Allocated memory was 201.9 MB in the beginning and 250.6 MB in the end (delta: 48.8 MB). Free memory was 145.5 MB in the beginning and 216.9 MB in the end (delta: -71.5 MB). There was no memory consumed. 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