/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/s4iff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 23:36:04,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 23:36:04,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 23:36:04,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 23:36:04,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 23:36:04,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 23:36:04,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 23:36:04,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 23:36:04,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 23:36:04,313 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 23:36:04,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 23:36:04,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 23:36:04,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 23:36:04,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 23:36:04,319 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 23:36:04,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 23:36:04,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 23:36:04,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 23:36:04,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 23:36:04,329 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 23:36:04,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 23:36:04,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 23:36:04,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 23:36:04,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 23:36:04,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 23:36:04,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 23:36:04,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 23:36:04,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 23:36:04,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 23:36:04,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 23:36:04,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 23:36:04,349 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 23:36:04,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 23:36:04,352 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 23:36:04,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 23:36:04,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 23:36:04,359 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 23:36:04,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 23:36:04,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 23:36:04,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 23:36:04,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 23:36:04,368 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 23:36:04,386 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 23:36:04,386 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 23:36:04,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 23:36:04,391 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 23:36:04,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 23:36:04,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 23:36:04,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 23:36:04,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 23:36:04,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 23:36:04,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 23:36:04,393 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 23:36:04,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 23:36:04,394 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 23:36:04,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 23:36:04,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 23:36:04,395 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 23:36:04,395 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 23:36:04,396 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 23:36:04,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:36:04,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 23:36:04,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 23:36:04,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 23:36:04,397 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-08 23:36:04,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 23:36:04,785 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 23:36:04,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 23:36:04,792 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 23:36:04,793 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 23:36:04,794 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s4iff.c [2020-07-08 23:36:04,901 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031c2ce37/7c04632e966a4cffac60624f7eabf69d/FLAG78546b41c [2020-07-08 23:36:05,614 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 23:36:05,615 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s4iff.c [2020-07-08 23:36:05,622 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031c2ce37/7c04632e966a4cffac60624f7eabf69d/FLAG78546b41c [2020-07-08 23:36:05,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031c2ce37/7c04632e966a4cffac60624f7eabf69d [2020-07-08 23:36:05,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 23:36:05,918 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 23:36:05,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 23:36:05,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 23:36:05,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 23:36:05,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:36:05" (1/1) ... [2020-07-08 23:36:05,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b35bb57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:05, skipping insertion in model container [2020-07-08 23:36:05,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 11:36:05" (1/1) ... [2020-07-08 23:36:05,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 23:36:05,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 23:36:06,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:36:06,346 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 23:36:06,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 23:36:06,449 INFO L208 MainTranslator]: Completed translation [2020-07-08 23:36:06,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:06 WrapperNode [2020-07-08 23:36:06,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 23:36:06,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 23:36:06,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 23:36:06,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 23:36:06,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:06" (1/1) ... [2020-07-08 23:36:06,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:06" (1/1) ... [2020-07-08 23:36:06,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:06" (1/1) ... [2020-07-08 23:36:06,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:06" (1/1) ... [2020-07-08 23:36:06,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:06" (1/1) ... [2020-07-08 23:36:06,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:06" (1/1) ... [2020-07-08 23:36:06,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:06" (1/1) ... [2020-07-08 23:36:06,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 23:36:06,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 23:36:06,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 23:36:06,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 23:36:06,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 23:36:06,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 23:36:06,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 23:36:06,759 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 23:36:06,759 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 23:36:06,759 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 23:36:06,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 23:36:06,759 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 23:36:06,760 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 23:36:06,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 23:36:06,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 23:36:06,760 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 23:36:06,760 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 23:36:06,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 23:36:06,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 23:36:06,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 23:36:06,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 23:36:06,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 23:36:06,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 23:36:06,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 23:36:07,414 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 23:36:07,414 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 23:36:07,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:36:07 BoogieIcfgContainer [2020-07-08 23:36:07,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 23:36:07,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 23:36:07,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 23:36:07,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 23:36:07,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 11:36:05" (1/3) ... [2020-07-08 23:36:07,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c63a834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:36:07, skipping insertion in model container [2020-07-08 23:36:07,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 11:36:06" (2/3) ... [2020-07-08 23:36:07,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c63a834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 11:36:07, skipping insertion in model container [2020-07-08 23:36:07,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 11:36:07" (3/3) ... [2020-07-08 23:36:07,436 INFO L109 eAbstractionObserver]: Analyzing ICFG s4iff.c [2020-07-08 23:36:07,451 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 23:36:07,462 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 23:36:07,478 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 23:36:07,508 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 23:36:07,508 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 23:36:07,509 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 23:36:07,509 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 23:36:07,509 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 23:36:07,509 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 23:36:07,509 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 23:36:07,509 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 23:36:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2020-07-08 23:36:07,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 23:36:07,546 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:07,548 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] [2020-07-08 23:36:07,548 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:07,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:07,559 INFO L82 PathProgramCache]: Analyzing trace with hash 171473808, now seen corresponding path program 1 times [2020-07-08 23:36:07,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:07,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1710379385] [2020-07-08 23:36:07,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:07,949 INFO L280 TraceCheckUtils]: 0: Hoare triple {80#(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; {68#true} is VALID [2020-07-08 23:36:07,950 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-08 23:36:07,951 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-08 23:36:07,951 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} ~N~0 := 0; {68#true} is VALID [2020-07-08 23:36:07,952 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-08 23:36:07,952 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {68#true} {68#true} #105#return; {68#true} is VALID [2020-07-08 23:36:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:07,980 INFO L280 TraceCheckUtils]: 0: Hoare triple {68#true} ~cond := #in~cond; {68#true} is VALID [2020-07-08 23:36:07,981 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#true} assume !(0 == ~cond); {68#true} is VALID [2020-07-08 23:36:07,981 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-08 23:36:07,982 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #101#return; {68#true} is VALID [2020-07-08 23:36:07,985 INFO L263 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {80#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:36:07,985 INFO L280 TraceCheckUtils]: 1: Hoare triple {80#(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; {68#true} is VALID [2020-07-08 23:36:07,986 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#true} #valid := #valid[0 := 0]; {68#true} is VALID [2020-07-08 23:36:07,986 INFO L280 TraceCheckUtils]: 3: Hoare triple {68#true} assume 0 < #StackHeapBarrier; {68#true} is VALID [2020-07-08 23:36:07,986 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#true} ~N~0 := 0; {68#true} is VALID [2020-07-08 23:36:07,987 INFO L280 TraceCheckUtils]: 5: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-08 23:36:07,987 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {68#true} {68#true} #105#return; {68#true} is VALID [2020-07-08 23:36:07,987 INFO L263 TraceCheckUtils]: 7: Hoare triple {68#true} call #t~ret10 := main(); {68#true} is VALID [2020-07-08 23:36:07,988 INFO L280 TraceCheckUtils]: 8: Hoare triple {68#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {68#true} is VALID [2020-07-08 23:36:07,988 INFO L280 TraceCheckUtils]: 9: Hoare triple {68#true} ~N~0 := #t~nondet0; {68#true} is VALID [2020-07-08 23:36:07,988 INFO L280 TraceCheckUtils]: 10: Hoare triple {68#true} havoc #t~nondet0; {68#true} is VALID [2020-07-08 23:36:07,989 INFO L280 TraceCheckUtils]: 11: Hoare triple {68#true} assume !(~N~0 <= 0); {68#true} is VALID [2020-07-08 23:36:07,990 INFO L263 TraceCheckUtils]: 12: Hoare triple {68#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {68#true} is VALID [2020-07-08 23:36:07,990 INFO L280 TraceCheckUtils]: 13: Hoare triple {68#true} ~cond := #in~cond; {68#true} is VALID [2020-07-08 23:36:07,991 INFO L280 TraceCheckUtils]: 14: Hoare triple {68#true} assume !(0 == ~cond); {68#true} is VALID [2020-07-08 23:36:07,991 INFO L280 TraceCheckUtils]: 15: Hoare triple {68#true} assume true; {68#true} is VALID [2020-07-08 23:36:07,992 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {68#true} {68#true} #101#return; {68#true} is VALID [2020-07-08 23:36:07,992 INFO L280 TraceCheckUtils]: 17: Hoare triple {68#true} havoc ~i~0; {68#true} is VALID [2020-07-08 23:36:07,993 INFO L280 TraceCheckUtils]: 18: Hoare triple {68#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {68#true} is VALID [2020-07-08 23:36:07,994 INFO L280 TraceCheckUtils]: 19: Hoare triple {68#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {68#true} is VALID [2020-07-08 23:36:07,994 INFO L280 TraceCheckUtils]: 20: Hoare triple {68#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {68#true} is VALID [2020-07-08 23:36:07,995 INFO L280 TraceCheckUtils]: 21: Hoare triple {68#true} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {68#true} is VALID [2020-07-08 23:36:07,995 INFO L280 TraceCheckUtils]: 22: Hoare triple {68#true} ~i~0 := 0; {68#true} is VALID [2020-07-08 23:36:07,997 INFO L280 TraceCheckUtils]: 23: Hoare triple {68#true} assume !true; {69#false} is VALID [2020-07-08 23:36:07,998 INFO L280 TraceCheckUtils]: 24: Hoare triple {69#false} ~i~0 := 0; {69#false} is VALID [2020-07-08 23:36:07,999 INFO L280 TraceCheckUtils]: 25: Hoare triple {69#false} assume !true; {69#false} is VALID [2020-07-08 23:36:08,000 INFO L280 TraceCheckUtils]: 26: Hoare triple {69#false} SUMMARY for call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L35-6 {69#false} is VALID [2020-07-08 23:36:08,001 INFO L263 TraceCheckUtils]: 27: Hoare triple {69#false} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {69#false} is VALID [2020-07-08 23:36:08,001 INFO L280 TraceCheckUtils]: 28: Hoare triple {69#false} ~cond := #in~cond; {69#false} is VALID [2020-07-08 23:36:08,002 INFO L280 TraceCheckUtils]: 29: Hoare triple {69#false} assume 0 == ~cond; {69#false} is VALID [2020-07-08 23:36:08,002 INFO L280 TraceCheckUtils]: 30: Hoare triple {69#false} assume !false; {69#false} is VALID [2020-07-08 23:36:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:36:08,009 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1710379385] [2020-07-08 23:36:08,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:36:08,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 23:36:08,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526881102] [2020-07-08 23:36:08,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-08 23:36:08,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:08,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 23:36:08,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:08,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 23:36:08,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:08,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 23:36:08,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:36:08,155 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2020-07-08 23:36:08,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:08,807 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2020-07-08 23:36:08,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 23:36:08,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-07-08 23:36:08,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:08,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:36:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-08 23:36:08,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 23:36:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-08 23:36:08,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2020-07-08 23:36:09,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:09,182 INFO L225 Difference]: With dead ends: 113 [2020-07-08 23:36:09,182 INFO L226 Difference]: Without dead ends: 53 [2020-07-08 23:36:09,203 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 23:36:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-08 23:36:09,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-08 23:36:09,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:09,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2020-07-08 23:36:09,338 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-08 23:36:09,339 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-08 23:36:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:09,347 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-08 23:36:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-08 23:36:09,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:09,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:09,349 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-08 23:36:09,350 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-08 23:36:09,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:09,358 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-08 23:36:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-08 23:36:09,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:09,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:09,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:09,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-08 23:36:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-07-08 23:36:09,369 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 31 [2020-07-08 23:36:09,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:09,370 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-07-08 23:36:09,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 23:36:09,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 55 transitions. [2020-07-08 23:36:09,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-08 23:36:09,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 23:36:09,511 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:09,511 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] [2020-07-08 23:36:09,512 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 23:36:09,513 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:09,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:09,514 INFO L82 PathProgramCache]: Analyzing trace with hash 921692051, now seen corresponding path program 1 times [2020-07-08 23:36:09,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:09,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1819178795] [2020-07-08 23:36:09,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:09,690 INFO L280 TraceCheckUtils]: 0: Hoare triple {535#(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; {521#true} is VALID [2020-07-08 23:36:09,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {521#true} #valid := #valid[0 := 0]; {521#true} is VALID [2020-07-08 23:36:09,691 INFO L280 TraceCheckUtils]: 2: Hoare triple {521#true} assume 0 < #StackHeapBarrier; {521#true} is VALID [2020-07-08 23:36:09,691 INFO L280 TraceCheckUtils]: 3: Hoare triple {521#true} ~N~0 := 0; {521#true} is VALID [2020-07-08 23:36:09,691 INFO L280 TraceCheckUtils]: 4: Hoare triple {521#true} assume true; {521#true} is VALID [2020-07-08 23:36:09,692 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {521#true} {521#true} #105#return; {521#true} is VALID [2020-07-08 23:36:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:09,705 INFO L280 TraceCheckUtils]: 0: Hoare triple {521#true} ~cond := #in~cond; {521#true} is VALID [2020-07-08 23:36:09,706 INFO L280 TraceCheckUtils]: 1: Hoare triple {521#true} assume !(0 == ~cond); {521#true} is VALID [2020-07-08 23:36:09,707 INFO L280 TraceCheckUtils]: 2: Hoare triple {521#true} assume true; {521#true} is VALID [2020-07-08 23:36:09,708 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {521#true} {529#(<= 1 ~N~0)} #101#return; {529#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:09,710 INFO L263 TraceCheckUtils]: 0: Hoare triple {521#true} call ULTIMATE.init(); {535#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:36:09,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {535#(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; {521#true} is VALID [2020-07-08 23:36:09,711 INFO L280 TraceCheckUtils]: 2: Hoare triple {521#true} #valid := #valid[0 := 0]; {521#true} is VALID [2020-07-08 23:36:09,712 INFO L280 TraceCheckUtils]: 3: Hoare triple {521#true} assume 0 < #StackHeapBarrier; {521#true} is VALID [2020-07-08 23:36:09,712 INFO L280 TraceCheckUtils]: 4: Hoare triple {521#true} ~N~0 := 0; {521#true} is VALID [2020-07-08 23:36:09,712 INFO L280 TraceCheckUtils]: 5: Hoare triple {521#true} assume true; {521#true} is VALID [2020-07-08 23:36:09,713 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {521#true} {521#true} #105#return; {521#true} is VALID [2020-07-08 23:36:09,713 INFO L263 TraceCheckUtils]: 7: Hoare triple {521#true} call #t~ret10 := main(); {521#true} is VALID [2020-07-08 23:36:09,713 INFO L280 TraceCheckUtils]: 8: Hoare triple {521#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {521#true} is VALID [2020-07-08 23:36:09,714 INFO L280 TraceCheckUtils]: 9: Hoare triple {521#true} ~N~0 := #t~nondet0; {521#true} is VALID [2020-07-08 23:36:09,714 INFO L280 TraceCheckUtils]: 10: Hoare triple {521#true} havoc #t~nondet0; {521#true} is VALID [2020-07-08 23:36:09,716 INFO L280 TraceCheckUtils]: 11: Hoare triple {521#true} assume !(~N~0 <= 0); {529#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:09,717 INFO L263 TraceCheckUtils]: 12: Hoare triple {529#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {521#true} is VALID [2020-07-08 23:36:09,717 INFO L280 TraceCheckUtils]: 13: Hoare triple {521#true} ~cond := #in~cond; {521#true} is VALID [2020-07-08 23:36:09,718 INFO L280 TraceCheckUtils]: 14: Hoare triple {521#true} assume !(0 == ~cond); {521#true} is VALID [2020-07-08 23:36:09,718 INFO L280 TraceCheckUtils]: 15: Hoare triple {521#true} assume true; {521#true} is VALID [2020-07-08 23:36:09,720 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {521#true} {529#(<= 1 ~N~0)} #101#return; {529#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:09,722 INFO L280 TraceCheckUtils]: 17: Hoare triple {529#(<= 1 ~N~0)} havoc ~i~0; {529#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:09,724 INFO L280 TraceCheckUtils]: 18: Hoare triple {529#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {529#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:09,726 INFO L280 TraceCheckUtils]: 19: Hoare triple {529#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {529#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:09,727 INFO L280 TraceCheckUtils]: 20: Hoare triple {529#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {529#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:09,728 INFO L280 TraceCheckUtils]: 21: Hoare triple {529#(<= 1 ~N~0)} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {529#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:09,730 INFO L280 TraceCheckUtils]: 22: Hoare triple {529#(<= 1 ~N~0)} ~i~0 := 0; {534#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 23:36:09,732 INFO L280 TraceCheckUtils]: 23: Hoare triple {534#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {522#false} is VALID [2020-07-08 23:36:09,732 INFO L280 TraceCheckUtils]: 24: Hoare triple {522#false} ~i~0 := 0; {522#false} is VALID [2020-07-08 23:36:09,733 INFO L280 TraceCheckUtils]: 25: Hoare triple {522#false} assume !(~i~0 < ~N~0); {522#false} is VALID [2020-07-08 23:36:09,733 INFO L280 TraceCheckUtils]: 26: Hoare triple {522#false} SUMMARY for call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L35-6 {522#false} is VALID [2020-07-08 23:36:09,733 INFO L263 TraceCheckUtils]: 27: Hoare triple {522#false} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {522#false} is VALID [2020-07-08 23:36:09,734 INFO L280 TraceCheckUtils]: 28: Hoare triple {522#false} ~cond := #in~cond; {522#false} is VALID [2020-07-08 23:36:09,734 INFO L280 TraceCheckUtils]: 29: Hoare triple {522#false} assume 0 == ~cond; {522#false} is VALID [2020-07-08 23:36:09,734 INFO L280 TraceCheckUtils]: 30: Hoare triple {522#false} assume !false; {522#false} is VALID [2020-07-08 23:36:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:36:09,738 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1819178795] [2020-07-08 23:36:09,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 23:36:09,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 23:36:09,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214332598] [2020-07-08 23:36:09,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-08 23:36:09,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:09,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 23:36:09,812 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:09,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 23:36:09,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:09,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 23:36:09,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 23:36:09,814 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2020-07-08 23:36:10,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:10,554 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2020-07-08 23:36:10,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 23:36:10,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-08 23:36:10,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:36:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2020-07-08 23:36:10,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 23:36:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2020-07-08 23:36:10,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 105 transitions. [2020-07-08 23:36:10,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:10,727 INFO L225 Difference]: With dead ends: 99 [2020-07-08 23:36:10,727 INFO L226 Difference]: Without dead ends: 74 [2020-07-08 23:36:10,729 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-08 23:36:10,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-08 23:36:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2020-07-08 23:36:10,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:10,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 55 states. [2020-07-08 23:36:10,851 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 55 states. [2020-07-08 23:36:10,851 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 55 states. [2020-07-08 23:36:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:10,857 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-08 23:36:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-08 23:36:10,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:10,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:10,859 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 74 states. [2020-07-08 23:36:10,859 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 74 states. [2020-07-08 23:36:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:10,865 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-08 23:36:10,865 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-08 23:36:10,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:10,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:10,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:10,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-08 23:36:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2020-07-08 23:36:10,871 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 31 [2020-07-08 23:36:10,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:10,871 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2020-07-08 23:36:10,872 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 23:36:10,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2020-07-08 23:36:10,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2020-07-08 23:36:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 23:36:10,974 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:10,974 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] [2020-07-08 23:36:10,974 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 23:36:10,975 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:10,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:10,975 INFO L82 PathProgramCache]: Analyzing trace with hash -827220298, now seen corresponding path program 1 times [2020-07-08 23:36:10,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:10,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [336909448] [2020-07-08 23:36:10,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:12,713 INFO L280 TraceCheckUtils]: 0: Hoare triple {1026#(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; {997#true} is VALID [2020-07-08 23:36:12,714 INFO L280 TraceCheckUtils]: 1: Hoare triple {997#true} #valid := #valid[0 := 0]; {997#true} is VALID [2020-07-08 23:36:12,716 INFO L280 TraceCheckUtils]: 2: Hoare triple {997#true} assume 0 < #StackHeapBarrier; {997#true} is VALID [2020-07-08 23:36:12,717 INFO L280 TraceCheckUtils]: 3: Hoare triple {997#true} ~N~0 := 0; {997#true} is VALID [2020-07-08 23:36:12,717 INFO L280 TraceCheckUtils]: 4: Hoare triple {997#true} assume true; {997#true} is VALID [2020-07-08 23:36:12,718 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {997#true} {997#true} #105#return; {997#true} is VALID [2020-07-08 23:36:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 23:36:12,751 INFO L280 TraceCheckUtils]: 0: Hoare triple {997#true} ~cond := #in~cond; {997#true} is VALID [2020-07-08 23:36:12,752 INFO L280 TraceCheckUtils]: 1: Hoare triple {997#true} assume !(0 == ~cond); {997#true} is VALID [2020-07-08 23:36:12,753 INFO L280 TraceCheckUtils]: 2: Hoare triple {997#true} assume true; {997#true} is VALID [2020-07-08 23:36:12,755 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {997#true} {1005#(<= 1 ~N~0)} #101#return; {1005#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:12,759 INFO L263 TraceCheckUtils]: 0: Hoare triple {997#true} call ULTIMATE.init(); {1026#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 23:36:12,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {1026#(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; {997#true} is VALID [2020-07-08 23:36:12,761 INFO L280 TraceCheckUtils]: 2: Hoare triple {997#true} #valid := #valid[0 := 0]; {997#true} is VALID [2020-07-08 23:36:12,761 INFO L280 TraceCheckUtils]: 3: Hoare triple {997#true} assume 0 < #StackHeapBarrier; {997#true} is VALID [2020-07-08 23:36:12,762 INFO L280 TraceCheckUtils]: 4: Hoare triple {997#true} ~N~0 := 0; {997#true} is VALID [2020-07-08 23:36:12,762 INFO L280 TraceCheckUtils]: 5: Hoare triple {997#true} assume true; {997#true} is VALID [2020-07-08 23:36:12,762 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {997#true} {997#true} #105#return; {997#true} is VALID [2020-07-08 23:36:12,762 INFO L263 TraceCheckUtils]: 7: Hoare triple {997#true} call #t~ret10 := main(); {997#true} is VALID [2020-07-08 23:36:12,763 INFO L280 TraceCheckUtils]: 8: Hoare triple {997#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {997#true} is VALID [2020-07-08 23:36:12,763 INFO L280 TraceCheckUtils]: 9: Hoare triple {997#true} ~N~0 := #t~nondet0; {997#true} is VALID [2020-07-08 23:36:12,763 INFO L280 TraceCheckUtils]: 10: Hoare triple {997#true} havoc #t~nondet0; {997#true} is VALID [2020-07-08 23:36:12,765 INFO L280 TraceCheckUtils]: 11: Hoare triple {997#true} assume !(~N~0 <= 0); {1005#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:12,765 INFO L263 TraceCheckUtils]: 12: Hoare triple {1005#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {997#true} is VALID [2020-07-08 23:36:12,766 INFO L280 TraceCheckUtils]: 13: Hoare triple {997#true} ~cond := #in~cond; {997#true} is VALID [2020-07-08 23:36:12,766 INFO L280 TraceCheckUtils]: 14: Hoare triple {997#true} assume !(0 == ~cond); {997#true} is VALID [2020-07-08 23:36:12,766 INFO L280 TraceCheckUtils]: 15: Hoare triple {997#true} assume true; {997#true} is VALID [2020-07-08 23:36:12,768 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {997#true} {1005#(<= 1 ~N~0)} #101#return; {1005#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:12,771 INFO L280 TraceCheckUtils]: 17: Hoare triple {1005#(<= 1 ~N~0)} havoc ~i~0; {1005#(<= 1 ~N~0)} is VALID [2020-07-08 23:36:12,773 INFO L280 TraceCheckUtils]: 18: Hoare triple {1005#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {1010#(and (or (< 536870911 ~N~0) (not (= 0 (select |#valid| |main_~#sum~0.base|)))) (<= 1 ~N~0))} is VALID [2020-07-08 23:36:12,776 INFO L280 TraceCheckUtils]: 19: Hoare triple {1010#(and (or (< 536870911 ~N~0) (not (= 0 (select |#valid| |main_~#sum~0.base|)))) (<= 1 ~N~0))} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {1011#(and (or (< 536870911 ~N~0) (not (= |main_#t~malloc1.base| |main_~#sum~0.base|))) (<= 1 ~N~0))} is VALID [2020-07-08 23:36:12,778 INFO L280 TraceCheckUtils]: 20: Hoare triple {1011#(and (or (< 536870911 ~N~0) (not (= |main_#t~malloc1.base| |main_~#sum~0.base|))) (<= 1 ~N~0))} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {1012#(and (<= 1 ~N~0) (or (< 536870911 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} is VALID [2020-07-08 23:36:12,780 INFO L280 TraceCheckUtils]: 21: Hoare triple {1012#(and (<= 1 ~N~0) (or (< 536870911 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} SUMMARY for call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L29 {1013#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (or (< 536870911 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} is VALID [2020-07-08 23:36:12,782 INFO L280 TraceCheckUtils]: 22: Hoare triple {1013#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (or (< 536870911 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} ~i~0 := 0; {1014#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (= (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 4)) |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (= 0 main_~i~0) (or (< 536870911 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} is VALID [2020-07-08 23:36:12,784 INFO L280 TraceCheckUtils]: 23: Hoare triple {1014#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (= (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 4)) |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (= 0 main_~i~0) (or (< 536870911 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} assume !!(~i~0 < ~N~0); {1014#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (= (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 4)) |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (= 0 main_~i~0) (or (< 536870911 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} is VALID [2020-07-08 23:36:12,787 INFO L280 TraceCheckUtils]: 24: Hoare triple {1014#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (= (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 4)) |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (= 0 main_~i~0) (or (< 536870911 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} SUMMARY for call write~int(4, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L32 {1014#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (= (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 4)) |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (= 0 main_~i~0) (or (< 536870911 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} is VALID [2020-07-08 23:36:12,790 INFO L280 TraceCheckUtils]: 25: Hoare triple {1014#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (= (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 4)) |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (= 0 main_~i~0) (or (< 536870911 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} #t~post2 := ~i~0; {1015#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (= |main_#t~post2| 0) (or (< 536870911 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} is VALID [2020-07-08 23:36:12,792 INFO L280 TraceCheckUtils]: 26: Hoare triple {1015#(and (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (= |main_#t~post2| 0) (or (< 536870911 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|))))} ~i~0 := 1 + #t~post2; {1016#(and (or (not (= main_~a~0.base |main_~#sum~0.base|)) (and (< 536870911 ~N~0) (<= main_~i~0 1))) (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))))} is VALID [2020-07-08 23:36:12,794 INFO L280 TraceCheckUtils]: 27: Hoare triple {1016#(and (or (not (= main_~a~0.base |main_~#sum~0.base|)) (and (< 536870911 ~N~0) (<= main_~i~0 1))) (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))))} havoc #t~post2; {1016#(and (or (not (= main_~a~0.base |main_~#sum~0.base|)) (and (< 536870911 ~N~0) (<= main_~i~0 1))) (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))))} is VALID [2020-07-08 23:36:12,796 INFO L280 TraceCheckUtils]: 28: Hoare triple {1016#(and (or (not (= main_~a~0.base |main_~#sum~0.base|)) (and (< 536870911 ~N~0) (<= main_~i~0 1))) (or (= main_~a~0.base |main_~#sum~0.base|) (and (<= 1 ~N~0) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))))} assume !(~i~0 < ~N~0); {1017#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-08 23:36:12,798 INFO L280 TraceCheckUtils]: 29: Hoare triple {1017#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} ~i~0 := 0; {1017#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-08 23:36:12,800 INFO L280 TraceCheckUtils]: 30: Hoare triple {1017#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} assume !!(~i~0 < ~N~0); {1017#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-08 23:36:12,803 INFO L280 TraceCheckUtils]: 31: Hoare triple {1017#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} SUMMARY for call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L37 {1018#(and (= |main_#t~mem4| (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-08 23:36:12,805 INFO L280 TraceCheckUtils]: 32: Hoare triple {1018#(and (= |main_#t~mem4| (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} assume 4 == #t~mem4; {1019#(and (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-08 23:36:12,807 INFO L280 TraceCheckUtils]: 33: Hoare triple {1019#(and (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} havoc #t~mem4; {1019#(and (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-08 23:36:12,809 INFO L280 TraceCheckUtils]: 34: Hoare triple {1019#(and (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} SUMMARY for call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38 {1020#(and (= 1 |main_#t~mem5|) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} is VALID [2020-07-08 23:36:12,812 INFO L280 TraceCheckUtils]: 35: Hoare triple {1020#(and (= 1 |main_#t~mem5|) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)))} SUMMARY for call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); srcloc: L38-1 {1021#(and (= 1 |main_#t~mem5|) (= 4 |main_#t~mem6|) (= (+ |main_#t~mem6| |main_#t~mem5|) (* 5 ~N~0)))} is VALID [2020-07-08 23:36:12,814 INFO L280 TraceCheckUtils]: 36: Hoare triple {1021#(and (= 1 |main_#t~mem5|) (= 4 |main_#t~mem6|) (= (+ |main_#t~mem6| |main_#t~mem5|) (* 5 ~N~0)))} SUMMARY for call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8); srcloc: L38-2 {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0))} is VALID [2020-07-08 23:36:12,816 INFO L280 TraceCheckUtils]: 37: Hoare triple {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0))} havoc #t~mem5; {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0))} is VALID [2020-07-08 23:36:12,817 INFO L280 TraceCheckUtils]: 38: Hoare triple {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0))} havoc #t~mem6; {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0))} is VALID [2020-07-08 23:36:12,818 INFO L280 TraceCheckUtils]: 39: Hoare triple {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0))} #t~post3 := ~i~0; {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0))} is VALID [2020-07-08 23:36:12,819 INFO L280 TraceCheckUtils]: 40: Hoare triple {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0))} ~i~0 := 1 + #t~post3; {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0))} is VALID [2020-07-08 23:36:12,819 INFO L280 TraceCheckUtils]: 41: Hoare triple {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0))} havoc #t~post3; {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0))} is VALID [2020-07-08 23:36:12,820 INFO L280 TraceCheckUtils]: 42: Hoare triple {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0))} assume !(~i~0 < ~N~0); {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0))} is VALID [2020-07-08 23:36:12,821 INFO L280 TraceCheckUtils]: 43: Hoare triple {1022#(= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0))} SUMMARY for call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L35-6 {1023#(= |main_#t~mem9| (* 5 ~N~0))} is VALID [2020-07-08 23:36:12,823 INFO L263 TraceCheckUtils]: 44: Hoare triple {1023#(= |main_#t~mem9| (* 5 ~N~0))} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {1024#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 23:36:12,824 INFO L280 TraceCheckUtils]: 45: Hoare triple {1024#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1025#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 23:36:12,825 INFO L280 TraceCheckUtils]: 46: Hoare triple {1025#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {998#false} is VALID [2020-07-08 23:36:12,826 INFO L280 TraceCheckUtils]: 47: Hoare triple {998#false} assume !false; {998#false} is VALID [2020-07-08 23:36:12,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 23:36:12,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [336909448] [2020-07-08 23:36:12,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 23:36:12,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-07-08 23:36:12,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85350757] [2020-07-08 23:36:12,842 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2020-07-08 23:36:12,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 23:36:12,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-08 23:36:12,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:12,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-08 23:36:12,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 23:36:12,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-08 23:36:12,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2020-07-08 23:36:12,924 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 20 states. [2020-07-08 23:36:14,226 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2020-07-08 23:36:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:17,266 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2020-07-08 23:36:17,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-08 23:36:17,266 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2020-07-08 23:36:17,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 23:36:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-08 23:36:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 113 transitions. [2020-07-08 23:36:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-08 23:36:17,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 113 transitions. [2020-07-08 23:36:17,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 113 transitions. [2020-07-08 23:36:17,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:17,537 INFO L225 Difference]: With dead ends: 107 [2020-07-08 23:36:17,537 INFO L226 Difference]: Without dead ends: 101 [2020-07-08 23:36:17,539 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=318, Invalid=1242, Unknown=0, NotChecked=0, Total=1560 [2020-07-08 23:36:17,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-08 23:36:17,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 73. [2020-07-08 23:36:17,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 23:36:17,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 73 states. [2020-07-08 23:36:17,826 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 73 states. [2020-07-08 23:36:17,826 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 73 states. [2020-07-08 23:36:17,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:17,831 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2020-07-08 23:36:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2020-07-08 23:36:17,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:17,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:17,833 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 101 states. [2020-07-08 23:36:17,834 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 101 states. [2020-07-08 23:36:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 23:36:17,841 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2020-07-08 23:36:17,841 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2020-07-08 23:36:17,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 23:36:17,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 23:36:17,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 23:36:17,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 23:36:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-08 23:36:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2020-07-08 23:36:17,847 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 48 [2020-07-08 23:36:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 23:36:17,848 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2020-07-08 23:36:17,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-08 23:36:17,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 73 states and 77 transitions. [2020-07-08 23:36:18,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 23:36:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2020-07-08 23:36:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-08 23:36:18,051 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 23:36:18,052 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] [2020-07-08 23:36:18,052 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 23:36:18,052 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 23:36:18,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 23:36:18,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1272927570, now seen corresponding path program 1 times [2020-07-08 23:36:18,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 23:36:18,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [38006254] [2020-07-08 23:36:18,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 23:36:18,073 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-08 23:36:18,074 WARN L168 FreeRefinementEngine]: Strategy FIXED_PREFERENCES was unsuccessful and could not determine trace feasibility [2020-07-08 23:36:18,074 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 23:36:18,082 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 23:36:18,110 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 23:36:18,111 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:36:18,111 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 23:36:18,111 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 23:36:18,111 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 23:36:18,111 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 23:36:18,111 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:36:18,112 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:36:18,112 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 23:36:18,112 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:36:18,112 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 23:36:18,112 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 23:36:18,112 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:36:18,112 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 23:36:18,113 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-08 23:36:18,113 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 23:36:18,113 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-08 23:36:18,113 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-08 23:36:18,113 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-08 23:36:18,113 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:36:18,113 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 23:36:18,114 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 23:36:18,114 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-08 23:36:18,114 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 23:36:18,114 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:36:18,114 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 23:36:18,114 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 23:36:18,114 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 23:36:18,115 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 23:36:18,115 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-08 23:36:18,115 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:36:18,115 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 23:36:18,115 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-08 23:36:18,115 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 23:36:18,115 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 23:36:18,115 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 23:36:18,116 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-08 23:36:18,116 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-08 23:36:18,116 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 23:36:18,116 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-08 23:36:18,116 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-08 23:36:18,116 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-08 23:36:18,116 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-08 23:36:18,117 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-08 23:36:18,117 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:36:18,117 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:36:18,117 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 23:36:18,117 WARN L170 areAnnotationChecker]: L30-5 has no Hoare annotation [2020-07-08 23:36:18,118 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-08 23:36:18,118 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:36:18,118 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:36:18,118 WARN L170 areAnnotationChecker]: L35-5 has no Hoare annotation [2020-07-08 23:36:18,118 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-08 23:36:18,118 WARN L170 areAnnotationChecker]: L35-6 has no Hoare annotation [2020-07-08 23:36:18,118 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 23:36:18,119 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-08 23:36:18,119 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-08 23:36:18,119 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-08 23:36:18,119 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-08 23:36:18,119 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-08 23:36:18,119 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 23:36:18,119 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2020-07-08 23:36:18,120 WARN L170 areAnnotationChecker]: L37-4 has no Hoare annotation [2020-07-08 23:36:18,120 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-08 23:36:18,120 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-08 23:36:18,120 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2020-07-08 23:36:18,120 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-08 23:36:18,120 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-08 23:36:18,120 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2020-07-08 23:36:18,121 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-08 23:36:18,121 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2020-07-08 23:36:18,121 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-08 23:36:18,121 WARN L170 areAnnotationChecker]: L40-4 has no Hoare annotation [2020-07-08 23:36:18,121 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-08 23:36:18,121 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 23:36:18,121 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-08 23:36:18,122 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 23:36:18,127 WARN L231 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-07-08 23:36:18,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 11:36:18 BoogieIcfgContainer [2020-07-08 23:36:18,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 23:36:18,132 INFO L168 Benchmark]: Toolchain (without parser) took 12214.38 ms. Allocated memory was 134.2 MB in the beginning and 333.4 MB in the end (delta: 199.2 MB). Free memory was 98.9 MB in the beginning and 287.3 MB in the end (delta: -188.4 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:18,133 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 134.2 MB. Free memory was 116.4 MB in the beginning and 116.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 23:36:18,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 531.81 ms. Allocated memory is still 134.2 MB. Free memory was 98.7 MB in the beginning and 87.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:18,135 INFO L168 Benchmark]: Boogie Preprocessor took 227.77 ms. Allocated memory was 134.2 MB in the beginning and 200.3 MB in the end (delta: 66.1 MB). Free memory was 87.7 MB in the beginning and 177.5 MB in the end (delta: -89.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:18,136 INFO L168 Benchmark]: RCFGBuilder took 742.18 ms. Allocated memory is still 200.3 MB. Free memory was 177.5 MB in the beginning and 148.9 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2020-07-08 23:36:18,137 INFO L168 Benchmark]: TraceAbstraction took 10705.21 ms. Allocated memory was 200.3 MB in the beginning and 333.4 MB in the end (delta: 133.2 MB). Free memory was 148.9 MB in the beginning and 287.3 MB in the end (delta: -138.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 23:36:18,141 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.54 ms. Allocated memory is still 134.2 MB. Free memory was 116.4 MB in the beginning and 116.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 531.81 ms. Allocated memory is still 134.2 MB. Free memory was 98.7 MB in the beginning and 87.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 227.77 ms. Allocated memory was 134.2 MB in the beginning and 200.3 MB in the end (delta: 66.1 MB). Free memory was 87.7 MB in the beginning and 177.5 MB in the end (delta: -89.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 742.18 ms. Allocated memory is still 200.3 MB. Free memory was 177.5 MB in the beginning and 148.9 MB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10705.21 ms. Allocated memory was 200.3 MB in the beginning and 333.4 MB in the end (delta: 133.2 MB). Free memory was 148.9 MB in the beginning and 287.3 MB in the end (delta: -138.4 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] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 1 [L30] i=0 [L30] COND TRUE i