java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:33:07,635 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:33:07,638 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:33:07,650 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:33:07,650 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:33:07,651 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:33:07,652 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:33:07,654 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:33:07,656 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:33:07,657 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:33:07,659 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:33:07,659 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:33:07,660 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:33:07,661 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:33:07,662 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:33:07,663 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:33:07,664 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:33:07,665 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:33:07,667 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:33:07,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:33:07,675 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:33:07,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:33:07,685 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:33:07,686 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:33:07,686 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:33:07,687 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:33:07,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:33:07,688 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:33:07,691 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:33:07,695 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:33:07,695 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:33:07,696 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:33:07,696 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:33:07,696 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:33:07,697 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:33:07,698 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:33:07,698 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:33:07,728 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:33:07,728 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:33:07,729 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:33:07,729 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:33:07,729 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:33:07,730 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:33:07,730 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:33:07,731 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:33:07,731 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:33:07,731 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:33:07,731 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:33:07,732 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:33:07,732 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:33:07,732 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:33:07,732 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:33:07,732 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:33:07,733 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:33:07,733 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:33:07,733 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:33:07,733 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:33:07,733 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:33:07,734 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:33:07,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:33:07,734 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:33:07,734 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:33:07,734 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:33:07,735 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:33:07,735 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:33:07,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:33:07,735 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:33:07,802 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:33:07,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:33:07,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:33:07,827 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:33:07,827 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:33:07,828 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call1_true-termination.i [2018-11-14 17:33:07,893 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1a9291d/912fe05dbcdf40198163c418fc127db9/FLAGa9f8817d8 [2018-11-14 17:33:08,284 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:33:08,285 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call1_true-termination.i [2018-11-14 17:33:08,291 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1a9291d/912fe05dbcdf40198163c418fc127db9/FLAGa9f8817d8 [2018-11-14 17:33:08,307 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad1a9291d/912fe05dbcdf40198163c418fc127db9 [2018-11-14 17:33:08,318 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:33:08,320 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:33:08,320 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:33:08,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:33:08,324 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:33:08,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:33:08" (1/1) ... [2018-11-14 17:33:08,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45586159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:08, skipping insertion in model container [2018-11-14 17:33:08,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:33:08" (1/1) ... [2018-11-14 17:33:08,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:33:08,362 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:33:08,590 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:33:08,597 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:33:08,616 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:33:08,636 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:33:08,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:08 WrapperNode [2018-11-14 17:33:08,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:33:08,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:33:08,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:33:08,638 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:33:08,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:08" (1/1) ... [2018-11-14 17:33:08,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:08" (1/1) ... [2018-11-14 17:33:08,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:08" (1/1) ... [2018-11-14 17:33:08,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:08" (1/1) ... [2018-11-14 17:33:08,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:08" (1/1) ... [2018-11-14 17:33:08,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:08" (1/1) ... [2018-11-14 17:33:08,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:08" (1/1) ... [2018-11-14 17:33:08,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:33:08,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:33:08,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:33:08,679 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:33:08,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:08" (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 [2018-11-14 17:33:08,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:33:08,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:33:08,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:33:08,817 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:33:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:33:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:33:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:33:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:33:08,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:33:09,351 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:33:09,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:33:09 BoogieIcfgContainer [2018-11-14 17:33:09,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:33:09,352 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:33:09,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:33:09,357 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:33:09,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:33:08" (1/3) ... [2018-11-14 17:33:09,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660c349f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:33:09, skipping insertion in model container [2018-11-14 17:33:09,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:33:08" (2/3) ... [2018-11-14 17:33:09,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660c349f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:33:09, skipping insertion in model container [2018-11-14 17:33:09,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:33:09" (3/3) ... [2018-11-14 17:33:09,362 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_true-unreach-call1_true-termination.i [2018-11-14 17:33:09,373 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:33:09,383 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:33:09,398 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:33:09,427 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:33:09,428 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:33:09,428 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:33:09,428 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:33:09,428 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:33:09,428 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:33:09,429 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:33:09,429 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:33:09,429 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:33:09,448 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-14 17:33:09,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 17:33:09,455 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:09,456 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:09,458 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:09,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:09,464 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-14 17:33:09,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:09,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:09,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:09,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:09,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:09,584 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-14 17:33:09,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-14 17:33:09,588 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-14 17:33:09,588 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2018-11-14 17:33:09,589 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 0;~y~0 := 1; {21#true} is VALID [2018-11-14 17:33:09,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-14 17:33:09,590 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {22#false} is VALID [2018-11-14 17:33:09,591 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-14 17:33:09,591 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume ~cond == 0; {22#false} is VALID [2018-11-14 17:33:09,591 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-14 17:33:09,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:09,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:33:09,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:33:09,601 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 17:33:09,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:09,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:33:09,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:09,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:33:09,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:33:09,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:33:09,673 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-14 17:33:09,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:09,752 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 17:33:09,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:33:09,753 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 17:33:09,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:09,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:33:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-14 17:33:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:33:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-14 17:33:09,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2018-11-14 17:33:09,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:09,954 INFO L225 Difference]: With dead ends: 29 [2018-11-14 17:33:09,954 INFO L226 Difference]: Without dead ends: 12 [2018-11-14 17:33:09,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:33:09,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-14 17:33:10,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-14 17:33:10,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:10,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-14 17:33:10,075 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 17:33:10,076 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 17:33:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:10,079 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 17:33:10,079 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 17:33:10,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:10,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:10,080 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 17:33:10,080 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 17:33:10,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:10,083 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 17:33:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 17:33:10,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:10,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:10,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:10,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:10,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:33:10,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-14 17:33:10,089 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-14 17:33:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:10,090 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-14 17:33:10,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:33:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 17:33:10,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 17:33:10,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:10,091 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:10,091 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:10,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:10,092 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-14 17:33:10,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:10,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:10,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:10,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:10,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:10,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {106#true} is VALID [2018-11-14 17:33:10,337 INFO L273 TraceCheckUtils]: 1: Hoare triple {106#true} assume true; {106#true} is VALID [2018-11-14 17:33:10,337 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} #32#return; {106#true} is VALID [2018-11-14 17:33:10,337 INFO L256 TraceCheckUtils]: 3: Hoare triple {106#true} call #t~ret1 := main(); {106#true} is VALID [2018-11-14 17:33:10,341 INFO L273 TraceCheckUtils]: 4: Hoare triple {106#true} ~x~0 := 0;~y~0 := 1; {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:10,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:10,346 INFO L273 TraceCheckUtils]: 6: Hoare triple {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {107#false} is VALID [2018-11-14 17:33:10,346 INFO L256 TraceCheckUtils]: 7: Hoare triple {107#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {107#false} is VALID [2018-11-14 17:33:10,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {107#false} ~cond := #in~cond; {107#false} is VALID [2018-11-14 17:33:10,347 INFO L273 TraceCheckUtils]: 9: Hoare triple {107#false} assume ~cond == 0; {107#false} is VALID [2018-11-14 17:33:10,347 INFO L273 TraceCheckUtils]: 10: Hoare triple {107#false} assume !false; {107#false} is VALID [2018-11-14 17:33:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:10,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:33:10,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:33:10,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 17:33:10,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:10,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:33:10,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:10,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:33:10,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:33:10,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:33:10,395 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-14 17:33:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:10,526 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 17:33:10,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:33:10,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 17:33:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:33:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-14 17:33:10,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:33:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-14 17:33:10,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2018-11-14 17:33:10,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:10,632 INFO L225 Difference]: With dead ends: 19 [2018-11-14 17:33:10,632 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 17:33:10,633 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:33:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 17:33:10,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 17:33:10,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:10,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 17:33:10,691 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 17:33:10,691 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 17:33:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:10,693 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 17:33:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 17:33:10,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:10,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:10,694 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 17:33:10,694 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 17:33:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:10,696 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 17:33:10,696 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 17:33:10,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:10,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:10,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:10,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:33:10,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-14 17:33:10,699 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-14 17:33:10,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:10,700 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-14 17:33:10,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:33:10,700 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 17:33:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 17:33:10,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:10,701 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:10,701 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:10,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:10,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-14 17:33:10,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:10,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:10,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:10,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:10,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:10,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2018-11-14 17:33:10,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2018-11-14 17:33:10,877 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #32#return; {190#true} is VALID [2018-11-14 17:33:10,877 INFO L256 TraceCheckUtils]: 3: Hoare triple {190#true} call #t~ret1 := main(); {190#true} is VALID [2018-11-14 17:33:10,878 INFO L273 TraceCheckUtils]: 4: Hoare triple {190#true} ~x~0 := 0;~y~0 := 1; {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:10,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:10,881 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {193#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:33:10,883 INFO L273 TraceCheckUtils]: 7: Hoare triple {193#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {193#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:33:10,886 INFO L273 TraceCheckUtils]: 8: Hoare triple {193#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 6); {191#false} is VALID [2018-11-14 17:33:10,886 INFO L256 TraceCheckUtils]: 9: Hoare triple {191#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {191#false} is VALID [2018-11-14 17:33:10,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2018-11-14 17:33:10,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {191#false} assume ~cond == 0; {191#false} is VALID [2018-11-14 17:33:10,887 INFO L273 TraceCheckUtils]: 12: Hoare triple {191#false} assume !false; {191#false} is VALID [2018-11-14 17:33:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:10,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:10,890 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:10,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:10,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:11,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2018-11-14 17:33:11,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2018-11-14 17:33:11,063 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #32#return; {190#true} is VALID [2018-11-14 17:33:11,063 INFO L256 TraceCheckUtils]: 3: Hoare triple {190#true} call #t~ret1 := main(); {190#true} is VALID [2018-11-14 17:33:11,068 INFO L273 TraceCheckUtils]: 4: Hoare triple {190#true} ~x~0 := 0;~y~0 := 1; {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:11,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:11,069 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {215#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:11,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {215#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {215#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:11,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {191#false} is VALID [2018-11-14 17:33:11,071 INFO L256 TraceCheckUtils]: 9: Hoare triple {191#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {191#false} is VALID [2018-11-14 17:33:11,071 INFO L273 TraceCheckUtils]: 10: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2018-11-14 17:33:11,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {191#false} assume ~cond == 0; {191#false} is VALID [2018-11-14 17:33:11,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {191#false} assume !false; {191#false} is VALID [2018-11-14 17:33:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:11,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:11,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 17:33:11,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 17:33:11,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:11,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:33:11,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:11,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:33:11,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:33:11,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:33:11,280 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 5 states. [2018-11-14 17:33:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:11,653 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 17:33:11,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:33:11,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 17:33:11,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:33:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-14 17:33:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:33:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-14 17:33:11,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2018-11-14 17:33:11,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:11,761 INFO L225 Difference]: With dead ends: 21 [2018-11-14 17:33:11,761 INFO L226 Difference]: Without dead ends: 16 [2018-11-14 17:33:11,761 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:33:11,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-14 17:33:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-14 17:33:11,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:11,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-14 17:33:11,786 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 17:33:11,786 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 17:33:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:11,788 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 17:33:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 17:33:11,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:11,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:11,789 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 17:33:11,789 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 17:33:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:11,791 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 17:33:11,791 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 17:33:11,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:11,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:11,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:11,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:33:11,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-14 17:33:11,794 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-14 17:33:11,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:11,794 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-14 17:33:11,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:33:11,794 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 17:33:11,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:33:11,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:11,795 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:11,796 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:11,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:11,796 INFO L82 PathProgramCache]: Analyzing trace with hash -720896604, now seen corresponding path program 2 times [2018-11-14 17:33:11,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:11,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:11,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:11,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:11,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:11,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2018-11-14 17:33:11,983 INFO L273 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2018-11-14 17:33:11,983 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #32#return; {322#true} is VALID [2018-11-14 17:33:11,983 INFO L256 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret1 := main(); {322#true} is VALID [2018-11-14 17:33:11,989 INFO L273 TraceCheckUtils]: 4: Hoare triple {322#true} ~x~0 := 0;~y~0 := 1; {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:11,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:11,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:11,993 INFO L273 TraceCheckUtils]: 7: Hoare triple {325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:11,994 INFO L273 TraceCheckUtils]: 8: Hoare triple {325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {326#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:33:11,995 INFO L273 TraceCheckUtils]: 9: Hoare triple {326#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {326#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:33:11,996 INFO L273 TraceCheckUtils]: 10: Hoare triple {326#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 6); {323#false} is VALID [2018-11-14 17:33:11,996 INFO L256 TraceCheckUtils]: 11: Hoare triple {323#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {323#false} is VALID [2018-11-14 17:33:11,997 INFO L273 TraceCheckUtils]: 12: Hoare triple {323#false} ~cond := #in~cond; {323#false} is VALID [2018-11-14 17:33:11,998 INFO L273 TraceCheckUtils]: 13: Hoare triple {323#false} assume ~cond == 0; {323#false} is VALID [2018-11-14 17:33:11,998 INFO L273 TraceCheckUtils]: 14: Hoare triple {323#false} assume !false; {323#false} is VALID [2018-11-14 17:33:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:12,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:12,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:12,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:33:12,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:33:12,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:33:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:12,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:12,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2018-11-14 17:33:12,194 INFO L273 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2018-11-14 17:33:12,194 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #32#return; {322#true} is VALID [2018-11-14 17:33:12,194 INFO L256 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret1 := main(); {322#true} is VALID [2018-11-14 17:33:12,195 INFO L273 TraceCheckUtils]: 4: Hoare triple {322#true} ~x~0 := 0;~y~0 := 1; {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:12,196 INFO L273 TraceCheckUtils]: 5: Hoare triple {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:12,197 INFO L273 TraceCheckUtils]: 6: Hoare triple {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:12,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:12,200 INFO L273 TraceCheckUtils]: 8: Hoare triple {325#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {354#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:12,201 INFO L273 TraceCheckUtils]: 9: Hoare triple {354#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {354#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:12,202 INFO L273 TraceCheckUtils]: 10: Hoare triple {354#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 6); {323#false} is VALID [2018-11-14 17:33:12,203 INFO L256 TraceCheckUtils]: 11: Hoare triple {323#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {323#false} is VALID [2018-11-14 17:33:12,203 INFO L273 TraceCheckUtils]: 12: Hoare triple {323#false} ~cond := #in~cond; {323#false} is VALID [2018-11-14 17:33:12,204 INFO L273 TraceCheckUtils]: 13: Hoare triple {323#false} assume ~cond == 0; {323#false} is VALID [2018-11-14 17:33:12,204 INFO L273 TraceCheckUtils]: 14: Hoare triple {323#false} assume !false; {323#false} is VALID [2018-11-14 17:33:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:12,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:12,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 17:33:12,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 17:33:12,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:12,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:33:12,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:12,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:33:12,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:33:12,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:33:12,266 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 6 states. [2018-11-14 17:33:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:12,445 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-14 17:33:12,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:33:12,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 17:33:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:12,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:33:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-14 17:33:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:33:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-14 17:33:12,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2018-11-14 17:33:12,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:12,499 INFO L225 Difference]: With dead ends: 23 [2018-11-14 17:33:12,499 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 17:33:12,500 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:33:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 17:33:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-14 17:33:12,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:12,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-14 17:33:12,517 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 17:33:12,518 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 17:33:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:12,519 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 17:33:12,520 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 17:33:12,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:12,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:12,520 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 17:33:12,520 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 17:33:12,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:12,522 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 17:33:12,522 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 17:33:12,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:12,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:12,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:12,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:33:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-14 17:33:12,525 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-14 17:33:12,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:12,525 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-14 17:33:12,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:33:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 17:33:12,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:33:12,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:12,527 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:12,527 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:12,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:12,527 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 3 times [2018-11-14 17:33:12,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:12,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:12,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:12,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:33:12,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:12,751 INFO L256 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2018-11-14 17:33:12,752 INFO L273 TraceCheckUtils]: 1: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-14 17:33:12,752 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {471#true} {471#true} #32#return; {471#true} is VALID [2018-11-14 17:33:12,752 INFO L256 TraceCheckUtils]: 3: Hoare triple {471#true} call #t~ret1 := main(); {471#true} is VALID [2018-11-14 17:33:12,764 INFO L273 TraceCheckUtils]: 4: Hoare triple {471#true} ~x~0 := 0;~y~0 := 1; {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:12,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:12,765 INFO L273 TraceCheckUtils]: 6: Hoare triple {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:12,766 INFO L273 TraceCheckUtils]: 7: Hoare triple {474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:12,767 INFO L273 TraceCheckUtils]: 8: Hoare triple {474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:12,769 INFO L273 TraceCheckUtils]: 9: Hoare triple {475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:12,778 INFO L273 TraceCheckUtils]: 10: Hoare triple {475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {476#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:33:12,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {476#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {476#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:33:12,779 INFO L273 TraceCheckUtils]: 12: Hoare triple {476#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 6); {472#false} is VALID [2018-11-14 17:33:12,780 INFO L256 TraceCheckUtils]: 13: Hoare triple {472#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {472#false} is VALID [2018-11-14 17:33:12,780 INFO L273 TraceCheckUtils]: 14: Hoare triple {472#false} ~cond := #in~cond; {472#false} is VALID [2018-11-14 17:33:12,780 INFO L273 TraceCheckUtils]: 15: Hoare triple {472#false} assume ~cond == 0; {472#false} is VALID [2018-11-14 17:33:12,780 INFO L273 TraceCheckUtils]: 16: Hoare triple {472#false} assume !false; {472#false} is VALID [2018-11-14 17:33:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:12,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:12,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:12,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:33:12,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 17:33:12,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:33:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:12,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:12,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2018-11-14 17:33:12,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-14 17:33:12,898 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {471#true} {471#true} #32#return; {471#true} is VALID [2018-11-14 17:33:12,898 INFO L256 TraceCheckUtils]: 3: Hoare triple {471#true} call #t~ret1 := main(); {471#true} is VALID [2018-11-14 17:33:12,899 INFO L273 TraceCheckUtils]: 4: Hoare triple {471#true} ~x~0 := 0;~y~0 := 1; {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:12,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:12,901 INFO L273 TraceCheckUtils]: 6: Hoare triple {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:12,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:12,903 INFO L273 TraceCheckUtils]: 8: Hoare triple {474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:12,903 INFO L273 TraceCheckUtils]: 9: Hoare triple {475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:12,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:33:12,912 INFO L273 TraceCheckUtils]: 11: Hoare triple {510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:33:12,917 INFO L273 TraceCheckUtils]: 12: Hoare triple {510#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {472#false} is VALID [2018-11-14 17:33:12,917 INFO L256 TraceCheckUtils]: 13: Hoare triple {472#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {472#false} is VALID [2018-11-14 17:33:12,917 INFO L273 TraceCheckUtils]: 14: Hoare triple {472#false} ~cond := #in~cond; {472#false} is VALID [2018-11-14 17:33:12,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {472#false} assume ~cond == 0; {472#false} is VALID [2018-11-14 17:33:12,918 INFO L273 TraceCheckUtils]: 16: Hoare triple {472#false} assume !false; {472#false} is VALID [2018-11-14 17:33:12,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:12,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:12,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 17:33:12,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-14 17:33:12,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:12,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:33:12,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:12,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:33:12,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:33:12,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:33:12,965 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 7 states. [2018-11-14 17:33:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:13,141 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-14 17:33:13,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:33:13,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-14 17:33:13,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:13,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:33:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2018-11-14 17:33:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:33:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2018-11-14 17:33:13,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2018-11-14 17:33:13,198 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:13,199 INFO L225 Difference]: With dead ends: 25 [2018-11-14 17:33:13,200 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 17:33:13,200 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:33:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 17:33:13,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 17:33:13,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:13,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 17:33:13,223 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 17:33:13,223 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 17:33:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:13,226 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 17:33:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 17:33:13,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:13,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:13,227 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 17:33:13,227 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 17:33:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:13,229 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 17:33:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 17:33:13,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:13,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:13,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:13,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:33:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-14 17:33:13,231 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-14 17:33:13,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:13,231 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-14 17:33:13,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:33:13,231 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 17:33:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:33:13,232 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:13,232 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:13,233 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:13,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:13,233 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 4 times [2018-11-14 17:33:13,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:13,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:13,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:13,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:33:13,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:13,505 INFO L256 TraceCheckUtils]: 0: Hoare triple {637#true} call ULTIMATE.init(); {637#true} is VALID [2018-11-14 17:33:13,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {637#true} assume true; {637#true} is VALID [2018-11-14 17:33:13,506 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {637#true} {637#true} #32#return; {637#true} is VALID [2018-11-14 17:33:13,506 INFO L256 TraceCheckUtils]: 3: Hoare triple {637#true} call #t~ret1 := main(); {637#true} is VALID [2018-11-14 17:33:13,507 INFO L273 TraceCheckUtils]: 4: Hoare triple {637#true} ~x~0 := 0;~y~0 := 1; {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:13,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:13,508 INFO L273 TraceCheckUtils]: 6: Hoare triple {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {640#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:13,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {640#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {640#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:13,513 INFO L273 TraceCheckUtils]: 8: Hoare triple {640#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {641#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:13,513 INFO L273 TraceCheckUtils]: 9: Hoare triple {641#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {641#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:13,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {641#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {642#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:33:13,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {642#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {642#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:33:13,530 INFO L273 TraceCheckUtils]: 12: Hoare triple {642#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {643#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:33:13,531 INFO L273 TraceCheckUtils]: 13: Hoare triple {643#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {643#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:33:13,532 INFO L273 TraceCheckUtils]: 14: Hoare triple {643#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 6); {638#false} is VALID [2018-11-14 17:33:13,533 INFO L256 TraceCheckUtils]: 15: Hoare triple {638#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {638#false} is VALID [2018-11-14 17:33:13,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {638#false} ~cond := #in~cond; {638#false} is VALID [2018-11-14 17:33:13,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {638#false} assume ~cond == 0; {638#false} is VALID [2018-11-14 17:33:13,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {638#false} assume !false; {638#false} is VALID [2018-11-14 17:33:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:13,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:13,536 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:13,554 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:33:13,567 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:33:13,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:33:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:13,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:13,755 INFO L256 TraceCheckUtils]: 0: Hoare triple {637#true} call ULTIMATE.init(); {637#true} is VALID [2018-11-14 17:33:13,755 INFO L273 TraceCheckUtils]: 1: Hoare triple {637#true} assume true; {637#true} is VALID [2018-11-14 17:33:13,756 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {637#true} {637#true} #32#return; {637#true} is VALID [2018-11-14 17:33:13,756 INFO L256 TraceCheckUtils]: 3: Hoare triple {637#true} call #t~ret1 := main(); {637#true} is VALID [2018-11-14 17:33:13,757 INFO L273 TraceCheckUtils]: 4: Hoare triple {637#true} ~x~0 := 0;~y~0 := 1; {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:13,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:13,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {640#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:13,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {640#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {640#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:13,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {640#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {641#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:13,763 INFO L273 TraceCheckUtils]: 9: Hoare triple {641#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {641#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:13,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {641#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {642#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:33:13,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {642#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {642#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:33:13,767 INFO L273 TraceCheckUtils]: 12: Hoare triple {642#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {683#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:13,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {683#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {683#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:13,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {683#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 6); {638#false} is VALID [2018-11-14 17:33:13,769 INFO L256 TraceCheckUtils]: 15: Hoare triple {638#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {638#false} is VALID [2018-11-14 17:33:13,769 INFO L273 TraceCheckUtils]: 16: Hoare triple {638#false} ~cond := #in~cond; {638#false} is VALID [2018-11-14 17:33:13,770 INFO L273 TraceCheckUtils]: 17: Hoare triple {638#false} assume ~cond == 0; {638#false} is VALID [2018-11-14 17:33:13,770 INFO L273 TraceCheckUtils]: 18: Hoare triple {638#false} assume !false; {638#false} is VALID [2018-11-14 17:33:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:13,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:13,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 17:33:13,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 17:33:13,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:13,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:33:13,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:13,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:33:13,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:33:13,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:33:13,830 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2018-11-14 17:33:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:14,064 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 17:33:14,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:33:14,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 17:33:14,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:33:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-11-14 17:33:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:33:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-11-14 17:33:14,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2018-11-14 17:33:14,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:14,261 INFO L225 Difference]: With dead ends: 27 [2018-11-14 17:33:14,261 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 17:33:14,263 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:33:14,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 17:33:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 17:33:14,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:14,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 17:33:14,299 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:33:14,299 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:33:14,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:14,300 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 17:33:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 17:33:14,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:14,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:14,301 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:33:14,301 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:33:14,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:14,303 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 17:33:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 17:33:14,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:14,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:14,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:14,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:33:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-14 17:33:14,306 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-14 17:33:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:14,306 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-14 17:33:14,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:33:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 17:33:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:33:14,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:14,310 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:14,310 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:14,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:14,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 5 times [2018-11-14 17:33:14,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:14,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:14,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:14,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:33:14,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:14,875 INFO L256 TraceCheckUtils]: 0: Hoare triple {820#true} call ULTIMATE.init(); {820#true} is VALID [2018-11-14 17:33:14,875 INFO L273 TraceCheckUtils]: 1: Hoare triple {820#true} assume true; {820#true} is VALID [2018-11-14 17:33:14,876 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {820#true} {820#true} #32#return; {820#true} is VALID [2018-11-14 17:33:14,876 INFO L256 TraceCheckUtils]: 3: Hoare triple {820#true} call #t~ret1 := main(); {820#true} is VALID [2018-11-14 17:33:14,877 INFO L273 TraceCheckUtils]: 4: Hoare triple {820#true} ~x~0 := 0;~y~0 := 1; {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:14,878 INFO L273 TraceCheckUtils]: 5: Hoare triple {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:14,879 INFO L273 TraceCheckUtils]: 6: Hoare triple {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {823#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:14,880 INFO L273 TraceCheckUtils]: 7: Hoare triple {823#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {823#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:14,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {823#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:14,882 INFO L273 TraceCheckUtils]: 9: Hoare triple {824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:14,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {825#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:33:14,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {825#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {825#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:33:14,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {825#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {826#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:14,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {826#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {826#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:14,888 INFO L273 TraceCheckUtils]: 14: Hoare triple {826#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {827#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-14 17:33:14,889 INFO L273 TraceCheckUtils]: 15: Hoare triple {827#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume true; {827#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-14 17:33:14,890 INFO L273 TraceCheckUtils]: 16: Hoare triple {827#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {821#false} is VALID [2018-11-14 17:33:14,890 INFO L256 TraceCheckUtils]: 17: Hoare triple {821#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {821#false} is VALID [2018-11-14 17:33:14,891 INFO L273 TraceCheckUtils]: 18: Hoare triple {821#false} ~cond := #in~cond; {821#false} is VALID [2018-11-14 17:33:14,891 INFO L273 TraceCheckUtils]: 19: Hoare triple {821#false} assume ~cond == 0; {821#false} is VALID [2018-11-14 17:33:14,891 INFO L273 TraceCheckUtils]: 20: Hoare triple {821#false} assume !false; {821#false} is VALID [2018-11-14 17:33:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:14,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:14,894 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:14,903 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:33:14,939 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 17:33:14,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:33:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:14,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:15,052 INFO L256 TraceCheckUtils]: 0: Hoare triple {820#true} call ULTIMATE.init(); {820#true} is VALID [2018-11-14 17:33:15,052 INFO L273 TraceCheckUtils]: 1: Hoare triple {820#true} assume true; {820#true} is VALID [2018-11-14 17:33:15,052 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {820#true} {820#true} #32#return; {820#true} is VALID [2018-11-14 17:33:15,052 INFO L256 TraceCheckUtils]: 3: Hoare triple {820#true} call #t~ret1 := main(); {820#true} is VALID [2018-11-14 17:33:15,053 INFO L273 TraceCheckUtils]: 4: Hoare triple {820#true} ~x~0 := 0;~y~0 := 1; {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:15,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:15,054 INFO L273 TraceCheckUtils]: 6: Hoare triple {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {823#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:15,056 INFO L273 TraceCheckUtils]: 7: Hoare triple {823#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {823#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:15,056 INFO L273 TraceCheckUtils]: 8: Hoare triple {823#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:15,057 INFO L273 TraceCheckUtils]: 9: Hoare triple {824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:15,058 INFO L273 TraceCheckUtils]: 10: Hoare triple {824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {825#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:33:15,059 INFO L273 TraceCheckUtils]: 11: Hoare triple {825#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {825#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:33:15,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {825#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {826#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:15,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {826#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {826#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:15,063 INFO L273 TraceCheckUtils]: 14: Hoare triple {826#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {873#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:33:15,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {873#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {873#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:33:15,071 INFO L273 TraceCheckUtils]: 16: Hoare triple {873#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {821#false} is VALID [2018-11-14 17:33:15,071 INFO L256 TraceCheckUtils]: 17: Hoare triple {821#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {821#false} is VALID [2018-11-14 17:33:15,071 INFO L273 TraceCheckUtils]: 18: Hoare triple {821#false} ~cond := #in~cond; {821#false} is VALID [2018-11-14 17:33:15,071 INFO L273 TraceCheckUtils]: 19: Hoare triple {821#false} assume ~cond == 0; {821#false} is VALID [2018-11-14 17:33:15,072 INFO L273 TraceCheckUtils]: 20: Hoare triple {821#false} assume !false; {821#false} is VALID [2018-11-14 17:33:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:15,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:15,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 17:33:15,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-14 17:33:15,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:15,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:33:15,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:15,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:33:15,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:33:15,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:33:15,129 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 9 states. [2018-11-14 17:33:15,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:15,415 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-14 17:33:15,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:33:15,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-14 17:33:15,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:33:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-11-14 17:33:15,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:33:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-11-14 17:33:15,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2018-11-14 17:33:15,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:15,464 INFO L225 Difference]: With dead ends: 29 [2018-11-14 17:33:15,464 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 17:33:15,465 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:33:15,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 17:33:15,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 17:33:15,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:15,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 17:33:15,482 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 17:33:15,482 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 17:33:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:15,485 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 17:33:15,485 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 17:33:15,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:15,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:15,486 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 17:33:15,486 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 17:33:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:15,488 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 17:33:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 17:33:15,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:15,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:15,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:15,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:33:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-14 17:33:15,490 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-11-14 17:33:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:15,491 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-14 17:33:15,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:33:15,491 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 17:33:15,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:33:15,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:15,492 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:15,492 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:15,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:15,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 6 times [2018-11-14 17:33:15,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:15,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:15,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:15,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:33:15,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:24,230 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 18 [2018-11-14 17:33:24,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {1020#true} call ULTIMATE.init(); {1020#true} is VALID [2018-11-14 17:33:24,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {1020#true} assume true; {1020#true} is VALID [2018-11-14 17:33:24,271 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1020#true} {1020#true} #32#return; {1020#true} is VALID [2018-11-14 17:33:24,271 INFO L256 TraceCheckUtils]: 3: Hoare triple {1020#true} call #t~ret1 := main(); {1020#true} is VALID [2018-11-14 17:33:24,272 INFO L273 TraceCheckUtils]: 4: Hoare triple {1020#true} ~x~0 := 0;~y~0 := 1; {1022#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2018-11-14 17:33:24,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {1022#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume true; {1022#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2018-11-14 17:33:24,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {1022#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1023#(<= (+ (* 44739243 main_~y~0) 44739242) (* 134217728 (div (+ (* 44739243 main_~y~0) 44739242) 134217728)))} is VALID [2018-11-14 17:33:24,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {1023#(<= (+ (* 44739243 main_~y~0) 44739242) (* 134217728 (div (+ (* 44739243 main_~y~0) 44739242) 134217728)))} assume true; {1023#(<= (+ (* 44739243 main_~y~0) 44739242) (* 134217728 (div (+ (* 44739243 main_~y~0) 44739242) 134217728)))} is VALID [2018-11-14 17:33:24,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {1023#(<= (+ (* 44739243 main_~y~0) 44739242) (* 134217728 (div (+ (* 44739243 main_~y~0) 44739242) 134217728)))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1024#(<= (+ (* 178956971 main_~y~0) 89478484) (* 268435456 (div (+ (* 178956971 main_~y~0) 89478484) 268435456)))} is VALID [2018-11-14 17:33:24,288 INFO L273 TraceCheckUtils]: 9: Hoare triple {1024#(<= (+ (* 178956971 main_~y~0) 89478484) (* 268435456 (div (+ (* 178956971 main_~y~0) 89478484) 268435456)))} assume true; {1024#(<= (+ (* 178956971 main_~y~0) 89478484) (* 268435456 (div (+ (* 178956971 main_~y~0) 89478484) 268435456)))} is VALID [2018-11-14 17:33:24,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {1024#(<= (+ (* 178956971 main_~y~0) 89478484) (* 268435456 (div (+ (* 178956971 main_~y~0) 89478484) 268435456)))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1025#(<= (+ (* 178956971 main_~y~0) 178956968) (* 536870912 (div (+ (* 178956971 main_~y~0) 178956968) 536870912)))} is VALID [2018-11-14 17:33:24,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {1025#(<= (+ (* 178956971 main_~y~0) 178956968) (* 536870912 (div (+ (* 178956971 main_~y~0) 178956968) 536870912)))} assume true; {1025#(<= (+ (* 178956971 main_~y~0) 178956968) (* 536870912 (div (+ (* 178956971 main_~y~0) 178956968) 536870912)))} is VALID [2018-11-14 17:33:26,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {1025#(<= (+ (* 178956971 main_~y~0) 178956968) (* 536870912 (div (+ (* 178956971 main_~y~0) 178956968) 536870912)))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1026#(<= (+ (* 715827883 main_~y~0) 357913936) (* 1073741824 (div (+ (* 715827883 main_~y~0) 357913936) 1073741824)))} is UNKNOWN [2018-11-14 17:33:26,383 INFO L273 TraceCheckUtils]: 13: Hoare triple {1026#(<= (+ (* 715827883 main_~y~0) 357913936) (* 1073741824 (div (+ (* 715827883 main_~y~0) 357913936) 1073741824)))} assume true; {1026#(<= (+ (* 715827883 main_~y~0) 357913936) (* 1073741824 (div (+ (* 715827883 main_~y~0) 357913936) 1073741824)))} is VALID [2018-11-14 17:33:26,441 INFO L273 TraceCheckUtils]: 14: Hoare triple {1026#(<= (+ (* 715827883 main_~y~0) 357913936) (* 1073741824 (div (+ (* 715827883 main_~y~0) 357913936) 1073741824)))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1027#(<= (+ (* 715827883 main_~y~0) 715827872) (* 2147483648 (div (+ (* 715827883 main_~y~0) 715827872) 2147483648)))} is VALID [2018-11-14 17:33:26,443 INFO L273 TraceCheckUtils]: 15: Hoare triple {1027#(<= (+ (* 715827883 main_~y~0) 715827872) (* 2147483648 (div (+ (* 715827883 main_~y~0) 715827872) 2147483648)))} assume true; {1027#(<= (+ (* 715827883 main_~y~0) 715827872) (* 2147483648 (div (+ (* 715827883 main_~y~0) 715827872) 2147483648)))} is VALID [2018-11-14 17:33:26,484 INFO L273 TraceCheckUtils]: 16: Hoare triple {1027#(<= (+ (* 715827883 main_~y~0) 715827872) (* 2147483648 (div (+ (* 715827883 main_~y~0) 715827872) 2147483648)))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1028#(not (= (+ (* 4294967296 (div main_~y~0 4294967296)) (* 4294967296 (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296)) (* (- 3) (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296))) 3))) 4294967296)) (* 3 (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296))) 3))) main_~y~0))} is VALID [2018-11-14 17:33:26,485 INFO L273 TraceCheckUtils]: 17: Hoare triple {1028#(not (= (+ (* 4294967296 (div main_~y~0 4294967296)) (* 4294967296 (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296)) (* (- 3) (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296))) 3))) 4294967296)) (* 3 (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296))) 3))) main_~y~0))} assume true; {1028#(not (= (+ (* 4294967296 (div main_~y~0 4294967296)) (* 4294967296 (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296)) (* (- 3) (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296))) 3))) 4294967296)) (* 3 (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296))) 3))) main_~y~0))} is VALID [2018-11-14 17:33:26,486 INFO L273 TraceCheckUtils]: 18: Hoare triple {1028#(not (= (+ (* 4294967296 (div main_~y~0 4294967296)) (* 4294967296 (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296)) (* (- 3) (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296))) 3))) 4294967296)) (* 3 (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296))) 3))) main_~y~0))} assume !(~x~0 % 4294967296 < 6); {1028#(not (= (+ (* 4294967296 (div main_~y~0 4294967296)) (* 4294967296 (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296)) (* (- 3) (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296))) 3))) 4294967296)) (* 3 (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296))) 3))) main_~y~0))} is VALID [2018-11-14 17:33:26,488 INFO L256 TraceCheckUtils]: 19: Hoare triple {1028#(not (= (+ (* 4294967296 (div main_~y~0 4294967296)) (* 4294967296 (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296)) (* (- 3) (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296))) 3))) 4294967296)) (* 3 (div (+ main_~y~0 (* (- 4294967296) (div main_~y~0 4294967296))) 3))) main_~y~0))} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {1029#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:33:26,489 INFO L273 TraceCheckUtils]: 20: Hoare triple {1029#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1030#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:33:26,489 INFO L273 TraceCheckUtils]: 21: Hoare triple {1030#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {1021#false} is VALID [2018-11-14 17:33:26,489 INFO L273 TraceCheckUtils]: 22: Hoare triple {1021#false} assume !false; {1021#false} is VALID [2018-11-14 17:33:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:26,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:26,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:26,500 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:33:26,520 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 17:33:26,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:33:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:26,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:27,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {1020#true} call ULTIMATE.init(); {1020#true} is VALID [2018-11-14 17:33:27,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {1020#true} assume true; {1020#true} is VALID [2018-11-14 17:33:27,651 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1020#true} {1020#true} #32#return; {1020#true} is VALID [2018-11-14 17:33:27,651 INFO L256 TraceCheckUtils]: 3: Hoare triple {1020#true} call #t~ret1 := main(); {1020#true} is VALID [2018-11-14 17:33:27,652 INFO L273 TraceCheckUtils]: 4: Hoare triple {1020#true} ~x~0 := 0;~y~0 := 1; {1022#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2018-11-14 17:33:27,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {1022#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume true; {1022#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2018-11-14 17:33:27,656 INFO L273 TraceCheckUtils]: 6: Hoare triple {1022#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1052#(exists ((v_main_~y~0_6 Int)) (and (<= 1 v_main_~y~0_6) (= (* 2 v_main_~y~0_6) main_~y~0) (<= v_main_~y~0_6 1)))} is VALID [2018-11-14 17:33:27,657 INFO L273 TraceCheckUtils]: 7: Hoare triple {1052#(exists ((v_main_~y~0_6 Int)) (and (<= 1 v_main_~y~0_6) (= (* 2 v_main_~y~0_6) main_~y~0) (<= v_main_~y~0_6 1)))} assume true; {1052#(exists ((v_main_~y~0_6 Int)) (and (<= 1 v_main_~y~0_6) (= (* 2 v_main_~y~0_6) main_~y~0) (<= v_main_~y~0_6 1)))} is VALID [2018-11-14 17:33:27,659 INFO L273 TraceCheckUtils]: 8: Hoare triple {1052#(exists ((v_main_~y~0_6 Int)) (and (<= 1 v_main_~y~0_6) (= (* 2 v_main_~y~0_6) main_~y~0) (<= v_main_~y~0_6 1)))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1059#(exists ((v_main_~y~0_6 Int)) (and (<= 1 v_main_~y~0_6) (= main_~y~0 (* 4 v_main_~y~0_6)) (<= v_main_~y~0_6 1)))} is VALID [2018-11-14 17:33:27,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {1059#(exists ((v_main_~y~0_6 Int)) (and (<= 1 v_main_~y~0_6) (= main_~y~0 (* 4 v_main_~y~0_6)) (<= v_main_~y~0_6 1)))} assume true; {1059#(exists ((v_main_~y~0_6 Int)) (and (<= 1 v_main_~y~0_6) (= main_~y~0 (* 4 v_main_~y~0_6)) (<= v_main_~y~0_6 1)))} is VALID [2018-11-14 17:33:27,662 INFO L273 TraceCheckUtils]: 10: Hoare triple {1059#(exists ((v_main_~y~0_6 Int)) (and (<= 1 v_main_~y~0_6) (= main_~y~0 (* 4 v_main_~y~0_6)) (<= v_main_~y~0_6 1)))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1066#(exists ((v_main_~y~0_6 Int)) (and (= main_~y~0 (* 8 v_main_~y~0_6)) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1)))} is VALID [2018-11-14 17:33:27,662 INFO L273 TraceCheckUtils]: 11: Hoare triple {1066#(exists ((v_main_~y~0_6 Int)) (and (= main_~y~0 (* 8 v_main_~y~0_6)) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1)))} assume true; {1066#(exists ((v_main_~y~0_6 Int)) (and (= main_~y~0 (* 8 v_main_~y~0_6)) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1)))} is VALID [2018-11-14 17:33:27,664 INFO L273 TraceCheckUtils]: 12: Hoare triple {1066#(exists ((v_main_~y~0_6 Int)) (and (= main_~y~0 (* 8 v_main_~y~0_6)) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1)))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1073#(exists ((v_main_~y~0_6 Int)) (and (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1) (= (* 16 v_main_~y~0_6) main_~y~0)))} is VALID [2018-11-14 17:33:27,665 INFO L273 TraceCheckUtils]: 13: Hoare triple {1073#(exists ((v_main_~y~0_6 Int)) (and (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1) (= (* 16 v_main_~y~0_6) main_~y~0)))} assume true; {1073#(exists ((v_main_~y~0_6 Int)) (and (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1) (= (* 16 v_main_~y~0_6) main_~y~0)))} is VALID [2018-11-14 17:33:27,668 INFO L273 TraceCheckUtils]: 14: Hoare triple {1073#(exists ((v_main_~y~0_6 Int)) (and (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1) (= (* 16 v_main_~y~0_6) main_~y~0)))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1080#(exists ((v_main_~y~0_6 Int)) (and (= (* 32 v_main_~y~0_6) main_~y~0) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1)))} is VALID [2018-11-14 17:33:27,669 INFO L273 TraceCheckUtils]: 15: Hoare triple {1080#(exists ((v_main_~y~0_6 Int)) (and (= (* 32 v_main_~y~0_6) main_~y~0) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1)))} assume true; {1080#(exists ((v_main_~y~0_6 Int)) (and (= (* 32 v_main_~y~0_6) main_~y~0) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1)))} is VALID [2018-11-14 17:33:27,671 INFO L273 TraceCheckUtils]: 16: Hoare triple {1080#(exists ((v_main_~y~0_6 Int)) (and (= (* 32 v_main_~y~0_6) main_~y~0) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1)))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1087#(exists ((v_main_~y~0_6 Int)) (and (= main_~y~0 (* 64 v_main_~y~0_6)) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1)))} is VALID [2018-11-14 17:33:27,672 INFO L273 TraceCheckUtils]: 17: Hoare triple {1087#(exists ((v_main_~y~0_6 Int)) (and (= main_~y~0 (* 64 v_main_~y~0_6)) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1)))} assume true; {1087#(exists ((v_main_~y~0_6 Int)) (and (= main_~y~0 (* 64 v_main_~y~0_6)) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1)))} is VALID [2018-11-14 17:33:27,673 INFO L273 TraceCheckUtils]: 18: Hoare triple {1087#(exists ((v_main_~y~0_6 Int)) (and (= main_~y~0 (* 64 v_main_~y~0_6)) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1)))} assume !(~x~0 % 4294967296 < 6); {1087#(exists ((v_main_~y~0_6 Int)) (and (= main_~y~0 (* 64 v_main_~y~0_6)) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1)))} is VALID [2018-11-14 17:33:27,683 INFO L256 TraceCheckUtils]: 19: Hoare triple {1087#(exists ((v_main_~y~0_6 Int)) (and (= main_~y~0 (* 64 v_main_~y~0_6)) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1)))} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {1097#(exists ((v_prenex_1 Int)) (and (= |__VERIFIER_assert_#in~cond| (mod (mod (mod (* 64 v_prenex_1) 4294967296) 3) 4294967296)) (<= 1 v_prenex_1) (<= v_prenex_1 1) (<= 0 (mod (* 64 v_prenex_1) 4294967296)) (<= (mod (mod (mod (* 64 v_prenex_1) 4294967296) 3) 4294967296) 2147483647)))} is VALID [2018-11-14 17:33:27,685 INFO L273 TraceCheckUtils]: 20: Hoare triple {1097#(exists ((v_prenex_1 Int)) (and (= |__VERIFIER_assert_#in~cond| (mod (mod (mod (* 64 v_prenex_1) 4294967296) 3) 4294967296)) (<= 1 v_prenex_1) (<= v_prenex_1 1) (<= 0 (mod (* 64 v_prenex_1) 4294967296)) (<= (mod (mod (mod (* 64 v_prenex_1) 4294967296) 3) 4294967296) 2147483647)))} ~cond := #in~cond; {1101#(exists ((v_prenex_1 Int)) (and (<= 1 v_prenex_1) (<= v_prenex_1 1) (= (mod (mod (mod (* 64 v_prenex_1) 4294967296) 3) 4294967296) __VERIFIER_assert_~cond) (<= 0 (mod (* 64 v_prenex_1) 4294967296)) (<= (mod (mod (mod (* 64 v_prenex_1) 4294967296) 3) 4294967296) 2147483647)))} is VALID [2018-11-14 17:33:27,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {1101#(exists ((v_prenex_1 Int)) (and (<= 1 v_prenex_1) (<= v_prenex_1 1) (= (mod (mod (mod (* 64 v_prenex_1) 4294967296) 3) 4294967296) __VERIFIER_assert_~cond) (<= 0 (mod (* 64 v_prenex_1) 4294967296)) (<= (mod (mod (mod (* 64 v_prenex_1) 4294967296) 3) 4294967296) 2147483647)))} assume ~cond == 0; {1021#false} is VALID [2018-11-14 17:33:27,690 INFO L273 TraceCheckUtils]: 22: Hoare triple {1021#false} assume !false; {1021#false} is VALID [2018-11-14 17:33:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:27,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:27,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-14 17:33:27,724 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-11-14 17:33:27,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:27,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 17:33:34,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 36 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:34,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 17:33:34,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 17:33:34,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=290, Unknown=3, NotChecked=0, Total=342 [2018-11-14 17:33:34,084 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 19 states. [2018-11-14 17:33:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:34,984 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-14 17:33:34,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 17:33:34,985 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-11-14 17:33:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:33:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 37 transitions. [2018-11-14 17:33:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:33:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 37 transitions. [2018-11-14 17:33:34,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 37 transitions. [2018-11-14 17:33:35,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:35,075 INFO L225 Difference]: With dead ends: 36 [2018-11-14 17:33:35,075 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 17:33:35,076 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=60, Invalid=357, Unknown=3, NotChecked=0, Total=420 [2018-11-14 17:33:35,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 17:33:35,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 17:33:35,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:35,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 17:33:35,148 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 17:33:35,148 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 17:33:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:35,153 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 17:33:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:33:35,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:35,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:35,154 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 17:33:35,154 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 17:33:35,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:35,155 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 17:33:35,156 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:33:35,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:35,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:35,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:35,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:33:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-14 17:33:35,158 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 23 [2018-11-14 17:33:35,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:35,158 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-14 17:33:35,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 17:33:35,159 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:33:35,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:33:35,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:35,159 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:35,160 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:35,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:35,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1579855560, now seen corresponding path program 7 times [2018-11-14 17:33:35,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:35,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:35,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:35,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:33:35,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:35,915 INFO L256 TraceCheckUtils]: 0: Hoare triple {1265#true} call ULTIMATE.init(); {1265#true} is VALID [2018-11-14 17:33:35,916 INFO L273 TraceCheckUtils]: 1: Hoare triple {1265#true} assume true; {1265#true} is VALID [2018-11-14 17:33:35,916 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1265#true} {1265#true} #32#return; {1265#true} is VALID [2018-11-14 17:33:35,916 INFO L256 TraceCheckUtils]: 3: Hoare triple {1265#true} call #t~ret1 := main(); {1265#true} is VALID [2018-11-14 17:33:35,917 INFO L273 TraceCheckUtils]: 4: Hoare triple {1265#true} ~x~0 := 0;~y~0 := 1; {1267#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:35,918 INFO L273 TraceCheckUtils]: 5: Hoare triple {1267#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1267#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:35,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {1267#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1268#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:35,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {1268#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1268#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:35,920 INFO L273 TraceCheckUtils]: 8: Hoare triple {1268#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1269#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:35,921 INFO L273 TraceCheckUtils]: 9: Hoare triple {1269#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1269#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:35,922 INFO L273 TraceCheckUtils]: 10: Hoare triple {1269#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1270#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:33:35,923 INFO L273 TraceCheckUtils]: 11: Hoare triple {1270#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1270#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:33:35,926 INFO L273 TraceCheckUtils]: 12: Hoare triple {1270#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1271#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:35,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {1271#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1271#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:35,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {1271#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1272#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:33:35,927 INFO L273 TraceCheckUtils]: 15: Hoare triple {1272#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1272#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:33:35,929 INFO L273 TraceCheckUtils]: 16: Hoare triple {1272#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1273#(and (<= (div main_~x~0 4294967296) 0) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:35,931 INFO L273 TraceCheckUtils]: 17: Hoare triple {1273#(and (<= (div main_~x~0 4294967296) 0) (<= 6 main_~x~0))} assume true; {1273#(and (<= (div main_~x~0 4294967296) 0) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:35,935 INFO L273 TraceCheckUtils]: 18: Hoare triple {1273#(and (<= (div main_~x~0 4294967296) 0) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1266#false} is VALID [2018-11-14 17:33:35,936 INFO L273 TraceCheckUtils]: 19: Hoare triple {1266#false} assume true; {1266#false} is VALID [2018-11-14 17:33:35,936 INFO L273 TraceCheckUtils]: 20: Hoare triple {1266#false} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1266#false} is VALID [2018-11-14 17:33:35,936 INFO L273 TraceCheckUtils]: 21: Hoare triple {1266#false} assume true; {1266#false} is VALID [2018-11-14 17:33:35,936 INFO L273 TraceCheckUtils]: 22: Hoare triple {1266#false} assume !(~x~0 % 4294967296 < 6); {1266#false} is VALID [2018-11-14 17:33:35,936 INFO L256 TraceCheckUtils]: 23: Hoare triple {1266#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {1266#false} is VALID [2018-11-14 17:33:35,937 INFO L273 TraceCheckUtils]: 24: Hoare triple {1266#false} ~cond := #in~cond; {1266#false} is VALID [2018-11-14 17:33:35,937 INFO L273 TraceCheckUtils]: 25: Hoare triple {1266#false} assume ~cond == 0; {1266#false} is VALID [2018-11-14 17:33:35,937 INFO L273 TraceCheckUtils]: 26: Hoare triple {1266#false} assume !false; {1266#false} is VALID [2018-11-14 17:33:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:33:35,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:35,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:35,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:35,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:36,104 INFO L256 TraceCheckUtils]: 0: Hoare triple {1265#true} call ULTIMATE.init(); {1265#true} is VALID [2018-11-14 17:33:36,105 INFO L273 TraceCheckUtils]: 1: Hoare triple {1265#true} assume true; {1265#true} is VALID [2018-11-14 17:33:36,105 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1265#true} {1265#true} #32#return; {1265#true} is VALID [2018-11-14 17:33:36,105 INFO L256 TraceCheckUtils]: 3: Hoare triple {1265#true} call #t~ret1 := main(); {1265#true} is VALID [2018-11-14 17:33:36,106 INFO L273 TraceCheckUtils]: 4: Hoare triple {1265#true} ~x~0 := 0;~y~0 := 1; {1267#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:36,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {1267#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1267#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:36,108 INFO L273 TraceCheckUtils]: 6: Hoare triple {1267#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1268#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:36,108 INFO L273 TraceCheckUtils]: 7: Hoare triple {1268#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1268#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:33:36,109 INFO L273 TraceCheckUtils]: 8: Hoare triple {1268#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1269#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:36,109 INFO L273 TraceCheckUtils]: 9: Hoare triple {1269#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1269#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:36,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {1269#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1270#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:33:36,111 INFO L273 TraceCheckUtils]: 11: Hoare triple {1270#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1270#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:33:36,112 INFO L273 TraceCheckUtils]: 12: Hoare triple {1270#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1271#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:36,113 INFO L273 TraceCheckUtils]: 13: Hoare triple {1271#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1271#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:36,114 INFO L273 TraceCheckUtils]: 14: Hoare triple {1271#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1272#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:33:36,115 INFO L273 TraceCheckUtils]: 15: Hoare triple {1272#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1272#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:33:36,116 INFO L273 TraceCheckUtils]: 16: Hoare triple {1272#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1325#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:36,121 INFO L273 TraceCheckUtils]: 17: Hoare triple {1325#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1325#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:36,122 INFO L273 TraceCheckUtils]: 18: Hoare triple {1325#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1266#false} is VALID [2018-11-14 17:33:36,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {1266#false} assume true; {1266#false} is VALID [2018-11-14 17:33:36,123 INFO L273 TraceCheckUtils]: 20: Hoare triple {1266#false} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {1266#false} is VALID [2018-11-14 17:33:36,123 INFO L273 TraceCheckUtils]: 21: Hoare triple {1266#false} assume true; {1266#false} is VALID [2018-11-14 17:33:36,123 INFO L273 TraceCheckUtils]: 22: Hoare triple {1266#false} assume !(~x~0 % 4294967296 < 6); {1266#false} is VALID [2018-11-14 17:33:36,123 INFO L256 TraceCheckUtils]: 23: Hoare triple {1266#false} call __VERIFIER_assert((if (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 <= 2147483647 then (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 else (if ~y~0 % 4294967296 < 0 && ~y~0 % 4294967296 % 3 != 0 then ~y~0 % 4294967296 % 3 - 3 else ~y~0 % 4294967296 % 3) % 4294967296 % 4294967296 - 4294967296)); {1266#false} is VALID [2018-11-14 17:33:36,124 INFO L273 TraceCheckUtils]: 24: Hoare triple {1266#false} ~cond := #in~cond; {1266#false} is VALID [2018-11-14 17:33:36,124 INFO L273 TraceCheckUtils]: 25: Hoare triple {1266#false} assume ~cond == 0; {1266#false} is VALID [2018-11-14 17:33:36,124 INFO L273 TraceCheckUtils]: 26: Hoare triple {1266#false} assume !false; {1266#false} is VALID [2018-11-14 17:33:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 17:33:36,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:36,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 17:33:36,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-14 17:33:36,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:36,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:33:36,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:36,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:33:36,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:33:36,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:33:36,272 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 10 states. [2018-11-14 17:33:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:36,575 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 17:33:36,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:33:36,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-14 17:33:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:33:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-11-14 17:33:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:33:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-11-14 17:33:36,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 26 transitions. [2018-11-14 17:33:36,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:36,698 INFO L225 Difference]: With dead ends: 28 [2018-11-14 17:33:36,698 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 17:33:36,699 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:33:36,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 17:33:36,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 17:33:36,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:36,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 17:33:36,699 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:33:36,699 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:33:36,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:36,700 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:33:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:33:36,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:36,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:36,700 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 17:33:36,700 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 17:33:36,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:36,700 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 17:33:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:33:36,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:36,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:36,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:36,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 17:33:36,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 17:33:36,701 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-11-14 17:33:36,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:36,701 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 17:33:36,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:33:36,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 17:33:36,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:36,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 17:33:37,197 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 17:33:37,197 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:33:37,197 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 17:33:37,197 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 17:33:37,197 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 17:33:37,197 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 17:33:37,197 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 16) the Hoare annotation is: true [2018-11-14 17:33:37,198 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 16) no Hoare annotation was computed. [2018-11-14 17:33:37,198 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 16) no Hoare annotation was computed. [2018-11-14 17:33:37,198 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 14) no Hoare annotation was computed. [2018-11-14 17:33:37,198 INFO L421 ceAbstractionStarter]: At program point L11-3(lines 11 14) the Hoare annotation is: (or (and (<= 2 main_~x~0) (exists ((v_main_~y~0_6 Int)) (and (<= 1 v_main_~y~0_6) (= main_~y~0 (* 4 v_main_~y~0_6)) (<= v_main_~y~0_6 1))) (<= main_~x~0 2)) (and (<= 4 main_~x~0) (<= main_~x~0 4) (exists ((v_main_~y~0_6 Int)) (and (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1) (= (* 16 v_main_~y~0_6) main_~y~0)))) (and (exists ((v_main_~y~0_6 Int)) (and (= main_~y~0 (* 8 v_main_~y~0_6)) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1))) (<= main_~x~0 3) (<= 3 main_~x~0)) (and (exists ((v_main_~y~0_6 Int)) (and (= (* 32 v_main_~y~0_6) main_~y~0) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1))) (<= 5 main_~x~0) (<= main_~x~0 5)) (and (<= 1 main_~y~0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) (and (<= main_~x~0 6) (exists ((v_main_~y~0_6 Int)) (and (= main_~y~0 (* 64 v_main_~y~0_6)) (<= 1 v_main_~y~0_6) (<= v_main_~y~0_6 1))) (<= 6 main_~x~0)) (and (exists ((v_main_~y~0_6 Int)) (and (<= 1 v_main_~y~0_6) (= (* 2 v_main_~y~0_6) main_~y~0) (<= v_main_~y~0_6 1))) (<= main_~x~0 1) (<= 1 main_~x~0))) [2018-11-14 17:33:37,198 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 14) the Hoare annotation is: (not (= (let ((.cse0 (div main_~y~0 4294967296))) (let ((.cse1 (* (- 4294967296) .cse0))) (let ((.cse2 (div (+ main_~y~0 .cse1) 3))) (+ (* 4294967296 .cse0) (* 4294967296 (div (+ main_~y~0 .cse1 (* (- 3) .cse2)) 4294967296)) (* 3 .cse2))))) main_~y~0)) [2018-11-14 17:33:37,198 INFO L425 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-14 17:33:37,198 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-14 17:33:37,199 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-14 17:33:37,199 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-14 17:33:37,199 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-14 17:33:37,199 INFO L425 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-14 17:33:37,201 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:33:37,202 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 17:33:37,202 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:33:37,202 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:33:37,202 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 17:33:37,220 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 17:33:37,220 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 17:33:37,220 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:33:37,220 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 17:33:37,220 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 17:33:37,221 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:33:37,221 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:33:37,221 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:33:37,221 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-14 17:33:37,221 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:33:37,221 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 17:33:37,221 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:33:37,222 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:33:37,229 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,230 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,230 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,231 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,231 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,231 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,231 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,232 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,232 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,232 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,232 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,233 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,233 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,233 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,233 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,234 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,234 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,234 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,240 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,240 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,241 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,241 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,241 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,241 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,242 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,242 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,242 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,242 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,242 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,243 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,243 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,243 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,243 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,243 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,248 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,248 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:33:37 BoogieIcfgContainer [2018-11-14 17:33:37,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:33:37,255 INFO L168 Benchmark]: Toolchain (without parser) took 28936.76 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 864.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -752.1 MB). Peak memory consumption was 112.0 MB. Max. memory is 7.1 GB. [2018-11-14 17:33:37,256 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:33:37,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:33:37,258 INFO L168 Benchmark]: Boogie Preprocessor took 39.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:33:37,258 INFO L168 Benchmark]: RCFGBuilder took 673.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-14 17:33:37,259 INFO L168 Benchmark]: TraceAbstraction took 27898.72 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 115.9 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 33.5 MB). Peak memory consumption was 149.4 MB. Max. memory is 7.1 GB. [2018-11-14 17:33:37,268 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 316.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 673.16 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27898.72 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 115.9 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 33.5 MB). Peak memory consumption was 149.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 11]: Loop Invariant [2018-11-14 17:33:37,283 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,283 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,286 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,286 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,286 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,286 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,286 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,287 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,287 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,287 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,287 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,287 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,288 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,290 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,291 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,292 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,295 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] [2018-11-14 17:33:37,296 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_6,QUANTIFIED] Derived loop invariant: (((((((2 <= x && (\exists v_main_~y~0_6 : int :: (1 <= v_main_~y~0_6 && y == 4 * v_main_~y~0_6) && v_main_~y~0_6 <= 1)) && x <= 2) || ((4 <= x && x <= 4) && (\exists v_main_~y~0_6 : int :: (1 <= v_main_~y~0_6 && v_main_~y~0_6 <= 1) && 16 * v_main_~y~0_6 == y))) || (((\exists v_main_~y~0_6 : int :: (y == 8 * v_main_~y~0_6 && 1 <= v_main_~y~0_6) && v_main_~y~0_6 <= 1) && x <= 3) && 3 <= x)) || (((\exists v_main_~y~0_6 : int :: (32 * v_main_~y~0_6 == y && 1 <= v_main_~y~0_6) && v_main_~y~0_6 <= 1) && 5 <= x) && x <= 5)) || (((1 <= y && x <= 0) && y <= 1) && 0 <= x)) || ((x <= 6 && (\exists v_main_~y~0_6 : int :: (y == 64 * v_main_~y~0_6 && 1 <= v_main_~y~0_6) && v_main_~y~0_6 <= 1)) && 6 <= x)) || (((\exists v_main_~y~0_6 : int :: (1 <= v_main_~y~0_6 && 2 * v_main_~y~0_6 == y) && v_main_~y~0_6 <= 1) && x <= 1) && 1 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 27.7s OverallTime, 9 OverallIterations, 9 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 127 SDtfs, 3 SDslu, 452 SDs, 0 SdLazy, 275 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 125 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 16 PreInvPairs, 25 NumberOfFragments, 181 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 275 ConstructedInterpolants, 15 QuantifiedInterpolants, 29995 SizeOfPredicates, 7 NumberOfNonLiveVariables, 349 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 60/368 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...