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-Const.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:20:35,751 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:20:35,754 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:20:35,766 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:20:35,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:20:35,767 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:20:35,768 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:20:35,770 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:20:35,772 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:20:35,773 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:20:35,774 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:20:35,774 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:20:35,775 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:20:35,776 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:20:35,777 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:20:35,778 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:20:35,779 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:20:35,780 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:20:35,782 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:20:35,784 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:20:35,785 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:20:35,786 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:20:35,789 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:20:35,789 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:20:35,789 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:20:35,790 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:20:35,791 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:20:35,792 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:20:35,793 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:20:35,795 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:20:35,795 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:20:35,796 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:20:35,796 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:20:35,797 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:20:35,798 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:20:35,798 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:20:35,798 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:20:35,830 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:20:35,830 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:20:35,831 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:20:35,831 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:20:35,832 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:20:35,832 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:20:35,832 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:20:35,832 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:20:35,833 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:20:35,833 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:20:35,833 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:20:35,833 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:20:35,833 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:20:35,834 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:20:35,835 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:20:35,835 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:20:35,835 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:20:35,835 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:20:35,835 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:20:35,837 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:20:35,837 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:20:35,837 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:20:35,837 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:20:35,837 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:20:35,838 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:20:35,838 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:20:35,838 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:20:35,838 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:20:35,838 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:20:35,839 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:20:35,839 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:20:35,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:20:35,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:20:35,921 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:20:35,923 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:20:35,923 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:20:35,924 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call2_true-termination.i [2018-11-14 19:20:35,987 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5edd9111e/4f745bfad269406b8b9c654f130b7147/FLAG513ef1c0c [2018-11-14 19:20:36,394 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:20:36,394 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_true-unreach-call2_true-termination.i [2018-11-14 19:20:36,400 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5edd9111e/4f745bfad269406b8b9c654f130b7147/FLAG513ef1c0c [2018-11-14 19:20:36,415 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5edd9111e/4f745bfad269406b8b9c654f130b7147 [2018-11-14 19:20:36,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:20:36,428 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:20:36,429 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:20:36,429 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:20:36,433 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:20:36,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:20:36" (1/1) ... [2018-11-14 19:20:36,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:36, skipping insertion in model container [2018-11-14 19:20:36,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:20:36" (1/1) ... [2018-11-14 19:20:36,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:20:36,469 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:20:36,655 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:20:36,660 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:20:36,679 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:20:36,696 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:20:36,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:36 WrapperNode [2018-11-14 19:20:36,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:20:36,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:20:36,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:20:36,698 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:20:36,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:36" (1/1) ... [2018-11-14 19:20:36,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:36" (1/1) ... [2018-11-14 19:20:36,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:36" (1/1) ... [2018-11-14 19:20:36,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:36" (1/1) ... [2018-11-14 19:20:36,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:36" (1/1) ... [2018-11-14 19:20:36,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:36" (1/1) ... [2018-11-14 19:20:36,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:36" (1/1) ... [2018-11-14 19:20:36,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:20:36,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:20:36,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:20:36,736 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:20:36,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:36" (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 19:20:36,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:20:36,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:20:36,874 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:20:36,874 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:20:36,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:20:36,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:20:36,875 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:20:36,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:20:36,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:20:37,336 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:20:37,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:20:37 BoogieIcfgContainer [2018-11-14 19:20:37,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:20:37,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:20:37,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:20:37,341 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:20:37,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:20:36" (1/3) ... [2018-11-14 19:20:37,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a6d419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:20:37, skipping insertion in model container [2018-11-14 19:20:37,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:20:36" (2/3) ... [2018-11-14 19:20:37,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a6d419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:20:37, skipping insertion in model container [2018-11-14 19:20:37,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:20:37" (3/3) ... [2018-11-14 19:20:37,345 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_true-unreach-call2_true-termination.i [2018-11-14 19:20:37,355 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:20:37,363 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:20:37,381 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:20:37,414 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:20:37,415 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:20:37,415 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:20:37,415 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:20:37,415 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:20:37,415 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:20:37,415 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:20:37,416 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:20:37,416 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:20:37,434 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-14 19:20:37,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 19:20:37,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:37,441 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:37,443 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:37,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:37,449 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-14 19:20:37,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:37,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:37,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:37,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:37,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:37,565 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-14 19:20:37,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-14 19:20:37,569 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-14 19:20:37,569 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2018-11-14 19:20:37,569 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 0;~y~0 := 1; {21#true} is VALID [2018-11-14 19:20:37,572 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-14 19:20:37,572 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == 6 then 1 else 0)); {22#false} is VALID [2018-11-14 19:20:37,573 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-14 19:20:37,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume ~cond == 0; {22#false} is VALID [2018-11-14 19:20:37,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-14 19:20:37,576 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 19:20:37,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:20:37,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:20:37,585 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 19:20:37,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:37,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:20:37,666 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 19:20:37,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:20:37,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:20:37,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:20:37,679 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-14 19:20:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:37,771 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 19:20:37,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:20:37,771 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 19:20:37,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:20:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-14 19:20:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:20:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-14 19:20:37,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2018-11-14 19:20:37,927 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 19:20:37,938 INFO L225 Difference]: With dead ends: 29 [2018-11-14 19:20:37,938 INFO L226 Difference]: Without dead ends: 12 [2018-11-14 19:20:37,944 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 19:20:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-14 19:20:38,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-14 19:20:38,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:38,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-14 19:20:38,066 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 19:20:38,066 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 19:20:38,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:38,069 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 19:20:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 19:20:38,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:38,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:38,071 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 19:20:38,071 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 19:20:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:38,074 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 19:20:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 19:20:38,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:38,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:38,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:38,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 19:20:38,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-14 19:20:38,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-14 19:20:38,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:38,083 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-14 19:20:38,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:20:38,083 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 19:20:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 19:20:38,084 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:38,084 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:38,084 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:38,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:38,085 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-14 19:20:38,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:38,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:38,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:38,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:38,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:38,419 INFO L256 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {106#true} is VALID [2018-11-14 19:20:38,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {106#true} assume true; {106#true} is VALID [2018-11-14 19:20:38,420 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} #32#return; {106#true} is VALID [2018-11-14 19:20:38,421 INFO L256 TraceCheckUtils]: 3: Hoare triple {106#true} call #t~ret1 := main(); {106#true} is VALID [2018-11-14 19:20:38,429 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 19:20:38,440 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 19:20:38,441 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 19:20:38,441 INFO L256 TraceCheckUtils]: 7: Hoare triple {107#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == 6 then 1 else 0)); {107#false} is VALID [2018-11-14 19:20:38,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {107#false} ~cond := #in~cond; {107#false} is VALID [2018-11-14 19:20:38,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {107#false} assume ~cond == 0; {107#false} is VALID [2018-11-14 19:20:38,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {107#false} assume !false; {107#false} is VALID [2018-11-14 19:20:38,444 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 19:20:38,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:20:38,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:20:38,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 19:20:38,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:38,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:20:38,590 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 19:20:38,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:20:38,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:20:38,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:20:38,591 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-14 19:20:38,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:38,835 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 19:20:38,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:20:38,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 19:20:38,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:20:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-14 19:20:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:20:38,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-14 19:20:38,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2018-11-14 19:20:38,954 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 19:20:38,955 INFO L225 Difference]: With dead ends: 19 [2018-11-14 19:20:38,955 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 19:20:38,959 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 19:20:38,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 19:20:38,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 19:20:38,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:38,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 19:20:38,985 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 19:20:38,985 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 19:20:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:38,987 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 19:20:38,987 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 19:20:38,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:38,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:38,988 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 19:20:38,988 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 19:20:38,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:38,990 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 19:20:38,990 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 19:20:38,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:38,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:38,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:38,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 19:20:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-14 19:20:38,994 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-14 19:20:38,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:38,994 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-14 19:20:38,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:20:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 19:20:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 19:20:38,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:38,995 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:38,995 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:38,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:38,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-14 19:20:38,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:38,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:38,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:38,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:38,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:39,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2018-11-14 19:20:39,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2018-11-14 19:20:39,157 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #32#return; {190#true} is VALID [2018-11-14 19:20:39,158 INFO L256 TraceCheckUtils]: 3: Hoare triple {190#true} call #t~ret1 := main(); {190#true} is VALID [2018-11-14 19:20:39,158 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 19:20:39,162 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 19:20:39,163 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 19:20:39,163 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 19:20:39,164 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 19:20:39,165 INFO L256 TraceCheckUtils]: 9: Hoare triple {191#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == 6 then 1 else 0)); {191#false} is VALID [2018-11-14 19:20:39,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2018-11-14 19:20:39,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {191#false} assume ~cond == 0; {191#false} is VALID [2018-11-14 19:20:39,165 INFO L273 TraceCheckUtils]: 12: Hoare triple {191#false} assume !false; {191#false} is VALID [2018-11-14 19:20:39,167 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 19:20:39,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:39,167 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 19:20:39,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:39,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:39,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2018-11-14 19:20:39,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2018-11-14 19:20:39,310 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #32#return; {190#true} is VALID [2018-11-14 19:20:39,311 INFO L256 TraceCheckUtils]: 3: Hoare triple {190#true} call #t~ret1 := main(); {190#true} is VALID [2018-11-14 19:20:39,312 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 19:20:39,322 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 19:20:39,323 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 19:20:39,323 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 19:20:39,324 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 19:20:39,325 INFO L256 TraceCheckUtils]: 9: Hoare triple {191#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == 6 then 1 else 0)); {191#false} is VALID [2018-11-14 19:20:39,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2018-11-14 19:20:39,325 INFO L273 TraceCheckUtils]: 11: Hoare triple {191#false} assume ~cond == 0; {191#false} is VALID [2018-11-14 19:20:39,325 INFO L273 TraceCheckUtils]: 12: Hoare triple {191#false} assume !false; {191#false} is VALID [2018-11-14 19:20:39,327 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 19:20:39,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:20:39,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 19:20:39,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 19:20:39,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:39,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:20:39,542 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 19:20:39,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:20:39,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:20:39,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:20:39,543 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 5 states. [2018-11-14 19:20:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:40,024 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 19:20:40,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 19:20:40,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 19:20:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:20:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-14 19:20:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:20:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-14 19:20:40,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2018-11-14 19:20:40,137 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 19:20:40,139 INFO L225 Difference]: With dead ends: 21 [2018-11-14 19:20:40,139 INFO L226 Difference]: Without dead ends: 16 [2018-11-14 19:20:40,139 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:20:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-14 19:20:40,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-14 19:20:40,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:40,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-14 19:20:40,162 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 19:20:40,162 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 19:20:40,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:40,164 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 19:20:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 19:20:40,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:40,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:40,165 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 19:20:40,165 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 19:20:40,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:40,167 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 19:20:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 19:20:40,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:40,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:40,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:40,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 19:20:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-14 19:20:40,170 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-14 19:20:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:40,170 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-14 19:20:40,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:20:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 19:20:40,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 19:20:40,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:40,171 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:40,171 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:40,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:40,172 INFO L82 PathProgramCache]: Analyzing trace with hash -720896604, now seen corresponding path program 2 times [2018-11-14 19:20:40,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:40,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:40,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:40,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:20:40,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:40,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2018-11-14 19:20:40,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2018-11-14 19:20:40,386 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #32#return; {322#true} is VALID [2018-11-14 19:20:40,386 INFO L256 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret1 := main(); {322#true} is VALID [2018-11-14 19:20:40,390 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 19:20:40,391 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 19:20:40,412 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 19:20:40,421 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 19:20:40,426 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 19:20:40,427 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 19:20:40,428 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 19:20:40,428 INFO L256 TraceCheckUtils]: 11: Hoare triple {323#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == 6 then 1 else 0)); {323#false} is VALID [2018-11-14 19:20:40,428 INFO L273 TraceCheckUtils]: 12: Hoare triple {323#false} ~cond := #in~cond; {323#false} is VALID [2018-11-14 19:20:40,429 INFO L273 TraceCheckUtils]: 13: Hoare triple {323#false} assume ~cond == 0; {323#false} is VALID [2018-11-14 19:20:40,429 INFO L273 TraceCheckUtils]: 14: Hoare triple {323#false} assume !false; {323#false} is VALID [2018-11-14 19:20:40,431 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 19:20:40,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:40,431 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 19:20:40,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:20:40,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:20:40,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:20:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:40,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:40,602 INFO L256 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2018-11-14 19:20:40,603 INFO L273 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2018-11-14 19:20:40,603 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #32#return; {322#true} is VALID [2018-11-14 19:20:40,603 INFO L256 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret1 := main(); {322#true} is VALID [2018-11-14 19:20:40,606 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 19:20:40,607 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 19:20:40,608 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 19:20:40,610 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 19:20:40,611 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 19:20:40,612 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 19:20:40,612 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 19:20:40,613 INFO L256 TraceCheckUtils]: 11: Hoare triple {323#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == 6 then 1 else 0)); {323#false} is VALID [2018-11-14 19:20:40,613 INFO L273 TraceCheckUtils]: 12: Hoare triple {323#false} ~cond := #in~cond; {323#false} is VALID [2018-11-14 19:20:40,613 INFO L273 TraceCheckUtils]: 13: Hoare triple {323#false} assume ~cond == 0; {323#false} is VALID [2018-11-14 19:20:40,613 INFO L273 TraceCheckUtils]: 14: Hoare triple {323#false} assume !false; {323#false} is VALID [2018-11-14 19:20:40,614 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 19:20:40,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:20:40,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 19:20:40,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 19:20:40,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:40,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:20:40,669 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 19:20:40,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:20:40,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:20:40,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:20:40,671 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 6 states. [2018-11-14 19:20:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:40,818 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-14 19:20:40,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:20:40,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 19:20:40,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:20:40,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-14 19:20:40,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:20:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-14 19:20:40,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2018-11-14 19:20:40,868 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 19:20:40,869 INFO L225 Difference]: With dead ends: 23 [2018-11-14 19:20:40,869 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 19:20:40,870 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 3 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 19:20:40,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 19:20:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-14 19:20:40,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:40,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-14 19:20:40,886 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 19:20:40,887 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 19:20:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:40,888 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 19:20:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 19:20:40,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:40,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:40,889 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 19:20:40,890 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 19:20:40,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:40,892 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 19:20:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 19:20:40,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:40,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:40,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:40,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 19:20:40,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-14 19:20:40,894 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-14 19:20:40,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:40,895 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-14 19:20:40,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:20:40,895 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 19:20:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 19:20:40,896 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:20:40,896 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:20:40,896 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:20:40,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:20:40,897 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 3 times [2018-11-14 19:20:40,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:20:40,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:20:40,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:40,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:20:40,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:20:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:41,094 INFO L256 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2018-11-14 19:20:41,094 INFO L273 TraceCheckUtils]: 1: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-14 19:20:41,095 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {471#true} {471#true} #32#return; {471#true} is VALID [2018-11-14 19:20:41,095 INFO L256 TraceCheckUtils]: 3: Hoare triple {471#true} call #t~ret1 := main(); {471#true} is VALID [2018-11-14 19:20:41,096 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 19:20:41,097 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 19:20:41,098 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 19:20:41,098 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 19:20:41,099 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 19:20:41,108 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 19:20:41,110 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 19:20:41,110 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 19:20:41,111 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 19:20:41,111 INFO L256 TraceCheckUtils]: 13: Hoare triple {472#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == 6 then 1 else 0)); {472#false} is VALID [2018-11-14 19:20:41,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {472#false} ~cond := #in~cond; {472#false} is VALID [2018-11-14 19:20:41,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {472#false} assume ~cond == 0; {472#false} is VALID [2018-11-14 19:20:41,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {472#false} assume !false; {472#false} is VALID [2018-11-14 19:20:41,113 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 19:20:41,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:20:41,113 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 19:20:41,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:20:41,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 19:20:41,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:20:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:20:41,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:20:41,287 INFO L256 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2018-11-14 19:20:41,287 INFO L273 TraceCheckUtils]: 1: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-14 19:20:41,288 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {471#true} {471#true} #32#return; {471#true} is VALID [2018-11-14 19:20:41,288 INFO L256 TraceCheckUtils]: 3: Hoare triple {471#true} call #t~ret1 := main(); {471#true} is VALID [2018-11-14 19:20:41,288 INFO L273 TraceCheckUtils]: 4: Hoare triple {471#true} ~x~0 := 0;~y~0 := 1; {471#true} is VALID [2018-11-14 19:20:41,288 INFO L273 TraceCheckUtils]: 5: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-14 19:20:41,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {471#true} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {471#true} is VALID [2018-11-14 19:20:41,289 INFO L273 TraceCheckUtils]: 7: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-14 19:20:41,289 INFO L273 TraceCheckUtils]: 8: Hoare triple {471#true} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {471#true} is VALID [2018-11-14 19:20:41,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-14 19:20:41,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {471#true} assume !!(~x~0 % 4294967296 < 6);#t~post0 := ~x~0;~x~0 := #t~post0 + 1;havoc #t~post0;~y~0 := ~y~0 * 2; {510#(< (mod (+ main_~x~0 4294967295) 4294967296) 6)} is VALID [2018-11-14 19:20:41,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {510#(< (mod (+ main_~x~0 4294967295) 4294967296) 6)} assume true; {510#(< (mod (+ main_~x~0 4294967295) 4294967296) 6)} is VALID [2018-11-14 19:20:41,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {510#(< (mod (+ main_~x~0 4294967295) 4294967296) 6)} assume !(~x~0 % 4294967296 < 6); {517#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 6) (<= 6 (mod main_~x~0 4294967296)))} is VALID [2018-11-14 19:20:41,298 INFO L256 TraceCheckUtils]: 13: Hoare triple {517#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 6) (<= 6 (mod main_~x~0 4294967296)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == 6 then 1 else 0)); {521#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 19:20:41,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {521#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {525#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 19:20:41,299 INFO L273 TraceCheckUtils]: 15: Hoare triple {525#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {472#false} is VALID [2018-11-14 19:20:41,299 INFO L273 TraceCheckUtils]: 16: Hoare triple {472#false} assume !false; {472#false} is VALID [2018-11-14 19:20:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 19:20:41,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:20:41,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-14 19:20:41,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-14 19:20:41,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:20:41,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 19:20:41,392 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 19:20:41,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 19:20:41,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 19:20:41,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:20:41,393 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2018-11-14 19:20:41,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:41,797 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-14 19:20:41,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 19:20:41,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-11-14 19:20:41,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:20:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:20:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2018-11-14 19:20:41,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:20:41,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2018-11-14 19:20:41,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2018-11-14 19:20:41,892 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 19:20:41,892 INFO L225 Difference]: With dead ends: 23 [2018-11-14 19:20:41,892 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 19:20:41,893 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-14 19:20:41,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 19:20:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 19:20:41,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:20:41,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 19:20:41,894 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:20:41,894 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:20:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:41,894 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:20:41,895 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:20:41,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:41,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:41,895 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 19:20:41,895 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 19:20:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:20:41,896 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 19:20:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:20:41,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:41,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:20:41,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:20:41,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:20:41,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 19:20:41,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 19:20:41,897 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-11-14 19:20:41,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:20:41,897 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 19:20:41,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 19:20:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 19:20:41,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:20:41,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 19:20:42,039 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 19:20:42,039 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:20:42,039 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 19:20:42,040 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 19:20:42,040 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 19:20:42,040 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 19:20:42,040 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 8 16) the Hoare annotation is: true [2018-11-14 19:20:42,040 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 8 16) no Hoare annotation was computed. [2018-11-14 19:20:42,041 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 8 16) no Hoare annotation was computed. [2018-11-14 19:20:42,041 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 14) no Hoare annotation was computed. [2018-11-14 19:20:42,041 INFO L421 ceAbstractionStarter]: At program point L11-3(lines 11 14) the Hoare annotation is: (or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (< (mod (+ main_~x~0 4294967295) 4294967296) 6)) [2018-11-14 19:20:42,041 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 14) the Hoare annotation is: (and (< (mod (+ main_~x~0 4294967295) 4294967296) 6) (<= 6 (mod main_~x~0 4294967296))) [2018-11-14 19:20:42,041 INFO L425 ceAbstractionStarter]: For program point L3-2(lines 2 7) no Hoare annotation was computed. [2018-11-14 19:20:42,041 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 2 7) the Hoare annotation is: true [2018-11-14 19:20:42,042 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 2 7) no Hoare annotation was computed. [2018-11-14 19:20:42,042 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2018-11-14 19:20:42,042 INFO L425 ceAbstractionStarter]: For program point L4(line 4) no Hoare annotation was computed. [2018-11-14 19:20:42,042 INFO L425 ceAbstractionStarter]: For program point L3(lines 3 5) no Hoare annotation was computed. [2018-11-14 19:20:42,044 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:20:42,045 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 19:20:42,045 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 19:20:42,045 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:20:42,045 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 19:20:42,045 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 19:20:42,046 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 19:20:42,046 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 19:20:42,046 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 19:20:42,046 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2018-11-14 19:20:42,046 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:20:42,046 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 19:20:42,047 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 19:20:42,047 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-14 19:20:42,047 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 19:20:42,047 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 19:20:42,047 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 19:20:42,047 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 19:20:42,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:20:42 BoogieIcfgContainer [2018-11-14 19:20:42,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 19:20:42,058 INFO L168 Benchmark]: Toolchain (without parser) took 5630.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 693.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -466.3 MB). Peak memory consumption was 226.8 MB. Max. memory is 7.1 GB. [2018-11-14 19:20:42,060 INFO L168 Benchmark]: CDTParser took 0.18 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 19:20:42,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.10 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 19:20:42,062 INFO L168 Benchmark]: Boogie Preprocessor took 37.20 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 19:20:42,062 INFO L168 Benchmark]: RCFGBuilder took 601.83 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 693.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -739.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-14 19:20:42,063 INFO L168 Benchmark]: TraceAbstraction took 4718.68 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 262.8 MB). Peak memory consumption was 262.8 MB. Max. memory is 7.1 GB. [2018-11-14 19:20:42,067 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.18 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. * CACSL2BoogieTranslator took 268.10 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 37.20 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 601.83 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 693.1 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -739.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4718.68 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 262.8 MB). Peak memory consumption was 262.8 MB. Max. memory is 7.1 GB. * 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 Derived loop invariant: (x <= 0 && 0 <= x) || (x + 4294967295) % 4294967296 < 6 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. SAFE Result, 4.6s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 63 SDtfs, 2 SDslu, 125 SDs, 0 SdLazy, 66 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, 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.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 17 NumberOfFragments, 33 HoareAnnotationTreeSize, 12 FomulaSimplifications, 18 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 111 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 4629 SizeOfPredicates, 2 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 12/40 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...