/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/ss2f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:27:22,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:27:22,297 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:27:22,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:27:22,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:27:22,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:27:22,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:27:22,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:27:22,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:27:22,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:27:22,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:27:22,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:27:22,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:27:22,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:27:22,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:27:22,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:27:22,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:27:22,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:27:22,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:27:22,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:27:22,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:27:22,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:27:22,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:27:22,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:27:22,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:27:22,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:27:22,336 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:27:22,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:27:22,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:27:22,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:27:22,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:27:22,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:27:22,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:27:22,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:27:22,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:27:22,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:27:22,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:27:22,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:27:22,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:27:22,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:27:22,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:27:22,346 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,355 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:27:22,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:27:22,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:27:22,357 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:27:22,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:27:22,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:27:22,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:27:22,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:27:22,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:27:22,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:27:22,358 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:27:22,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:27:22,359 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:27:22,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:27:22,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:27:22,359 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:27:22,359 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:27:22,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:27:22,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:27:22,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:27:22,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:27:22,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:27:22,361 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,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:27:22,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:27:22,648 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:27:22,650 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:27:22,650 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:27:22,651 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ss2f.c [2020-07-11 02:27:22,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/109954763/1c1d96a1de3a4f6aa1ee0ea9098a4af8/FLAGdc21b8487 [2020-07-11 02:27:23,211 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:27:23,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ss2f.c [2020-07-11 02:27:23,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/109954763/1c1d96a1de3a4f6aa1ee0ea9098a4af8/FLAGdc21b8487 [2020-07-11 02:27:23,589 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/109954763/1c1d96a1de3a4f6aa1ee0ea9098a4af8 [2020-07-11 02:27:23,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:27:23,601 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:27:23,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:27:23,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:27:23,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:27:23,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:27:23" (1/1) ... [2020-07-11 02:27:23,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f01846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:23, skipping insertion in model container [2020-07-11 02:27:23,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:27:23" (1/1) ... [2020-07-11 02:27:23,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:27:23,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:27:23,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:27:23,855 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:27:23,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:27:23,998 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:27:23,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:23 WrapperNode [2020-07-11 02:27:23,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:27:24,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:27:24,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:27:24,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:27:24,019 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:23" (1/1) ... [2020-07-11 02:27:24,019 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:23" (1/1) ... [2020-07-11 02:27:24,043 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:23" (1/1) ... [2020-07-11 02:27:24,044 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:23" (1/1) ... [2020-07-11 02:27:24,058 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:23" (1/1) ... [2020-07-11 02:27:24,068 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:23" (1/1) ... [2020-07-11 02:27:24,070 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:23" (1/1) ... [2020-07-11 02:27:24,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:27:24,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:27:24,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:27:24,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:27:24,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:23" (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,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:27:24,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:27:24,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:27:24,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:27:24,148 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:27:24,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:27:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:27:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:27:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:27:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:27:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 02:27:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:27:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 02:27:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 02:27:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 02:27:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 02:27:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 02:27:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:27:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:27:24,834 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:27:24,834 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-11 02:27:24,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:27:24 BoogieIcfgContainer [2020-07-11 02:27:24,839 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:27:24,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:27:24,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:27:24,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:27:24,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:27:23" (1/3) ... [2020-07-11 02:27:24,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19be5bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:27:24, skipping insertion in model container [2020-07-11 02:27:24,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:27:23" (2/3) ... [2020-07-11 02:27:24,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19be5bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:27:24, skipping insertion in model container [2020-07-11 02:27:24,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:27:24" (3/3) ... [2020-07-11 02:27:24,848 INFO L109 eAbstractionObserver]: Analyzing ICFG ss2f.c [2020-07-11 02:27:24,859 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:27:24,867 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:27:24,879 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:27:24,899 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:27:24,899 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:27:24,899 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:27:24,900 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:27:24,900 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:27:24,900 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:27:24,900 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:27:24,901 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:27:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2020-07-11 02:27:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-11 02:27:24,929 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:24,930 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] [2020-07-11 02:27:24,930 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:24,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:24,936 INFO L82 PathProgramCache]: Analyzing trace with hash -456074008, now seen corresponding path program 1 times [2020-07-11 02:27:24,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:24,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1016814878] [2020-07-11 02:27:24,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:25,181 INFO L280 TraceCheckUtils]: 0: Hoare triple {112#(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; {100#true} is VALID [2020-07-11 02:27:25,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {100#true} #valid := #valid[0 := 0]; {100#true} is VALID [2020-07-11 02:27:25,182 INFO L280 TraceCheckUtils]: 2: Hoare triple {100#true} assume 0 < #StackHeapBarrier; {100#true} is VALID [2020-07-11 02:27:25,182 INFO L280 TraceCheckUtils]: 3: Hoare triple {100#true} ~N~0 := 0; {100#true} is VALID [2020-07-11 02:27:25,183 INFO L280 TraceCheckUtils]: 4: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-11 02:27:25,183 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {100#true} {100#true} #188#return; {100#true} is VALID [2020-07-11 02:27:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:25,193 INFO L280 TraceCheckUtils]: 0: Hoare triple {100#true} ~cond := #in~cond; {100#true} is VALID [2020-07-11 02:27:25,193 INFO L280 TraceCheckUtils]: 1: Hoare triple {100#true} assume !(0 == ~cond); {100#true} is VALID [2020-07-11 02:27:25,194 INFO L280 TraceCheckUtils]: 2: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-11 02:27:25,194 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {100#true} {100#true} #184#return; {100#true} is VALID [2020-07-11 02:27:25,196 INFO L263 TraceCheckUtils]: 0: Hoare triple {100#true} call ULTIMATE.init(); {112#(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,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {112#(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; {100#true} is VALID [2020-07-11 02:27:25,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {100#true} #valid := #valid[0 := 0]; {100#true} is VALID [2020-07-11 02:27:25,197 INFO L280 TraceCheckUtils]: 3: Hoare triple {100#true} assume 0 < #StackHeapBarrier; {100#true} is VALID [2020-07-11 02:27:25,198 INFO L280 TraceCheckUtils]: 4: Hoare triple {100#true} ~N~0 := 0; {100#true} is VALID [2020-07-11 02:27:25,198 INFO L280 TraceCheckUtils]: 5: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-11 02:27:25,198 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {100#true} {100#true} #188#return; {100#true} is VALID [2020-07-11 02:27:25,199 INFO L263 TraceCheckUtils]: 7: Hoare triple {100#true} call #t~ret18 := main(); {100#true} is VALID [2020-07-11 02:27:25,199 INFO L280 TraceCheckUtils]: 8: Hoare triple {100#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {100#true} is VALID [2020-07-11 02:27:25,199 INFO L280 TraceCheckUtils]: 9: Hoare triple {100#true} ~N~0 := #t~nondet0; {100#true} is VALID [2020-07-11 02:27:25,200 INFO L280 TraceCheckUtils]: 10: Hoare triple {100#true} havoc #t~nondet0; {100#true} is VALID [2020-07-11 02:27:25,200 INFO L280 TraceCheckUtils]: 11: Hoare triple {100#true} assume !(~N~0 <= 0); {100#true} is VALID [2020-07-11 02:27:25,200 INFO L263 TraceCheckUtils]: 12: Hoare triple {100#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {100#true} is VALID [2020-07-11 02:27:25,201 INFO L280 TraceCheckUtils]: 13: Hoare triple {100#true} ~cond := #in~cond; {100#true} is VALID [2020-07-11 02:27:25,201 INFO L280 TraceCheckUtils]: 14: Hoare triple {100#true} assume !(0 == ~cond); {100#true} is VALID [2020-07-11 02:27:25,201 INFO L280 TraceCheckUtils]: 15: Hoare triple {100#true} assume true; {100#true} is VALID [2020-07-11 02:27:25,202 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {100#true} {100#true} #184#return; {100#true} is VALID [2020-07-11 02:27:25,202 INFO L280 TraceCheckUtils]: 17: Hoare triple {100#true} havoc ~i~0; {100#true} is VALID [2020-07-11 02:27:25,202 INFO L280 TraceCheckUtils]: 18: Hoare triple {100#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {100#true} is VALID [2020-07-11 02:27:25,203 INFO L280 TraceCheckUtils]: 19: Hoare triple {100#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {100#true} is VALID [2020-07-11 02:27:25,203 INFO L280 TraceCheckUtils]: 20: Hoare triple {100#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {100#true} is VALID [2020-07-11 02:27:25,203 INFO L280 TraceCheckUtils]: 21: Hoare triple {100#true} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {100#true} is VALID [2020-07-11 02:27:25,204 INFO L280 TraceCheckUtils]: 22: Hoare triple {100#true} ~i~0 := 0; {100#true} is VALID [2020-07-11 02:27:25,205 INFO L280 TraceCheckUtils]: 23: Hoare triple {100#true} assume !true; {101#false} is VALID [2020-07-11 02:27:25,205 INFO L280 TraceCheckUtils]: 24: Hoare triple {101#false} ~i~0 := 0; {101#false} is VALID [2020-07-11 02:27:25,206 INFO L280 TraceCheckUtils]: 25: Hoare triple {101#false} assume !true; {101#false} is VALID [2020-07-11 02:27:25,206 INFO L280 TraceCheckUtils]: 26: Hoare triple {101#false} ~i~0 := 0; {101#false} is VALID [2020-07-11 02:27:25,206 INFO L280 TraceCheckUtils]: 27: Hoare triple {101#false} assume !(~i~0 < ~N~0); {101#false} is VALID [2020-07-11 02:27:25,207 INFO L280 TraceCheckUtils]: 28: Hoare triple {101#false} ~i~0 := 0; {101#false} is VALID [2020-07-11 02:27:25,207 INFO L280 TraceCheckUtils]: 29: Hoare triple {101#false} assume !true; {101#false} is VALID [2020-07-11 02:27:25,207 INFO L280 TraceCheckUtils]: 30: Hoare triple {101#false} ~i~0 := 0; {101#false} is VALID [2020-07-11 02:27:25,208 INFO L280 TraceCheckUtils]: 31: Hoare triple {101#false} assume !true; {101#false} is VALID [2020-07-11 02:27:25,208 INFO L280 TraceCheckUtils]: 32: Hoare triple {101#false} ~i~0 := 0; {101#false} is VALID [2020-07-11 02:27:25,208 INFO L280 TraceCheckUtils]: 33: Hoare triple {101#false} assume !true; {101#false} is VALID [2020-07-11 02:27:25,209 INFO L280 TraceCheckUtils]: 34: Hoare triple {101#false} ~i~0 := 0; {101#false} is VALID [2020-07-11 02:27:25,209 INFO L280 TraceCheckUtils]: 35: Hoare triple {101#false} assume !!(~i~0 < ~N~0); {101#false} is VALID [2020-07-11 02:27:25,209 INFO L280 TraceCheckUtils]: 36: Hoare triple {101#false} SUMMARY for call #t~mem17 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L62 {101#false} is VALID [2020-07-11 02:27:25,210 INFO L263 TraceCheckUtils]: 37: Hoare triple {101#false} call __VERIFIER_assert((if #t~mem17 == ~N~0 * (2 + ~N~0) then 1 else 0)); {101#false} is VALID [2020-07-11 02:27:25,210 INFO L280 TraceCheckUtils]: 38: Hoare triple {101#false} ~cond := #in~cond; {101#false} is VALID [2020-07-11 02:27:25,210 INFO L280 TraceCheckUtils]: 39: Hoare triple {101#false} assume 0 == ~cond; {101#false} is VALID [2020-07-11 02:27:25,211 INFO L280 TraceCheckUtils]: 40: Hoare triple {101#false} assume !false; {101#false} is VALID [2020-07-11 02:27:25,218 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,219 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1016814878] [2020-07-11 02:27:25,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:27:25,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 02:27:25,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007382097] [2020-07-11 02:27:25,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-07-11 02:27:25,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:25,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 02:27:25,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:25,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 02:27:25,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:25,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 02:27:25,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:27:25,320 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 3 states. [2020-07-11 02:27:25,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:25,901 INFO L93 Difference]: Finished difference Result 177 states and 208 transitions. [2020-07-11 02:27:25,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 02:27:25,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-07-11 02:27:25,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:27:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2020-07-11 02:27:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:27:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2020-07-11 02:27:25,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 208 transitions. [2020-07-11 02:27:26,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:26,192 INFO L225 Difference]: With dead ends: 177 [2020-07-11 02:27:26,193 INFO L226 Difference]: Without dead ends: 88 [2020-07-11 02:27:26,197 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:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-11 02:27:26,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-07-11 02:27:26,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:26,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2020-07-11 02:27:26,314 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2020-07-11 02:27:26,314 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2020-07-11 02:27:26,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:26,322 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2020-07-11 02:27:26,323 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2020-07-11 02:27:26,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:26,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:26,325 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2020-07-11 02:27:26,325 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2020-07-11 02:27:26,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:26,333 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2020-07-11 02:27:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2020-07-11 02:27:26,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:26,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:26,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:26,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:26,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-07-11 02:27:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2020-07-11 02:27:26,342 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 41 [2020-07-11 02:27:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:26,343 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2020-07-11 02:27:26,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 02:27:26,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 88 states and 94 transitions. [2020-07-11 02:27:26,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2020-07-11 02:27:26,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-11 02:27:26,469 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:26,469 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] [2020-07-11 02:27:26,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:27:26,470 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:26,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:26,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1964521925, now seen corresponding path program 1 times [2020-07-11 02:27:26,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:26,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1716317872] [2020-07-11 02:27:26,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:26,645 INFO L280 TraceCheckUtils]: 0: Hoare triple {835#(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; {821#true} is VALID [2020-07-11 02:27:26,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {821#true} #valid := #valid[0 := 0]; {821#true} is VALID [2020-07-11 02:27:26,646 INFO L280 TraceCheckUtils]: 2: Hoare triple {821#true} assume 0 < #StackHeapBarrier; {821#true} is VALID [2020-07-11 02:27:26,647 INFO L280 TraceCheckUtils]: 3: Hoare triple {821#true} ~N~0 := 0; {821#true} is VALID [2020-07-11 02:27:26,647 INFO L280 TraceCheckUtils]: 4: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-11 02:27:26,647 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {821#true} {821#true} #188#return; {821#true} is VALID [2020-07-11 02:27:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:27:26,655 INFO L280 TraceCheckUtils]: 0: Hoare triple {821#true} ~cond := #in~cond; {821#true} is VALID [2020-07-11 02:27:26,656 INFO L280 TraceCheckUtils]: 1: Hoare triple {821#true} assume !(0 == ~cond); {821#true} is VALID [2020-07-11 02:27:26,656 INFO L280 TraceCheckUtils]: 2: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-11 02:27:26,657 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {821#true} {829#(<= 1 ~N~0)} #184#return; {829#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:26,658 INFO L263 TraceCheckUtils]: 0: Hoare triple {821#true} call ULTIMATE.init(); {835#(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:26,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {835#(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; {821#true} is VALID [2020-07-11 02:27:26,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {821#true} #valid := #valid[0 := 0]; {821#true} is VALID [2020-07-11 02:27:26,659 INFO L280 TraceCheckUtils]: 3: Hoare triple {821#true} assume 0 < #StackHeapBarrier; {821#true} is VALID [2020-07-11 02:27:26,660 INFO L280 TraceCheckUtils]: 4: Hoare triple {821#true} ~N~0 := 0; {821#true} is VALID [2020-07-11 02:27:26,660 INFO L280 TraceCheckUtils]: 5: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-11 02:27:26,660 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {821#true} {821#true} #188#return; {821#true} is VALID [2020-07-11 02:27:26,660 INFO L263 TraceCheckUtils]: 7: Hoare triple {821#true} call #t~ret18 := main(); {821#true} is VALID [2020-07-11 02:27:26,661 INFO L280 TraceCheckUtils]: 8: Hoare triple {821#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {821#true} is VALID [2020-07-11 02:27:26,661 INFO L280 TraceCheckUtils]: 9: Hoare triple {821#true} ~N~0 := #t~nondet0; {821#true} is VALID [2020-07-11 02:27:26,661 INFO L280 TraceCheckUtils]: 10: Hoare triple {821#true} havoc #t~nondet0; {821#true} is VALID [2020-07-11 02:27:26,662 INFO L280 TraceCheckUtils]: 11: Hoare triple {821#true} assume !(~N~0 <= 0); {829#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:26,663 INFO L263 TraceCheckUtils]: 12: Hoare triple {829#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {821#true} is VALID [2020-07-11 02:27:26,663 INFO L280 TraceCheckUtils]: 13: Hoare triple {821#true} ~cond := #in~cond; {821#true} is VALID [2020-07-11 02:27:26,663 INFO L280 TraceCheckUtils]: 14: Hoare triple {821#true} assume !(0 == ~cond); {821#true} is VALID [2020-07-11 02:27:26,664 INFO L280 TraceCheckUtils]: 15: Hoare triple {821#true} assume true; {821#true} is VALID [2020-07-11 02:27:26,665 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {821#true} {829#(<= 1 ~N~0)} #184#return; {829#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:26,665 INFO L280 TraceCheckUtils]: 17: Hoare triple {829#(<= 1 ~N~0)} havoc ~i~0; {829#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:26,666 INFO L280 TraceCheckUtils]: 18: Hoare triple {829#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {829#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:26,667 INFO L280 TraceCheckUtils]: 19: Hoare triple {829#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0); srcloc: L26-1 {829#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:26,668 INFO L280 TraceCheckUtils]: 20: Hoare triple {829#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {829#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:26,668 INFO L280 TraceCheckUtils]: 21: Hoare triple {829#(<= 1 ~N~0)} SUMMARY for call write~int(0, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {829#(<= 1 ~N~0)} is VALID [2020-07-11 02:27:26,669 INFO L280 TraceCheckUtils]: 22: Hoare triple {829#(<= 1 ~N~0)} ~i~0 := 0; {834#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-11 02:27:26,670 INFO L280 TraceCheckUtils]: 23: Hoare triple {834#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {822#false} is VALID [2020-07-11 02:27:26,671 INFO L280 TraceCheckUtils]: 24: Hoare triple {822#false} ~i~0 := 0; {822#false} is VALID [2020-07-11 02:27:26,671 INFO L280 TraceCheckUtils]: 25: Hoare triple {822#false} assume !(~i~0 < ~N~0); {822#false} is VALID [2020-07-11 02:27:26,671 INFO L280 TraceCheckUtils]: 26: Hoare triple {822#false} ~i~0 := 0; {822#false} is VALID [2020-07-11 02:27:26,671 INFO L280 TraceCheckUtils]: 27: Hoare triple {822#false} assume !(~i~0 < ~N~0); {822#false} is VALID [2020-07-11 02:27:26,672 INFO L280 TraceCheckUtils]: 28: Hoare triple {822#false} ~i~0 := 0; {822#false} is VALID [2020-07-11 02:27:26,672 INFO L280 TraceCheckUtils]: 29: Hoare triple {822#false} assume !(~i~0 < ~N~0); {822#false} is VALID [2020-07-11 02:27:26,672 INFO L280 TraceCheckUtils]: 30: Hoare triple {822#false} ~i~0 := 0; {822#false} is VALID [2020-07-11 02:27:26,673 INFO L280 TraceCheckUtils]: 31: Hoare triple {822#false} assume !(~i~0 < ~N~0); {822#false} is VALID [2020-07-11 02:27:26,673 INFO L280 TraceCheckUtils]: 32: Hoare triple {822#false} ~i~0 := 0; {822#false} is VALID [2020-07-11 02:27:26,673 INFO L280 TraceCheckUtils]: 33: Hoare triple {822#false} assume !(~i~0 < ~N~0); {822#false} is VALID [2020-07-11 02:27:26,673 INFO L280 TraceCheckUtils]: 34: Hoare triple {822#false} ~i~0 := 0; {822#false} is VALID [2020-07-11 02:27:26,674 INFO L280 TraceCheckUtils]: 35: Hoare triple {822#false} assume !!(~i~0 < ~N~0); {822#false} is VALID [2020-07-11 02:27:26,674 INFO L280 TraceCheckUtils]: 36: Hoare triple {822#false} SUMMARY for call #t~mem17 := read~int(~a~0.base, ~a~0.offset + 8 * ~i~0, 8); srcloc: L62 {822#false} is VALID [2020-07-11 02:27:26,674 INFO L263 TraceCheckUtils]: 37: Hoare triple {822#false} call __VERIFIER_assert((if #t~mem17 == ~N~0 * (2 + ~N~0) then 1 else 0)); {822#false} is VALID [2020-07-11 02:27:26,674 INFO L280 TraceCheckUtils]: 38: Hoare triple {822#false} ~cond := #in~cond; {822#false} is VALID [2020-07-11 02:27:26,675 INFO L280 TraceCheckUtils]: 39: Hoare triple {822#false} assume 0 == ~cond; {822#false} is VALID [2020-07-11 02:27:26,675 INFO L280 TraceCheckUtils]: 40: Hoare triple {822#false} assume !false; {822#false} is VALID [2020-07-11 02:27:26,677 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:26,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1716317872] [2020-07-11 02:27:26,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:27:26,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-11 02:27:26,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406955117] [2020-07-11 02:27:26,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-11 02:27:26,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:27:26,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-11 02:27:26,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:26,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-11 02:27:26,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:27:26,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-11 02:27:26,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-11 02:27:26,725 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 5 states. [2020-07-11 02:27:27,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:27,640 INFO L93 Difference]: Finished difference Result 194 states and 212 transitions. [2020-07-11 02:27:27,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-11 02:27:27,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-11 02:27:27,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:27:27,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:27:27,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2020-07-11 02:27:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-11 02:27:27,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2020-07-11 02:27:27,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 212 transitions. [2020-07-11 02:27:27,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:27,903 INFO L225 Difference]: With dead ends: 194 [2020-07-11 02:27:27,904 INFO L226 Difference]: Without dead ends: 134 [2020-07-11 02:27:27,905 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:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-07-11 02:27:28,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2020-07-11 02:27:28,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:27:28,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand 94 states. [2020-07-11 02:27:28,060 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 94 states. [2020-07-11 02:27:28,060 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 94 states. [2020-07-11 02:27:28,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:28,068 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2020-07-11 02:27:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2020-07-11 02:27:28,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:28,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:28,070 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 134 states. [2020-07-11 02:27:28,071 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 134 states. [2020-07-11 02:27:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:27:28,078 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2020-07-11 02:27:28,078 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 141 transitions. [2020-07-11 02:27:28,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:27:28,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:27:28,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:27:28,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:27:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-11 02:27:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2020-07-11 02:27:28,084 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 41 [2020-07-11 02:27:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:27:28,085 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2020-07-11 02:27:28,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-11 02:27:28,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 94 states and 100 transitions. [2020-07-11 02:27:28,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:27:28,233 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2020-07-11 02:27:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-07-11 02:27:28,238 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:27:28,238 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, 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,239 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:27:28,239 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:27:28,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:27:28,242 INFO L82 PathProgramCache]: Analyzing trace with hash -725795370, now seen corresponding path program 1 times [2020-07-11 02:27:28,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:27:28,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [734527241] [2020-07-11 02:27:28,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:27:28,340 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-11 02:27:28,340 WARN L168 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2020-07-11 02:27:28,341 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 02:27:28,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:27:28,364 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 02:27:28,365 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:27:28,365 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 02:27:28,365 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:27:28,365 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 02:27:28,365 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-11 02:27:28,365 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:27:28,365 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:27:28,366 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 02:27:28,366 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-11 02:27:28,366 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-11 02:27:28,366 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-11 02:27:28,366 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 02:27:28,366 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-11 02:27:28,366 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 02:27:28,366 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 02:27:28,367 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-11 02:27:28,367 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-11 02:27:28,367 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-11 02:27:28,367 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-11 02:27:28,367 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-11 02:27:28,367 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-11 02:27:28,367 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-11 02:27:28,367 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-11 02:27:28,368 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 02:27:28,368 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-11 02:27:28,368 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-11 02:27:28,368 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 02:27:28,368 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-11 02:27:28,368 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-11 02:27:28,368 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 02:27:28,368 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-11 02:27:28,369 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2020-07-11 02:27:28,369 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 02:27:28,369 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-11 02:27:28,369 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 02:27:28,369 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2020-07-11 02:27:28,369 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-11 02:27:28,369 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 02:27:28,369 WARN L170 areAnnotationChecker]: L60-3 has no Hoare annotation [2020-07-11 02:27:28,370 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-11 02:27:28,370 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2020-07-11 02:27:28,370 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-11 02:27:28,370 WARN L170 areAnnotationChecker]: L60-5 has no Hoare annotation [2020-07-11 02:27:28,370 WARN L170 areAnnotationChecker]: L60-5 has no Hoare annotation [2020-07-11 02:27:28,370 WARN L170 areAnnotationChecker]: L60-5 has no Hoare annotation [2020-07-11 02:27:28,370 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-11 02:27:28,370 WARN L170 areAnnotationChecker]: L60-6 has no Hoare annotation [2020-07-11 02:27:28,371 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-11 02:27:28,371 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-11 02:27:28,371 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-11 02:27:28,371 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-11 02:27:28,371 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-11 02:27:28,371 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-11 02:27:28,371 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2020-07-11 02:27:28,372 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-11 02:27:28,372 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-11 02:27:28,372 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-11 02:27:28,372 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-11 02:27:28,372 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-11 02:27:28,372 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-11 02:27:28,372 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-11 02:27:28,372 WARN L170 areAnnotationChecker]: L35-6 has no Hoare annotation [2020-07-11 02:27:28,372 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-11 02:27:28,373 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-11 02:27:28,373 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-11 02:27:28,373 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-11 02:27:28,373 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-11 02:27:28,373 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-11 02:27:28,373 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-11 02:27:28,373 WARN L170 areAnnotationChecker]: L40-5 has no Hoare annotation [2020-07-11 02:27:28,373 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-11 02:27:28,373 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-11 02:27:28,374 WARN L170 areAnnotationChecker]: L45-5 has no Hoare annotation [2020-07-11 02:27:28,374 WARN L170 areAnnotationChecker]: L45-5 has no Hoare annotation [2020-07-11 02:27:28,374 WARN L170 areAnnotationChecker]: L45-5 has no Hoare annotation [2020-07-11 02:27:28,374 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-11 02:27:28,374 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2020-07-11 02:27:28,374 WARN L170 areAnnotationChecker]: L45-6 has no Hoare annotation [2020-07-11 02:27:28,374 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-11 02:27:28,374 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-11 02:27:28,374 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-11 02:27:28,375 WARN L170 areAnnotationChecker]: L50-5 has no Hoare annotation [2020-07-11 02:27:28,375 WARN L170 areAnnotationChecker]: L50-5 has no Hoare annotation [2020-07-11 02:27:28,375 WARN L170 areAnnotationChecker]: L50-5 has no Hoare annotation [2020-07-11 02:27:28,375 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-11 02:27:28,375 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-11 02:27:28,386 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-11 02:27:28,386 WARN L170 areAnnotationChecker]: L50-6 has no Hoare annotation [2020-07-11 02:27:28,387 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-11 02:27:28,387 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-11 02:27:28,387 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-11 02:27:28,387 WARN L170 areAnnotationChecker]: L55-5 has no Hoare annotation [2020-07-11 02:27:28,387 WARN L170 areAnnotationChecker]: L55-5 has no Hoare annotation [2020-07-11 02:27:28,387 WARN L170 areAnnotationChecker]: L55-5 has no Hoare annotation [2020-07-11 02:27:28,387 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-11 02:27:28,387 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-11 02:27:28,387 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-11 02:27:28,387 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2020-07-11 02:27:28,388 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-11 02:27:28,388 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-11 02:27:28,388 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-11 02:27:28,388 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-11 02:27:28,388 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-11 02:27:28,388 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2020-07-11 02:27:28,388 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-11 02:27:28,389 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2020-07-11 02:27:28,389 WARN L170 areAnnotationChecker]: L45-3 has no Hoare annotation [2020-07-11 02:27:28,389 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-11 02:27:28,389 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-11 02:27:28,389 WARN L170 areAnnotationChecker]: L45-4 has no Hoare annotation [2020-07-11 02:27:28,389 WARN L170 areAnnotationChecker]: L57-4 has no Hoare annotation [2020-07-11 02:27:28,389 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-11 02:27:28,390 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2020-07-11 02:27:28,390 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2020-07-11 02:27:28,390 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2020-07-11 02:27:28,390 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2020-07-11 02:27:28,390 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,394 WARN L231 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-07-11 02:27:28,394 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,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:27:28,397 INFO L168 Benchmark]: Toolchain (without parser) took 4796.13 ms. Allocated memory was 137.9 MB in the beginning and 276.8 MB in the end (delta: 138.9 MB). Free memory was 101.8 MB in the beginning and 249.6 MB in the end (delta: -147.8 MB). Peak memory consumption was 114.6 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:28,399 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 137.9 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-11 02:27:28,399 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.92 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 101.6 MB in the beginning and 182.9 MB in the end (delta: -81.3 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:28,400 INFO L168 Benchmark]: Boogie Preprocessor took 71.75 ms. Allocated memory is still 202.9 MB. Free memory was 182.9 MB in the beginning and 179.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:28,401 INFO L168 Benchmark]: RCFGBuilder took 765.65 ms. Allocated memory is still 202.9 MB. Free memory was 179.6 MB in the beginning and 140.1 MB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:28,402 INFO L168 Benchmark]: TraceAbstraction took 3553.72 ms. Allocated memory was 202.9 MB in the beginning and 276.8 MB in the end (delta: 73.9 MB). Free memory was 139.5 MB in the beginning and 249.6 MB in the end (delta: -110.1 MB). Peak memory consumption was 87.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:27:28,406 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.17 ms. Allocated memory is still 137.9 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 396.92 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 101.6 MB in the beginning and 182.9 MB in the end (delta: -81.3 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.75 ms. Allocated memory is still 202.9 MB. Free memory was 182.9 MB in the beginning and 179.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 765.65 ms. Allocated memory is still 202.9 MB. Free memory was 179.6 MB in the beginning and 140.1 MB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3553.72 ms. Allocated memory was 202.9 MB in the beginning and 276.8 MB in the end (delta: 73.9 MB). Free memory was 139.5 MB in the beginning and 249.6 MB in the end (delta: -110.1 MB). Peak memory consumption was 87.3 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