/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-8fc6572 [2020-07-10 15:29:04,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:29:04,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:29:04,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:29:04,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:29:04,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:29:04,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:29:04,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:29:04,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:29:04,824 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:29:04,825 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:29:04,826 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:29:04,826 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:29:04,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:29:04,829 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:29:04,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:29:04,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:29:04,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:29:04,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:29:04,835 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:29:04,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:29:04,838 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:29:04,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:29:04,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:29:04,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:29:04,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:29:04,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:29:04,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:29:04,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:29:04,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:29:04,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:29:04,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:29:04,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:29:04,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:29:04,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:29:04,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:29:04,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:29:04,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:29:04,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:29:04,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:29:04,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:29:04,854 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-10 15:29:04,869 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:29:04,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:29:04,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:29:04,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:29:04,871 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:29:04,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:29:04,872 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:29:04,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:29:04,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:29:04,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:29:04,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:29:04,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:29:04,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:29:04,873 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:29:04,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:29:04,874 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:29:04,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:29:04,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:29:04,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:29:04,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:29:04,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:29:04,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:29:04,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:29:04,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:29:04,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:29:04,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:29:04,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:29:04,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:29:04,876 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:29:04,876 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:29:05,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:29:05,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:29:05,217 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:29:05,219 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:29:05,219 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:29:05,220 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-10 15:29:05,327 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/163bc1b82/58cbfe2aba3b45d7a22b2cfc7dade04c/FLAG59d39e7a5 [2020-07-10 15:29:05,898 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:29:05,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005_variant.i [2020-07-10 15:29:05,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/163bc1b82/58cbfe2aba3b45d7a22b2cfc7dade04c/FLAG59d39e7a5 [2020-07-10 15:29:06,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/163bc1b82/58cbfe2aba3b45d7a22b2cfc7dade04c [2020-07-10 15:29:06,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:29:06,282 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:29:06,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:06,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:29:06,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:29:06,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:06" (1/1) ... [2020-07-10 15:29:06,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a6b2492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:06, skipping insertion in model container [2020-07-10 15:29:06,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:06" (1/1) ... [2020-07-10 15:29:06,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:29:06,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:29:06,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:06,555 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:29:06,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:06,595 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:29:06,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:06 WrapperNode [2020-07-10 15:29:06,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:06,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:29:06,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:29:06,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:29:06,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:06" (1/1) ... [2020-07-10 15:29:06,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:06" (1/1) ... [2020-07-10 15:29:06,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:06" (1/1) ... [2020-07-10 15:29:06,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:06" (1/1) ... [2020-07-10 15:29:06,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:06" (1/1) ... [2020-07-10 15:29:06,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:06" (1/1) ... [2020-07-10 15:29:06,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:06" (1/1) ... [2020-07-10 15:29:06,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:29:06,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:29:06,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:29:06,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:29:06,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:29:06,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:29:06,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:29:06,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:29:06,823 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:29:06,824 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:29:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:29:06,824 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:29:06,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:29:06,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:29:06,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:29:06,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:29:06,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:29:06,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:29:07,100 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:29:07,101 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:29:07,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:07 BoogieIcfgContainer [2020-07-10 15:29:07,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:29:07,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:29:07,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:29:07,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:29:07,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:29:06" (1/3) ... [2020-07-10 15:29:07,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c816ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:07, skipping insertion in model container [2020-07-10 15:29:07,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:06" (2/3) ... [2020-07-10 15:29:07,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60c816ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:07, skipping insertion in model container [2020-07-10 15:29:07,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:07" (3/3) ... [2020-07-10 15:29:07,120 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005_variant.i [2020-07-10 15:29:07,135 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:29:07,147 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:29:07,168 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:29:07,211 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:29:07,211 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:29:07,212 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:29:07,212 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:29:07,218 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:29:07,218 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:29:07,218 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:29:07,218 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:29:07,272 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-10 15:29:07,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-10 15:29:07,295 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:07,300 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:07,301 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:07,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:07,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1608903343, now seen corresponding path program 1 times [2020-07-10 15:29:07,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:07,360 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612717955] [2020-07-10 15:29:07,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:07,652 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-10 15:29:07,652 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22#true} {22#true} #44#return; {22#true} is VALID [2020-07-10 15:29:07,655 INFO L263 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2020-07-10 15:29:07,655 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-10 15:29:07,658 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #44#return; {22#true} is VALID [2020-07-10 15:29:07,659 INFO L263 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2020-07-10 15:29:07,659 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-10 15:29:07,662 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-10 15:29:07,663 INFO L280 TraceCheckUtils]: 6: Hoare triple {26#(< 0 main_~mid~0)} assume !(~mid~0 > 0); {23#false} is VALID [2020-07-10 15:29:07,664 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-10 15:29:07,664 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2020-07-10 15:29:07,664 INFO L280 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2020-07-10 15:29:07,665 INFO L280 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-10 15:29:07,666 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-10 15:29:07,667 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612717955] [2020-07-10 15:29:07,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:07,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:29:07,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209763580] [2020-07-10 15:29:07,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-10 15:29:07,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:07,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:29:07,728 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-10 15:29:07,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:29:07,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:07,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:29:07,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:29:07,741 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2020-07-10 15:29:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:07,871 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-07-10 15:29:07,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:29:07,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-10 15:29:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:29:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2020-07-10 15:29:07,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:29:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2020-07-10 15:29:07,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2020-07-10 15:29:07,968 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-10 15:29:07,981 INFO L225 Difference]: With dead ends: 32 [2020-07-10 15:29:07,981 INFO L226 Difference]: Without dead ends: 13 [2020-07-10 15:29:07,986 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-10 15:29:08,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-10 15:29:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-10 15:29:08,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:08,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:08,041 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:08,042 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:08,046 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-10 15:29:08,046 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-10 15:29:08,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:08,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:08,047 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:08,047 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-10 15:29:08,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:08,051 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-10 15:29:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-10 15:29:08,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:08,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:08,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:08,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:29:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2020-07-10 15:29:08,057 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2020-07-10 15:29:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:08,058 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2020-07-10 15:29:08,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:29:08,058 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-07-10 15:29:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 15:29:08,059 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:08,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:08,060 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:29:08,061 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:08,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:08,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1628066164, now seen corresponding path program 1 times [2020-07-10 15:29:08,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:08,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606654984] [2020-07-10 15:29:08,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:08,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {118#true} assume true; {118#true} is VALID [2020-07-10 15:29:08,453 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {118#true} {118#true} #44#return; {118#true} is VALID [2020-07-10 15:29:08,453 INFO L263 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {118#true} is VALID [2020-07-10 15:29:08,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {118#true} assume true; {118#true} is VALID [2020-07-10 15:29:08,454 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} #44#return; {118#true} is VALID [2020-07-10 15:29:08,455 INFO L263 TraceCheckUtils]: 3: Hoare triple {118#true} call #t~ret1 := main(); {118#true} is VALID [2020-07-10 15:29:08,456 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-10 15:29:08,460 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-10 15:29:08,463 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-10 15:29:08,466 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-10 15:29:08,470 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-10 15:29:08,472 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-10 15:29:08,474 INFO L280 TraceCheckUtils]: 10: Hoare triple {127#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {119#false} is VALID [2020-07-10 15:29:08,475 INFO L280 TraceCheckUtils]: 11: Hoare triple {119#false} assume !false; {119#false} is VALID [2020-07-10 15:29:08,477 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-10 15:29:08,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606654984] [2020-07-10 15:29:08,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68404620] [2020-07-10 15:29:08,479 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-10 15:29:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:08,525 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-10 15:29:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:08,540 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:08,828 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:29:08,857 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:29:08,863 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:29:08,975 INFO L263 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {118#true} is VALID [2020-07-10 15:29:08,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {118#true} assume true; {118#true} is VALID [2020-07-10 15:29:08,976 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} #44#return; {118#true} is VALID [2020-07-10 15:29:08,976 INFO L263 TraceCheckUtils]: 3: Hoare triple {118#true} call #t~ret1 := main(); {118#true} is VALID [2020-07-10 15:29:08,978 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-10 15:29:08,979 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-10 15:29:08,982 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-10 15:29:08,984 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-10 15:29:08,986 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-10 15:29:08,987 INFO L280 TraceCheckUtils]: 9: Hoare triple {158#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {162#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:08,989 INFO L280 TraceCheckUtils]: 10: Hoare triple {162#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {119#false} is VALID [2020-07-10 15:29:08,989 INFO L280 TraceCheckUtils]: 11: Hoare triple {119#false} assume !false; {119#false} is VALID [2020-07-10 15:29:08,991 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-10 15:29:08,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:08,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-10 15:29:08,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935928217] [2020-07-10 15:29:08,994 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2020-07-10 15:29:08,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:08,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 15:29:09,028 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-10 15:29:09,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 15:29:09,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:09,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 15:29:09,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:29:09,030 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2020-07-10 15:29:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:09,346 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-10 15:29:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:29:09,347 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2020-07-10 15:29:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:29:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2020-07-10 15:29:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:29:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2020-07-10 15:29:09,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 19 transitions. [2020-07-10 15:29:09,381 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-10 15:29:09,382 INFO L225 Difference]: With dead ends: 19 [2020-07-10 15:29:09,383 INFO L226 Difference]: Without dead ends: 14 [2020-07-10 15:29:09,384 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-10 15:29:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-10 15:29:09,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-10 15:29:09,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:09,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:09,401 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:09,401 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:09,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:09,404 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-10 15:29:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:29:09,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:09,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:09,405 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:09,405 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:09,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:09,407 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-10 15:29:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:29:09,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:09,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:09,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:09,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:29:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-07-10 15:29:09,410 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2020-07-10 15:29:09,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:09,411 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-07-10 15:29:09,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 15:29:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:29:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:29:09,412 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:09,413 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:09,627 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:29:09,627 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:09,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:09,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1105094223, now seen corresponding path program 2 times [2020-07-10 15:29:09,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:09,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969826624] [2020-07-10 15:29:09,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:09,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {253#true} assume true; {253#true} is VALID [2020-07-10 15:29:09,927 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {253#true} {253#true} #44#return; {253#true} is VALID [2020-07-10 15:29:09,927 INFO L263 TraceCheckUtils]: 0: Hoare triple {253#true} call ULTIMATE.init(); {253#true} is VALID [2020-07-10 15:29:09,928 INFO L280 TraceCheckUtils]: 1: Hoare triple {253#true} assume true; {253#true} is VALID [2020-07-10 15:29:09,928 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {253#true} {253#true} #44#return; {253#true} is VALID [2020-07-10 15:29:09,929 INFO L263 TraceCheckUtils]: 3: Hoare triple {253#true} call #t~ret1 := main(); {253#true} is VALID [2020-07-10 15:29:09,930 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-10 15:29:09,932 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-10 15:29:09,934 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-10 15:29:09,936 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-10 15:29:09,938 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-10 15:29:09,940 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-10 15:29:09,941 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-10 15:29:09,942 INFO L280 TraceCheckUtils]: 11: Hoare triple {262#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {254#false} is VALID [2020-07-10 15:29:09,943 INFO L280 TraceCheckUtils]: 12: Hoare triple {254#false} assume !false; {254#false} is VALID [2020-07-10 15:29:09,944 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-10 15:29:09,945 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969826624] [2020-07-10 15:29:09,945 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461763199] [2020-07-10 15:29:09,946 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) [2020-07-10 15:29:09,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:29:09,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:29:09,975 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 20 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:09,986 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:10,305 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:29:10,326 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:29:10,332 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:29:10,432 INFO L263 TraceCheckUtils]: 0: Hoare triple {253#true} call ULTIMATE.init(); {253#true} is VALID [2020-07-10 15:29:10,433 INFO L280 TraceCheckUtils]: 1: Hoare triple {253#true} assume true; {253#true} is VALID [2020-07-10 15:29:10,434 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {253#true} {253#true} #44#return; {253#true} is VALID [2020-07-10 15:29:10,434 INFO L263 TraceCheckUtils]: 3: Hoare triple {253#true} call #t~ret1 := main(); {253#true} is VALID [2020-07-10 15:29:10,439 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-10 15:29:10,440 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-10 15:29:10,442 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-10 15:29:10,445 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-10 15:29:10,450 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-10 15:29:10,452 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-10 15:29:10,453 INFO L280 TraceCheckUtils]: 10: Hoare triple {297#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {301#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:10,453 INFO L280 TraceCheckUtils]: 11: Hoare triple {301#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {254#false} is VALID [2020-07-10 15:29:10,454 INFO L280 TraceCheckUtils]: 12: Hoare triple {254#false} assume !false; {254#false} is VALID [2020-07-10 15:29:10,455 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-10 15:29:10,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:10,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-07-10 15:29:10,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712297320] [2020-07-10 15:29:10,457 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2020-07-10 15:29:10,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:10,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-10 15:29:10,497 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-10 15:29:10,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-10 15:29:10,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:10,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-10 15:29:10,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:29:10,499 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2020-07-10 15:29:10,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:10,977 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-07-10 15:29:10,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:29:10,980 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2020-07-10 15:29:10,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:29:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-07-10 15:29:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:29:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-07-10 15:29:10,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 17 transitions. [2020-07-10 15:29:11,015 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-10 15:29:11,016 INFO L225 Difference]: With dead ends: 16 [2020-07-10 15:29:11,016 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:29:11,017 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-10 15:29:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:29:11,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:29:11,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:11,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:11,018 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:11,018 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:11,018 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:11,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:11,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:11,019 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:11,019 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:11,019 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:11,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:11,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:11,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:11,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:29:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:29:11,020 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-07-10 15:29:11,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:11,021 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:29:11,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-10 15:29:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:11,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:11,221 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:11,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:29:11,393 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:29:11,394 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:11,394 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:11,394 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:29:11,394 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:29:11,394 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:29:11,394 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:11,394 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 15:29:11,395 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:11,395 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:11,395 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 26) the Hoare annotation is: true [2020-07-10 15:29:11,395 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 26) no Hoare annotation was computed. [2020-07-10 15:29:11,395 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-07-10 15:29:11,395 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-10 15:29:11,396 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-10 15:29:11,396 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-10 15:29:11,397 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 26) no Hoare annotation was computed. [2020-07-10 15:29:11,397 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 15:29:11,397 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:11,397 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-10 15:29:11,397 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-10 15:29:11,397 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:11,398 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-10 15:29:11,409 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:11,409 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:29:11,409 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:11,409 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:11,410 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:11,410 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:11,410 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:11,410 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:11,410 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:11,410 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:11,410 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:11,410 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:11,410 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:11,411 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:29:11,411 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:29:11,414 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:11,415 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:11,415 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-10 15:29:11,415 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:29:11,415 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:29:11,415 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:29:11,415 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-10 15:29:11,416 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-10 15:29:11,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:29:11 BoogieIcfgContainer [2020-07-10 15:29:11,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:29:11,440 INFO L168 Benchmark]: Toolchain (without parser) took 5158.51 ms. Allocated memory was 143.7 MB in the beginning and 249.0 MB in the end (delta: 105.4 MB). Free memory was 100.6 MB in the beginning and 90.7 MB in the end (delta: 9.9 MB). Peak memory consumption was 115.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:11,441 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 143.7 MB. Free memory is still 118.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:29:11,451 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.08 ms. Allocated memory is still 143.7 MB. Free memory was 100.6 MB in the beginning and 91.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:11,453 INFO L168 Benchmark]: Boogie Preprocessor took 43.99 ms. Allocated memory is still 143.7 MB. Free memory was 91.0 MB in the beginning and 89.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:11,454 INFO L168 Benchmark]: RCFGBuilder took 465.61 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 89.3 MB in the beginning and 164.3 MB in the end (delta: -75.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:11,456 INFO L168 Benchmark]: TraceAbstraction took 4328.12 ms. Allocated memory was 200.8 MB in the beginning and 249.0 MB in the end (delta: 48.2 MB). Free memory was 163.3 MB in the beginning and 90.7 MB in the end (delta: 72.6 MB). Peak memory consumption was 120.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:11,459 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.23 ms. Allocated memory is still 143.7 MB. Free memory is still 118.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 305.08 ms. Allocated memory is still 143.7 MB. Free memory was 100.6 MB in the beginning and 91.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.99 ms. Allocated memory is still 143.7 MB. Free memory was 91.0 MB in the beginning and 89.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 465.61 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 89.3 MB in the beginning and 164.3 MB in the end (delta: -75.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4328.12 ms. Allocated memory was 200.8 MB in the beginning and 249.0 MB in the end (delta: 48.2 MB). Free memory was 163.3 MB in the beginning and 90.7 MB in the end (delta: 72.6 MB). Peak memory consumption was 120.8 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: 4.0s, 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.1s SatisfiabilityAnalysisTime, 1.7s 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...