/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/ms3f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 06:32:55,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 06:32:55,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 06:32:55,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 06:32:55,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 06:32:55,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 06:32:55,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 06:32:55,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 06:32:55,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 06:32:55,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 06:32:55,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 06:32:55,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 06:32:55,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 06:32:55,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 06:32:55,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 06:32:55,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 06:32:55,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 06:32:55,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 06:32:55,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 06:32:55,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 06:32:55,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 06:32:55,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 06:32:55,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 06:32:55,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 06:32:55,570 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 06:32:55,571 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 06:32:55,571 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 06:32:55,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 06:32:55,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 06:32:55,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 06:32:55,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 06:32:55,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 06:32:55,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 06:32:55,577 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 06:32:55,578 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 06:32:55,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 06:32:55,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 06:32:55,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 06:32:55,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 06:32:55,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 06:32:55,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 06:32:55,583 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 06:32:55,593 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 06:32:55,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 06:32:55,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 06:32:55,596 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 06:32:55,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 06:32:55,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 06:32:55,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 06:32:55,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 06:32:55,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 06:32:55,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 06:32:55,597 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 06:32:55,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 06:32:55,597 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 06:32:55,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 06:32:55,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 06:32:55,598 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 06:32:55,598 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 06:32:55,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 06:32:55,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 06:32:55,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 06:32:55,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 06:32:55,599 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 06:32:55,600 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-18 06:32:55,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 06:32:55,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 06:32:55,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 06:32:55,962 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 06:32:55,963 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 06:32:55,964 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ms3f.c [2020-07-18 06:32:56,053 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b0dbfa9c/43af485d933145908c79b6f5447856be/FLAG899875111 [2020-07-18 06:32:56,635 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 06:32:56,636 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ms3f.c [2020-07-18 06:32:56,644 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b0dbfa9c/43af485d933145908c79b6f5447856be/FLAG899875111 [2020-07-18 06:32:57,037 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b0dbfa9c/43af485d933145908c79b6f5447856be [2020-07-18 06:32:57,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 06:32:57,050 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 06:32:57,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 06:32:57,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 06:32:57,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 06:32:57,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:32:57" (1/1) ... [2020-07-18 06:32:57,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bc26102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:57, skipping insertion in model container [2020-07-18 06:32:57,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 06:32:57" (1/1) ... [2020-07-18 06:32:57,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 06:32:57,096 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 06:32:57,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:32:57,305 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 06:32:57,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 06:32:57,350 INFO L208 MainTranslator]: Completed translation [2020-07-18 06:32:57,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:57 WrapperNode [2020-07-18 06:32:57,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 06:32:57,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 06:32:57,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 06:32:57,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 06:32:57,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:57" (1/1) ... [2020-07-18 06:32:57,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:57" (1/1) ... [2020-07-18 06:32:57,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:57" (1/1) ... [2020-07-18 06:32:57,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:57" (1/1) ... [2020-07-18 06:32:57,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:57" (1/1) ... [2020-07-18 06:32:57,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:57" (1/1) ... [2020-07-18 06:32:57,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:57" (1/1) ... [2020-07-18 06:32:57,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 06:32:57,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 06:32:57,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 06:32:57,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 06:32:57,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 06:32:57,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 06:32:57,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 06:32:57,577 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 06:32:57,577 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 06:32:57,577 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 06:32:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 06:32:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 06:32:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 06:32:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 06:32:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 06:32:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 06:32:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 06:32:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 06:32:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 06:32:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 06:32:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 06:32:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 06:32:57,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 06:32:57,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 06:32:58,039 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 06:32:58,039 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-18 06:32:58,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:32:58 BoogieIcfgContainer [2020-07-18 06:32:58,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 06:32:58,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 06:32:58,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 06:32:58,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 06:32:58,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 06:32:57" (1/3) ... [2020-07-18 06:32:58,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d01d650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:32:58, skipping insertion in model container [2020-07-18 06:32:58,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 06:32:57" (2/3) ... [2020-07-18 06:32:58,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d01d650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 06:32:58, skipping insertion in model container [2020-07-18 06:32:58,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 06:32:58" (3/3) ... [2020-07-18 06:32:58,058 INFO L109 eAbstractionObserver]: Analyzing ICFG ms3f.c [2020-07-18 06:32:58,071 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 06:32:58,081 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 06:32:58,099 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 06:32:58,139 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 06:32:58,141 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 06:32:58,141 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-18 06:32:58,141 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 06:32:58,141 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 06:32:58,142 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 06:32:58,142 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 06:32:58,142 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 06:32:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-07-18 06:32:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-18 06:32:58,170 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:58,172 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] [2020-07-18 06:32:58,172 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:58,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:58,179 INFO L82 PathProgramCache]: Analyzing trace with hash -845632023, now seen corresponding path program 1 times [2020-07-18 06:32:58,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:58,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [151824329] [2020-07-18 06:32:58,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:58,466 INFO L280 TraceCheckUtils]: 0: Hoare triple {72#(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; {60#true} is VALID [2020-07-18 06:32:58,467 INFO L280 TraceCheckUtils]: 1: Hoare triple {60#true} #valid := #valid[0 := 0]; {60#true} is VALID [2020-07-18 06:32:58,468 INFO L280 TraceCheckUtils]: 2: Hoare triple {60#true} assume 0 < #StackHeapBarrier; {60#true} is VALID [2020-07-18 06:32:58,469 INFO L280 TraceCheckUtils]: 3: Hoare triple {60#true} ~N~0 := 0; {60#true} is VALID [2020-07-18 06:32:58,469 INFO L280 TraceCheckUtils]: 4: Hoare triple {60#true} assume true; {60#true} is VALID [2020-07-18 06:32:58,470 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {60#true} {60#true} #97#return; {60#true} is VALID [2020-07-18 06:32:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:58,481 INFO L280 TraceCheckUtils]: 0: Hoare triple {60#true} ~cond := #in~cond; {60#true} is VALID [2020-07-18 06:32:58,482 INFO L280 TraceCheckUtils]: 1: Hoare triple {60#true} assume !(0 == ~cond); {60#true} is VALID [2020-07-18 06:32:58,482 INFO L280 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2020-07-18 06:32:58,483 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #93#return; {60#true} is VALID [2020-07-18 06:32:58,486 INFO L263 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {72#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:32:58,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {72#(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; {60#true} is VALID [2020-07-18 06:32:58,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {60#true} #valid := #valid[0 := 0]; {60#true} is VALID [2020-07-18 06:32:58,487 INFO L280 TraceCheckUtils]: 3: Hoare triple {60#true} assume 0 < #StackHeapBarrier; {60#true} is VALID [2020-07-18 06:32:58,488 INFO L280 TraceCheckUtils]: 4: Hoare triple {60#true} ~N~0 := 0; {60#true} is VALID [2020-07-18 06:32:58,488 INFO L280 TraceCheckUtils]: 5: Hoare triple {60#true} assume true; {60#true} is VALID [2020-07-18 06:32:58,488 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {60#true} {60#true} #97#return; {60#true} is VALID [2020-07-18 06:32:58,489 INFO L263 TraceCheckUtils]: 7: Hoare triple {60#true} call #t~ret7 := main(); {60#true} is VALID [2020-07-18 06:32:58,489 INFO L280 TraceCheckUtils]: 8: Hoare triple {60#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {60#true} is VALID [2020-07-18 06:32:58,490 INFO L280 TraceCheckUtils]: 9: Hoare triple {60#true} ~N~0 := #t~nondet0; {60#true} is VALID [2020-07-18 06:32:58,490 INFO L280 TraceCheckUtils]: 10: Hoare triple {60#true} havoc #t~nondet0; {60#true} is VALID [2020-07-18 06:32:58,491 INFO L280 TraceCheckUtils]: 11: Hoare triple {60#true} assume !(~N~0 <= 0); {60#true} is VALID [2020-07-18 06:32:58,491 INFO L263 TraceCheckUtils]: 12: Hoare triple {60#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {60#true} is VALID [2020-07-18 06:32:58,492 INFO L280 TraceCheckUtils]: 13: Hoare triple {60#true} ~cond := #in~cond; {60#true} is VALID [2020-07-18 06:32:58,492 INFO L280 TraceCheckUtils]: 14: Hoare triple {60#true} assume !(0 == ~cond); {60#true} is VALID [2020-07-18 06:32:58,492 INFO L280 TraceCheckUtils]: 15: Hoare triple {60#true} assume true; {60#true} is VALID [2020-07-18 06:32:58,493 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {60#true} {60#true} #93#return; {60#true} is VALID [2020-07-18 06:32:58,493 INFO L280 TraceCheckUtils]: 17: Hoare triple {60#true} havoc ~i~0; {60#true} is VALID [2020-07-18 06:32:58,494 INFO L280 TraceCheckUtils]: 18: Hoare triple {60#true} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {60#true} is VALID [2020-07-18 06:32:58,495 INFO L280 TraceCheckUtils]: 19: Hoare triple {60#true} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {60#true} is VALID [2020-07-18 06:32:58,495 INFO L280 TraceCheckUtils]: 20: Hoare triple {60#true} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {60#true} is VALID [2020-07-18 06:32:58,496 INFO L280 TraceCheckUtils]: 21: Hoare triple {60#true} ~i~0 := 0; {60#true} is VALID [2020-07-18 06:32:58,497 INFO L280 TraceCheckUtils]: 22: Hoare triple {60#true} assume !true; {61#false} is VALID [2020-07-18 06:32:58,498 INFO L280 TraceCheckUtils]: 23: Hoare triple {61#false} ~i~0 := 0; {61#false} is VALID [2020-07-18 06:32:58,499 INFO L280 TraceCheckUtils]: 24: Hoare triple {61#false} assume !true; {61#false} is VALID [2020-07-18 06:32:58,499 INFO L280 TraceCheckUtils]: 25: Hoare triple {61#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L34-6 {61#false} is VALID [2020-07-18 06:32:58,500 INFO L263 TraceCheckUtils]: 26: Hoare triple {61#false} call __VERIFIER_assert((if #t~mem6 > 2 * ~N~0 then 1 else 0)); {61#false} is VALID [2020-07-18 06:32:58,500 INFO L280 TraceCheckUtils]: 27: Hoare triple {61#false} ~cond := #in~cond; {61#false} is VALID [2020-07-18 06:32:58,501 INFO L280 TraceCheckUtils]: 28: Hoare triple {61#false} assume 0 == ~cond; {61#false} is VALID [2020-07-18 06:32:58,501 INFO L280 TraceCheckUtils]: 29: Hoare triple {61#false} assume !false; {61#false} is VALID [2020-07-18 06:32:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:32:58,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [151824329] [2020-07-18 06:32:58,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:32:58,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 06:32:58,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156501178] [2020-07-18 06:32:58,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-18 06:32:58,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:32:58,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 06:32:58,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:58,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 06:32:58,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:32:58,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 06:32:58,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 06:32:58,608 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2020-07-18 06:32:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:59,077 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2020-07-18 06:32:59,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 06:32:59,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-07-18 06:32:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:32:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:32:59,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-18 06:32:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 06:32:59,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-18 06:32:59,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2020-07-18 06:32:59,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:59,275 INFO L225 Difference]: With dead ends: 97 [2020-07-18 06:32:59,275 INFO L226 Difference]: Without dead ends: 45 [2020-07-18 06:32:59,281 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 06:32:59,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-18 06:32:59,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-18 06:32:59,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:32:59,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2020-07-18 06:32:59,394 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-18 06:32:59,395 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-18 06:32:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:59,401 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-07-18 06:32:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2020-07-18 06:32:59,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:59,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:59,403 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2020-07-18 06:32:59,403 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2020-07-18 06:32:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:32:59,410 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2020-07-18 06:32:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2020-07-18 06:32:59,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:32:59,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:32:59,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:32:59,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:32:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-18 06:32:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2020-07-18 06:32:59,419 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 30 [2020-07-18 06:32:59,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:32:59,420 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2020-07-18 06:32:59,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 06:32:59,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 47 transitions. [2020-07-18 06:32:59,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2020-07-18 06:32:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-18 06:32:59,497 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:32:59,497 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] [2020-07-18 06:32:59,498 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 06:32:59,498 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:32:59,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:32:59,499 INFO L82 PathProgramCache]: Analyzing trace with hash 104990277, now seen corresponding path program 1 times [2020-07-18 06:32:59,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:32:59,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1529282755] [2020-07-18 06:32:59,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:32:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:59,654 INFO L280 TraceCheckUtils]: 0: Hoare triple {463#(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; {449#true} is VALID [2020-07-18 06:32:59,654 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#true} #valid := #valid[0 := 0]; {449#true} is VALID [2020-07-18 06:32:59,655 INFO L280 TraceCheckUtils]: 2: Hoare triple {449#true} assume 0 < #StackHeapBarrier; {449#true} is VALID [2020-07-18 06:32:59,655 INFO L280 TraceCheckUtils]: 3: Hoare triple {449#true} ~N~0 := 0; {449#true} is VALID [2020-07-18 06:32:59,655 INFO L280 TraceCheckUtils]: 4: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-18 06:32:59,656 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {449#true} {449#true} #97#return; {449#true} is VALID [2020-07-18 06:32:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 06:32:59,665 INFO L280 TraceCheckUtils]: 0: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID [2020-07-18 06:32:59,666 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID [2020-07-18 06:32:59,666 INFO L280 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-18 06:32:59,668 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {449#true} {457#(<= 1 ~N~0)} #93#return; {457#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:59,669 INFO L263 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {463#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 06:32:59,670 INFO L280 TraceCheckUtils]: 1: Hoare triple {463#(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; {449#true} is VALID [2020-07-18 06:32:59,670 INFO L280 TraceCheckUtils]: 2: Hoare triple {449#true} #valid := #valid[0 := 0]; {449#true} is VALID [2020-07-18 06:32:59,670 INFO L280 TraceCheckUtils]: 3: Hoare triple {449#true} assume 0 < #StackHeapBarrier; {449#true} is VALID [2020-07-18 06:32:59,671 INFO L280 TraceCheckUtils]: 4: Hoare triple {449#true} ~N~0 := 0; {449#true} is VALID [2020-07-18 06:32:59,671 INFO L280 TraceCheckUtils]: 5: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-18 06:32:59,671 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {449#true} {449#true} #97#return; {449#true} is VALID [2020-07-18 06:32:59,672 INFO L263 TraceCheckUtils]: 7: Hoare triple {449#true} call #t~ret7 := main(); {449#true} is VALID [2020-07-18 06:32:59,672 INFO L280 TraceCheckUtils]: 8: Hoare triple {449#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {449#true} is VALID [2020-07-18 06:32:59,672 INFO L280 TraceCheckUtils]: 9: Hoare triple {449#true} ~N~0 := #t~nondet0; {449#true} is VALID [2020-07-18 06:32:59,673 INFO L280 TraceCheckUtils]: 10: Hoare triple {449#true} havoc #t~nondet0; {449#true} is VALID [2020-07-18 06:32:59,674 INFO L280 TraceCheckUtils]: 11: Hoare triple {449#true} assume !(~N~0 <= 0); {457#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:59,674 INFO L263 TraceCheckUtils]: 12: Hoare triple {457#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {449#true} is VALID [2020-07-18 06:32:59,674 INFO L280 TraceCheckUtils]: 13: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID [2020-07-18 06:32:59,675 INFO L280 TraceCheckUtils]: 14: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID [2020-07-18 06:32:59,675 INFO L280 TraceCheckUtils]: 15: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-18 06:32:59,676 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {449#true} {457#(<= 1 ~N~0)} #93#return; {457#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:59,677 INFO L280 TraceCheckUtils]: 17: Hoare triple {457#(<= 1 ~N~0)} havoc ~i~0; {457#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:59,678 INFO L280 TraceCheckUtils]: 18: Hoare triple {457#(<= 1 ~N~0)} SUMMARY for call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8); srcloc: L26 {457#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:59,679 INFO L280 TraceCheckUtils]: 19: Hoare triple {457#(<= 1 ~N~0)} SUMMARY for call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0); srcloc: L26-1 {457#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:59,680 INFO L280 TraceCheckUtils]: 20: Hoare triple {457#(<= 1 ~N~0)} ~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset; {457#(<= 1 ~N~0)} is VALID [2020-07-18 06:32:59,681 INFO L280 TraceCheckUtils]: 21: Hoare triple {457#(<= 1 ~N~0)} ~i~0 := 0; {462#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-18 06:32:59,682 INFO L280 TraceCheckUtils]: 22: Hoare triple {462#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {450#false} is VALID [2020-07-18 06:32:59,682 INFO L280 TraceCheckUtils]: 23: Hoare triple {450#false} ~i~0 := 0; {450#false} is VALID [2020-07-18 06:32:59,683 INFO L280 TraceCheckUtils]: 24: Hoare triple {450#false} assume !(~i~0 < ~N~0); {450#false} is VALID [2020-07-18 06:32:59,683 INFO L280 TraceCheckUtils]: 25: Hoare triple {450#false} SUMMARY for call #t~mem6 := read~int(~#sum~0.base, ~#sum~0.offset, 8); srcloc: L34-6 {450#false} is VALID [2020-07-18 06:32:59,684 INFO L263 TraceCheckUtils]: 26: Hoare triple {450#false} call __VERIFIER_assert((if #t~mem6 > 2 * ~N~0 then 1 else 0)); {450#false} is VALID [2020-07-18 06:32:59,684 INFO L280 TraceCheckUtils]: 27: Hoare triple {450#false} ~cond := #in~cond; {450#false} is VALID [2020-07-18 06:32:59,685 INFO L280 TraceCheckUtils]: 28: Hoare triple {450#false} assume 0 == ~cond; {450#false} is VALID [2020-07-18 06:32:59,685 INFO L280 TraceCheckUtils]: 29: Hoare triple {450#false} assume !false; {450#false} is VALID [2020-07-18 06:32:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-18 06:32:59,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1529282755] [2020-07-18 06:32:59,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 06:32:59,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 06:32:59,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626898835] [2020-07-18 06:32:59,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-18 06:32:59,692 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 06:32:59,692 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 06:32:59,733 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:32:59,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 06:32:59,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 06:32:59,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 06:32:59,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-18 06:32:59,735 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 5 states. [2020-07-18 06:33:00,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:33:00,225 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2020-07-18 06:33:00,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 06:33:00,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-18 06:33:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 06:33:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:33:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2020-07-18 06:33:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 06:33:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2020-07-18 06:33:00,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2020-07-18 06:33:00,341 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-18 06:33:00,343 INFO L225 Difference]: With dead ends: 71 [2020-07-18 06:33:00,344 INFO L226 Difference]: Without dead ends: 53 [2020-07-18 06:33:00,345 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-18 06:33:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-18 06:33:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2020-07-18 06:33:00,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 06:33:00,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 48 states. [2020-07-18 06:33:00,428 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 48 states. [2020-07-18 06:33:00,428 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 48 states. [2020-07-18 06:33:00,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:33:00,432 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-18 06:33:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-18 06:33:00,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:33:00,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:33:00,434 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 53 states. [2020-07-18 06:33:00,434 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 53 states. [2020-07-18 06:33:00,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 06:33:00,438 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-18 06:33:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-18 06:33:00,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 06:33:00,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 06:33:00,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 06:33:00,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 06:33:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-18 06:33:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2020-07-18 06:33:00,443 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 30 [2020-07-18 06:33:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 06:33:00,444 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2020-07-18 06:33:00,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 06:33:00,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 50 transitions. [2020-07-18 06:33:00,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 06:33:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2020-07-18 06:33:00,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-18 06:33:00,517 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 06:33:00,517 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-18 06:33:00,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 06:33:00,518 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 06:33:00,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 06:33:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1687643347, now seen corresponding path program 1 times [2020-07-18 06:33:00,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 06:33:00,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1978973029] [2020-07-18 06:33:00,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 06:33:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 06:33:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-18 06:33:00,639 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-18 06:33:00,640 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-18 06:33:00,640 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 06:33:00,708 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-18 06:33:00,708 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 06:33:00,708 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-18 06:33:00,709 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 06:33:00,709 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-18 06:33:00,709 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-18 06:33:00,709 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:33:00,709 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:33:00,709 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-18 06:33:00,709 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-18 06:33:00,710 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-18 06:33:00,710 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-18 06:33:00,710 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 06:33:00,710 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-18 06:33:00,710 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-18 06:33:00,710 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-18 06:33:00,710 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-18 06:33:00,711 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-18 06:33:00,711 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-18 06:33:00,711 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-18 06:33:00,711 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-18 06:33:00,711 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-18 06:33:00,711 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-18 06:33:00,711 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-18 06:33:00,712 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-18 06:33:00,712 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-18 06:33:00,712 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-18 06:33:00,712 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-18 06:33:00,712 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-18 06:33:00,712 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-18 06:33:00,712 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-18 06:33:00,713 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-18 06:33:00,713 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-18 06:33:00,713 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-18 06:33:00,713 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-18 06:33:00,713 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-18 06:33:00,713 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-18 06:33:00,713 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-18 06:33:00,714 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-18 06:33:00,714 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2020-07-18 06:33:00,714 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-18 06:33:00,714 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2020-07-18 06:33:00,714 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-18 06:33:00,714 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-18 06:33:00,714 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-18 06:33:00,715 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-18 06:33:00,715 WARN L170 areAnnotationChecker]: L29-6 has no Hoare annotation [2020-07-18 06:33:00,715 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-18 06:33:00,715 WARN L170 areAnnotationChecker]: L34-5 has no Hoare annotation [2020-07-18 06:33:00,715 WARN L170 areAnnotationChecker]: L34-5 has no Hoare annotation [2020-07-18 06:33:00,715 WARN L170 areAnnotationChecker]: L34-5 has no Hoare annotation [2020-07-18 06:33:00,715 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2020-07-18 06:33:00,715 WARN L170 areAnnotationChecker]: L34-6 has no Hoare annotation [2020-07-18 06:33:00,716 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-18 06:33:00,716 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-18 06:33:00,716 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-18 06:33:00,716 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-18 06:33:00,716 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-18 06:33:00,716 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-18 06:33:00,716 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-18 06:33:00,717 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-18 06:33:00,717 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2020-07-18 06:33:00,717 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-18 06:33:00,717 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2020-07-18 06:33:00,717 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2020-07-18 06:33:00,717 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2020-07-18 06:33:00,717 WARN L170 areAnnotationChecker]: L39-3 has no Hoare annotation [2020-07-18 06:33:00,718 WARN L170 areAnnotationChecker]: L39-4 has no Hoare annotation [2020-07-18 06:33:00,718 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 06:33:00,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 06:33:00 BoogieIcfgContainer [2020-07-18 06:33:00,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 06:33:00,726 INFO L168 Benchmark]: Toolchain (without parser) took 3675.92 ms. Allocated memory was 136.8 MB in the beginning and 251.1 MB in the end (delta: 114.3 MB). Free memory was 101.6 MB in the beginning and 167.9 MB in the end (delta: -66.4 MB). Peak memory consumption was 47.9 MB. Max. memory is 7.1 GB. [2020-07-18 06:33:00,726 INFO L168 Benchmark]: CDTParser took 1.07 ms. Allocated memory is still 136.8 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-18 06:33:00,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.16 ms. Allocated memory is still 136.8 MB. Free memory was 101.2 MB in the beginning and 90.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-18 06:33:00,728 INFO L168 Benchmark]: Boogie Preprocessor took 153.36 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 90.5 MB in the beginning and 178.8 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-18 06:33:00,729 INFO L168 Benchmark]: RCFGBuilder took 540.24 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 150.9 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2020-07-18 06:33:00,730 INFO L168 Benchmark]: TraceAbstraction took 2675.35 ms. Allocated memory was 201.3 MB in the beginning and 251.1 MB in the end (delta: 49.8 MB). Free memory was 150.9 MB in the beginning and 167.9 MB in the end (delta: -17.0 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. [2020-07-18 06:33:00,734 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 1.07 ms. Allocated memory is still 136.8 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 300.16 ms. Allocated memory is still 136.8 MB. Free memory was 101.2 MB in the beginning and 90.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 153.36 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 90.5 MB in the beginning and 178.8 MB in the end (delta: -88.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 540.24 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 150.9 MB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2675.35 ms. Allocated memory was 201.3 MB in the beginning and 251.1 MB in the end (delta: 49.8 MB). Free memory was 150.9 MB in the beginning and 167.9 MB in the end (delta: -17.0 MB). Peak memory consumption was 32.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=10, N=0] [L21] N = __VERIFIER_nondet_int() VAL [\old(N)=0, __VERIFIER_nondet_int()=1, N=1] [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=1] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=1] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=1] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=1] [L25] int i; VAL [\old(N)=0, N=1] [L26] long long sum[1]; VAL [\old(N)=0, N=1, sum={2:0}] [L27] int *a = malloc(sizeof(int)*N); VAL [\old(N)=0, a={-1:0}, malloc(sizeof(int)*N)={-1:0}, N=1, sum={2:0}] [L29] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=1, sum={2:0}] [L29] COND TRUE i 2*N) VAL [\old(cond)=0, \old(N)=0, N=1] [L13] COND TRUE !(cond) VAL [\old(cond)=0, \old(N)=0, cond=0, N=1] [L13] __VERIFIER_error() VAL [\old(cond)=0, \old(N)=0, cond=0, N=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 97 SDtfs, 62 SDslu, 25 SDs, 0 SdLazy, 110 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 101 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 2900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...