/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005_variant.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:51:50,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:51:50,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:51:50,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:51:50,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:51:50,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:51:50,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:51:50,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:51:50,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:51:50,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:51:50,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:51:50,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:51:50,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:51:50,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:51:50,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:51:50,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:51:50,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:51:50,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:51:50,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:51:50,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:51:50,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:51:50,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:51:50,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:51:50,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:51:50,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:51:50,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:51:50,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:51:50,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:51:50,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:51:50,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:51:50,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:51:50,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:51:50,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:51:50,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:51:50,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:51:50,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:51:50,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:51:50,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:51:50,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:51:50,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:51:50,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:51:50,121 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:51:50,147 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:51:50,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:51:50,151 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:51:50,151 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:51:50,152 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:51:50,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:51:50,152 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:51:50,152 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:51:50,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:51:50,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:51:50,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:51:50,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:51:50,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:51:50,155 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:51:50,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:51:50,156 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:51:50,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:51:50,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:51:50,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:51:50,156 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:51:50,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:51:50,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:51:50,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:51:50,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:51:50,158 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:51:50,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:51:50,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:51:50,159 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:51:50,159 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:51:50,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:51:50,487 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:51:50,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:51:50,513 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:51:50,515 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:51:50,516 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:51:50,517 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005_variant.i [2020-07-17 22:51:50,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43a127956/1fac4da7112e4494b5dfe18f3a48e978/FLAGc480d2ad0 [2020-07-17 22:51:51,141 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:51:51,142 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005_variant.i [2020-07-17 22:51:51,149 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43a127956/1fac4da7112e4494b5dfe18f3a48e978/FLAGc480d2ad0 [2020-07-17 22:51:51,508 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43a127956/1fac4da7112e4494b5dfe18f3a48e978 [2020-07-17 22:51:51,522 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:51:51,527 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:51:51,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:51,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:51:51,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:51:51,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:51" (1/1) ... [2020-07-17 22:51:51,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72978ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:51, skipping insertion in model container [2020-07-17 22:51:51,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:51" (1/1) ... [2020-07-17 22:51:51,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:51:51,568 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:51:51,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:51,765 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:51:51,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:51:51,804 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:51:51,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:51 WrapperNode [2020-07-17 22:51:51,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:51:51,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:51:51,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:51:51,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:51:51,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:51" (1/1) ... [2020-07-17 22:51:51,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:51" (1/1) ... [2020-07-17 22:51:51,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:51" (1/1) ... [2020-07-17 22:51:51,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:51" (1/1) ... [2020-07-17 22:51:51,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:51" (1/1) ... [2020-07-17 22:51:51,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:51" (1/1) ... [2020-07-17 22:51:51,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:51" (1/1) ... [2020-07-17 22:51:51,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:51:51,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:51:51,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:51:51,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:51:51,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:51" (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-17 22:51:52,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:51:52,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:51:52,010 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:51:52,010 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:51:52,010 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:51:52,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:51:52,010 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:51:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:51:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:51:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:51:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:51:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:51:52,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:51:52,275 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:51:52,276 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:51:52,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:52 BoogieIcfgContainer [2020-07-17 22:51:52,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:51:52,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:51:52,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:51:52,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:51:52,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:51:51" (1/3) ... [2020-07-17 22:51:52,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b11668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:52, skipping insertion in model container [2020-07-17 22:51:52,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:51" (2/3) ... [2020-07-17 22:51:52,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b11668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:52, skipping insertion in model container [2020-07-17 22:51:52,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:52" (3/3) ... [2020-07-17 22:51:52,294 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005_variant.i [2020-07-17 22:51:52,307 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:51:52,317 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:51:52,341 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:51:52,373 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:51:52,373 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:51:52,374 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:51:52,374 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:51:52,380 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:51:52,380 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:51:52,380 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:51:52,380 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:51:52,421 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-17 22:51:52,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-17 22:51:52,429 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:52,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:52,431 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:52,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:52,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1608903343, now seen corresponding path program 1 times [2020-07-17 22:51:52,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:52,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862241254] [2020-07-17 22:51:52,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:52,684 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-17 22:51:52,685 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22#true} {22#true} #44#return; {22#true} is VALID [2020-07-17 22:51:52,688 INFO L263 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2020-07-17 22:51:52,689 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-17 22:51:52,689 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #44#return; {22#true} is VALID [2020-07-17 22:51:52,690 INFO L263 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2020-07-17 22:51:52,690 INFO L280 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~mid~0 := #t~nondet0;havoc #t~nondet0; {22#true} is VALID [2020-07-17 22:51:52,695 INFO L280 TraceCheckUtils]: 5: Hoare triple {22#true} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {26#(< 0 main_~mid~0)} is VALID [2020-07-17 22:51:52,698 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#(< 0 main_~mid~0)} assume !(~mid~0 > 0); {23#false} is VALID [2020-07-17 22:51:52,698 INFO L263 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {23#false} is VALID [2020-07-17 22:51:52,699 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2020-07-17 22:51:52,699 INFO L280 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2020-07-17 22:51:52,699 INFO L280 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-17 22:51:52,701 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-17 22:51:52,702 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862241254] [2020-07-17 22:51:52,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:51:52,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:51:52,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711221859] [2020-07-17 22:51:52,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-17 22:51:52,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:52,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:51:52,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:52,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:51:52,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:52,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:51:52,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:51:52,794 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-07-17 22:51:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:52,940 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-17 22:51:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:51:52,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-17 22:51:52,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:51:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2020-07-17 22:51:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:51:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2020-07-17 22:51:52,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2020-07-17 22:51:53,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:53,046 INFO L225 Difference]: With dead ends: 32 [2020-07-17 22:51:53,046 INFO L226 Difference]: Without dead ends: 13 [2020-07-17 22:51:53,051 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-17 22:51:53,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-17 22:51:53,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-17 22:51:53,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:53,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-17 22:51:53,103 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-17 22:51:53,104 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-17 22:51:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:53,108 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-17 22:51:53,108 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-17 22:51:53,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:53,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:53,109 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-17 22:51:53,110 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-17 22:51:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:53,113 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-17 22:51:53,113 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-17 22:51:53,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:53,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:53,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:53,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:51:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2020-07-17 22:51:53,119 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2020-07-17 22:51:53,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:53,120 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2020-07-17 22:51:53,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:51:53,121 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-17 22:51:53,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-17 22:51:53,121 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:53,122 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:53,122 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:51:53,123 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:53,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:53,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1628066164, now seen corresponding path program 1 times [2020-07-17 22:51:53,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:53,124 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476950349] [2020-07-17 22:51:53,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:53,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {118#true} assume true; {118#true} is VALID [2020-07-17 22:51:53,387 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {118#true} {118#true} #44#return; {118#true} is VALID [2020-07-17 22:51:53,387 INFO L263 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {118#true} is VALID [2020-07-17 22:51:53,388 INFO L280 TraceCheckUtils]: 1: Hoare triple {118#true} assume true; {118#true} is VALID [2020-07-17 22:51:53,388 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} #44#return; {118#true} is VALID [2020-07-17 22:51:53,389 INFO L263 TraceCheckUtils]: 3: Hoare triple {118#true} call #t~ret1 := main(); {118#true} is VALID [2020-07-17 22:51:53,390 INFO L280 TraceCheckUtils]: 4: Hoare triple {118#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~mid~0 := #t~nondet0;havoc #t~nondet0; {122#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2020-07-17 22:51:53,392 INFO L280 TraceCheckUtils]: 5: Hoare triple {122#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {123#(and (<= (+ main_~lo~0 2) main_~hi~0) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)))} is VALID [2020-07-17 22:51:53,395 INFO L280 TraceCheckUtils]: 6: Hoare triple {123#(and (<= (+ main_~lo~0 2) main_~hi~0) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {124#(and (or (< main_~hi~0 (+ main_~lo~0 1)) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0))) (<= main_~lo~0 main_~hi~0))} is VALID [2020-07-17 22:51:53,398 INFO L280 TraceCheckUtils]: 7: Hoare triple {124#(and (or (< main_~hi~0 (+ main_~lo~0 1)) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0))) (<= main_~lo~0 main_~hi~0))} assume !(~mid~0 > 0); {125#(and (<= main_~hi~0 main_~lo~0) (<= main_~lo~0 main_~hi~0))} is VALID [2020-07-17 22:51:53,401 INFO L263 TraceCheckUtils]: 8: Hoare triple {125#(and (<= main_~hi~0 main_~lo~0) (<= main_~lo~0 main_~hi~0))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {126#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:53,402 INFO L280 TraceCheckUtils]: 9: Hoare triple {126#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {127#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:53,404 INFO L280 TraceCheckUtils]: 10: Hoare triple {127#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {119#false} is VALID [2020-07-17 22:51:53,404 INFO L280 TraceCheckUtils]: 11: Hoare triple {119#false} assume !false; {119#false} is VALID [2020-07-17 22:51:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:53,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476950349] [2020-07-17 22:51:53,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646455931] [2020-07-17 22:51:53,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:53,452 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-17 22:51:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:53,467 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:53,811 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:51:53,846 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-17 22:51:53,854 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-17 22:51:53,963 INFO L263 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {118#true} is VALID [2020-07-17 22:51:53,963 INFO L280 TraceCheckUtils]: 1: Hoare triple {118#true} assume true; {118#true} is VALID [2020-07-17 22:51:53,964 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} #44#return; {118#true} is VALID [2020-07-17 22:51:53,964 INFO L263 TraceCheckUtils]: 3: Hoare triple {118#true} call #t~ret1 := main(); {118#true} is VALID [2020-07-17 22:51:53,965 INFO L280 TraceCheckUtils]: 4: Hoare triple {118#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~mid~0 := #t~nondet0;havoc #t~nondet0; {122#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2020-07-17 22:51:53,967 INFO L280 TraceCheckUtils]: 5: Hoare triple {122#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {146#(and (< 0 main_~mid~0) (<= main_~lo~0 0) (<= 0 main_~lo~0) (= (* 2 main_~mid~0) main_~hi~0))} is VALID [2020-07-17 22:51:53,969 INFO L280 TraceCheckUtils]: 6: Hoare triple {146#(and (< 0 main_~mid~0) (<= main_~lo~0 0) (<= 0 main_~lo~0) (= (* 2 main_~mid~0) main_~hi~0))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {150#(and (<= main_~lo~0 1) (<= (div (+ main_~hi~0 1) 2) (+ main_~mid~0 1)) (<= 1 main_~lo~0) (< 0 (div (+ main_~hi~0 1) 2)) (= 0 (mod (+ main_~hi~0 1) 2)))} is VALID [2020-07-17 22:51:53,971 INFO L280 TraceCheckUtils]: 7: Hoare triple {150#(and (<= main_~lo~0 1) (<= (div (+ main_~hi~0 1) 2) (+ main_~mid~0 1)) (<= 1 main_~lo~0) (< 0 (div (+ main_~hi~0 1) 2)) (= 0 (mod (+ main_~hi~0 1) 2)))} assume !(~mid~0 > 0); {154#(and (<= (div (+ main_~hi~0 1) 2) 1) (<= main_~lo~0 1) (<= 1 main_~lo~0) (< 0 (div (+ main_~hi~0 1) 2)) (= 0 (mod (+ main_~hi~0 1) 2)))} is VALID [2020-07-17 22:51:53,973 INFO L263 TraceCheckUtils]: 8: Hoare triple {154#(and (<= (div (+ main_~hi~0 1) 2) 1) (<= main_~lo~0 1) (<= 1 main_~lo~0) (< 0 (div (+ main_~hi~0 1) 2)) (= 0 (mod (+ main_~hi~0 1) 2)))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {158#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:51:53,974 INFO L280 TraceCheckUtils]: 9: Hoare triple {158#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {162#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:51:53,975 INFO L280 TraceCheckUtils]: 10: Hoare triple {162#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {119#false} is VALID [2020-07-17 22:51:53,976 INFO L280 TraceCheckUtils]: 11: Hoare triple {119#false} assume !false; {119#false} is VALID [2020-07-17 22:51:53,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:53,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:53,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-17 22:51:53,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189238741] [2020-07-17 22:51:53,980 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2020-07-17 22:51:53,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:53,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-17 22:51:54,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:54,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 22:51:54,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:54,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 22:51:54,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:51:54,019 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2020-07-17 22:51:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:54,361 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-17 22:51:54,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:51:54,362 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2020-07-17 22:51:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:54,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:51:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2020-07-17 22:51:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:51:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2020-07-17 22:51:54,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 19 transitions. [2020-07-17 22:51:54,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:54,404 INFO L225 Difference]: With dead ends: 19 [2020-07-17 22:51:54,404 INFO L226 Difference]: Without dead ends: 14 [2020-07-17 22:51:54,409 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-07-17 22:51:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-17 22:51:54,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-17 22:51:54,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:54,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-17 22:51:54,427 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-17 22:51:54,427 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-17 22:51:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:54,429 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-17 22:51:54,429 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-17 22:51:54,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:54,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:54,431 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-17 22:51:54,431 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-17 22:51:54,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:54,435 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-17 22:51:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-17 22:51:54,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:54,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:54,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:54,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:51:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-07-17 22:51:54,440 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2020-07-17 22:51:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:54,441 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-07-17 22:51:54,441 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 22:51:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-17 22:51:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:51:54,442 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:51:54,442 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:51:54,658 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:51:54,659 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:51:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:51:54,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1105094223, now seen corresponding path program 2 times [2020-07-17 22:51:54,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:51:54,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703690344] [2020-07-17 22:51:54,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:51:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:54,869 INFO L280 TraceCheckUtils]: 0: Hoare triple {253#true} assume true; {253#true} is VALID [2020-07-17 22:51:54,870 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {253#true} {253#true} #44#return; {253#true} is VALID [2020-07-17 22:51:54,870 INFO L263 TraceCheckUtils]: 0: Hoare triple {253#true} call ULTIMATE.init(); {253#true} is VALID [2020-07-17 22:51:54,871 INFO L280 TraceCheckUtils]: 1: Hoare triple {253#true} assume true; {253#true} is VALID [2020-07-17 22:51:54,871 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {253#true} {253#true} #44#return; {253#true} is VALID [2020-07-17 22:51:54,871 INFO L263 TraceCheckUtils]: 3: Hoare triple {253#true} call #t~ret1 := main(); {253#true} is VALID [2020-07-17 22:51:54,873 INFO L280 TraceCheckUtils]: 4: Hoare triple {253#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~mid~0 := #t~nondet0;havoc #t~nondet0; {257#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2020-07-17 22:51:54,875 INFO L280 TraceCheckUtils]: 5: Hoare triple {257#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {258#(and (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ (* 2 main_~mid~0) main_~lo~0) main_~hi~0))} is VALID [2020-07-17 22:51:54,876 INFO L280 TraceCheckUtils]: 6: Hoare triple {258#(and (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ (* 2 main_~mid~0) main_~lo~0) main_~hi~0))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {258#(and (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ (* 2 main_~mid~0) main_~lo~0) main_~hi~0))} is VALID [2020-07-17 22:51:54,878 INFO L280 TraceCheckUtils]: 7: Hoare triple {258#(and (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0)) (<= (+ (* 2 main_~mid~0) main_~lo~0) main_~hi~0))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {259#(and (or (< main_~hi~0 (+ main_~lo~0 1)) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0))) (<= main_~lo~0 main_~hi~0))} is VALID [2020-07-17 22:51:54,880 INFO L280 TraceCheckUtils]: 8: Hoare triple {259#(and (or (< main_~hi~0 (+ main_~lo~0 1)) (<= main_~hi~0 (+ (* 2 main_~mid~0) main_~lo~0))) (<= main_~lo~0 main_~hi~0))} assume !(~mid~0 > 0); {260#(and (<= main_~hi~0 main_~lo~0) (<= main_~lo~0 main_~hi~0))} is VALID [2020-07-17 22:51:54,882 INFO L263 TraceCheckUtils]: 9: Hoare triple {260#(and (<= main_~hi~0 main_~lo~0) (<= main_~lo~0 main_~hi~0))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {261#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:51:54,883 INFO L280 TraceCheckUtils]: 10: Hoare triple {261#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {262#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:51:54,885 INFO L280 TraceCheckUtils]: 11: Hoare triple {262#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {254#false} is VALID [2020-07-17 22:51:54,885 INFO L280 TraceCheckUtils]: 12: Hoare triple {254#false} assume !false; {254#false} is VALID [2020-07-17 22:51:54,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:51:54,887 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703690344] [2020-07-17 22:51:54,887 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273305816] [2020-07-17 22:51:54,888 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:54,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:51:54,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:51:54,919 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-17 22:51:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:51:54,930 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:51:55,216 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:51:55,229 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-17 22:51:55,235 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-17 22:51:55,323 INFO L263 TraceCheckUtils]: 0: Hoare triple {253#true} call ULTIMATE.init(); {253#true} is VALID [2020-07-17 22:51:55,324 INFO L280 TraceCheckUtils]: 1: Hoare triple {253#true} assume true; {253#true} is VALID [2020-07-17 22:51:55,324 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {253#true} {253#true} #44#return; {253#true} is VALID [2020-07-17 22:51:55,324 INFO L263 TraceCheckUtils]: 3: Hoare triple {253#true} call #t~ret1 := main(); {253#true} is VALID [2020-07-17 22:51:55,326 INFO L280 TraceCheckUtils]: 4: Hoare triple {253#true} havoc ~lo~0;havoc ~mid~0;havoc ~hi~0;~lo~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~mid~0 := #t~nondet0;havoc #t~nondet0; {257#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} is VALID [2020-07-17 22:51:55,328 INFO L280 TraceCheckUtils]: 5: Hoare triple {257#(and (<= main_~lo~0 0) (<= 0 main_~lo~0))} assume !!(~mid~0 > 0 && ~mid~0 <= 1000000);~hi~0 := 2 * ~mid~0; {281#(and (<= main_~lo~0 0) (<= 0 main_~lo~0) (= (* 2 main_~mid~0) main_~hi~0))} is VALID [2020-07-17 22:51:55,329 INFO L280 TraceCheckUtils]: 6: Hoare triple {281#(and (<= main_~lo~0 0) (<= 0 main_~lo~0) (= (* 2 main_~mid~0) main_~hi~0))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {285#(and (<= main_~lo~0 1) (<= 1 main_~lo~0) (= (+ (* 2 main_~mid~0) 1) main_~hi~0))} is VALID [2020-07-17 22:51:55,331 INFO L280 TraceCheckUtils]: 7: Hoare triple {285#(and (<= main_~lo~0 1) (<= 1 main_~lo~0) (= (+ (* 2 main_~mid~0) 1) main_~hi~0))} assume !!(~mid~0 > 0);~lo~0 := 1 + ~lo~0;~hi~0 := ~hi~0 - 1;~mid~0 := ~mid~0 - 1; {289#(and (<= 2 main_~lo~0) (<= main_~lo~0 2) (< 0 (div main_~hi~0 2)) (= 0 (mod main_~hi~0 2)) (<= (div main_~hi~0 2) (+ main_~mid~0 1)))} is VALID [2020-07-17 22:51:55,336 INFO L280 TraceCheckUtils]: 8: Hoare triple {289#(and (<= 2 main_~lo~0) (<= main_~lo~0 2) (< 0 (div main_~hi~0 2)) (= 0 (mod main_~hi~0 2)) (<= (div main_~hi~0 2) (+ main_~mid~0 1)))} assume !(~mid~0 > 0); {293#(and (<= 2 main_~lo~0) (<= (div main_~hi~0 2) 1) (<= main_~lo~0 2) (< 0 (div main_~hi~0 2)) (= 0 (mod main_~hi~0 2)))} is VALID [2020-07-17 22:51:55,339 INFO L263 TraceCheckUtils]: 9: Hoare triple {293#(and (<= 2 main_~lo~0) (<= (div main_~hi~0 2) 1) (<= main_~lo~0 2) (< 0 (div main_~hi~0 2)) (= 0 (mod main_~hi~0 2)))} call __VERIFIER_assert((if ~lo~0 == ~hi~0 then 1 else 0)); {297#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:51:55,340 INFO L280 TraceCheckUtils]: 10: Hoare triple {297#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {301#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:51:55,341 INFO L280 TraceCheckUtils]: 11: Hoare triple {301#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {254#false} is VALID [2020-07-17 22:51:55,341 INFO L280 TraceCheckUtils]: 12: Hoare triple {254#false} assume !false; {254#false} is VALID [2020-07-17 22:51:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:51:55,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:51:55,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-07-17 22:51:55,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920273156] [2020-07-17 22:51:55,347 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2020-07-17 22:51:55,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:51:55,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-17 22:51:55,384 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:55,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 22:51:55,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:51:55,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 22:51:55,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-07-17 22:51:55,386 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2020-07-17 22:51:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:55,841 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-07-17 22:51:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:51:55,841 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2020-07-17 22:51:55,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:51:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:51:55,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-07-17 22:51:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-17 22:51:55,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-07-17 22:51:55,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 17 transitions. [2020-07-17 22:51:55,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:51:55,872 INFO L225 Difference]: With dead ends: 16 [2020-07-17 22:51:55,872 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:51:55,873 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-07-17 22:51:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:51:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:51:55,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:51:55,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:55,874 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:55,874 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:55,875 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:55,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:55,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:55,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:55,876 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:55,876 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:51:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:51:55,876 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:51:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:55,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:55,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:51:55,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:51:55,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:51:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:51:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:51:55,878 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-07-17 22:51:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:51:55,878 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:51:55,878 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 22:51:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:51:55,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:51:56,088 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:51:56,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:51:56,260 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:51:56,260 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:56,260 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:51:56,260 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:51:56,260 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:51:56,261 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:51:56,261 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:56,261 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-17 22:51:56,261 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:56,261 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-17 22:51:56,261 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 26) the Hoare annotation is: true [2020-07-17 22:51:56,261 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 26) no Hoare annotation was computed. [2020-07-17 22:51:56,262 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-07-17 22:51:56,262 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-17 22:51:56,262 INFO L264 CegarLoopResult]: At program point L19-2(lines 19 23) the Hoare annotation is: (let ((.cse0 (+ (* 2 main_~mid~0) main_~lo~0))) (and (<= main_~hi~0 .cse0) (<= .cse0 main_~hi~0) (<= main_~lo~0 main_~hi~0))) [2020-07-17 22:51:56,262 INFO L264 CegarLoopResult]: At program point L19-3(lines 19 23) the Hoare annotation is: (or (let ((.cse0 (+ (* 2 main_~mid~0) main_~lo~0))) (and (<= main_~hi~0 main_~lo~0) (<= main_~hi~0 .cse0) (<= .cse0 main_~hi~0) (<= main_~lo~0 main_~hi~0))) (let ((.cse2 (+ main_~hi~0 1))) (let ((.cse1 (div .cse2 2))) (and (<= .cse1 1) (<= main_~lo~0 1) (<= .cse1 (+ main_~mid~0 1)) (<= 1 main_~lo~0) (< 0 .cse1) (= 0 (mod .cse2 2)))))) [2020-07-17 22:51:56,262 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 26) no Hoare annotation was computed. [2020-07-17 22:51:56,263 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-17 22:51:56,263 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:51:56,263 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-17 22:51:56,263 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-17 22:51:56,263 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-17 22:51:56,263 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-17 22:51:56,268 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:56,269 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:51:56,269 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-17 22:51:56,269 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:56,269 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:51:56,269 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:56,269 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:56,270 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:51:56,270 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-17 22:51:56,270 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-17 22:51:56,270 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:56,270 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:51:56,270 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:51:56,270 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:51:56,270 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:51:56,274 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:51:56,274 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-17 22:51:56,274 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-17 22:51:56,275 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:51:56,275 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-17 22:51:56,275 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:51:56,275 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-17 22:51:56,275 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:51:56,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:51:56 BoogieIcfgContainer [2020-07-17 22:51:56,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:51:56,292 INFO L168 Benchmark]: Toolchain (without parser) took 4766.93 ms. Allocated memory was 137.4 MB in the beginning and 251.7 MB in the end (delta: 114.3 MB). Free memory was 101.1 MB in the beginning and 92.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 123.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:56,294 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-17 22:51:56,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.15 ms. Allocated memory is still 137.4 MB. Free memory was 100.6 MB in the beginning and 90.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:56,296 INFO L168 Benchmark]: Boogie Preprocessor took 127.86 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 90.6 MB in the beginning and 181.5 MB in the end (delta: -90.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:56,296 INFO L168 Benchmark]: RCFGBuilder took 348.24 ms. Allocated memory is still 202.4 MB. Free memory was 181.5 MB in the beginning and 165.7 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:56,297 INFO L168 Benchmark]: TraceAbstraction took 4004.43 ms. Allocated memory was 202.4 MB in the beginning and 251.7 MB in the end (delta: 49.3 MB). Free memory was 165.0 MB in the beginning and 92.3 MB in the end (delta: 72.7 MB). Peak memory consumption was 122.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:51:56,319 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.24 ms. Allocated memory is still 137.4 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 277.15 ms. Allocated memory is still 137.4 MB. Free memory was 100.6 MB in the beginning and 90.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.86 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 90.6 MB in the beginning and 181.5 MB in the end (delta: -90.8 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 348.24 ms. Allocated memory is still 202.4 MB. Free memory was 181.5 MB in the beginning and 165.7 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4004.43 ms. Allocated memory was 202.4 MB in the beginning and 251.7 MB in the end (delta: 49.3 MB). Free memory was 165.0 MB in the beginning and 92.3 MB in the end (delta: 72.7 MB). Peak memory consumption was 122.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (hi <= 2 * mid + lo && 2 * mid + lo <= hi) && lo <= hi - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.7s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 35 SDtfs, 11 SDslu, 115 SDs, 0 SdLazy, 91 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 16 NumberOfFragments, 82 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 120 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 3716 SizeOfPredicates, 6 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1/8 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 correct! Received shutdown request...