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/loops-crafted-1/Mono3_false-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:24:43,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:24:43,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:24:43,086 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:24:43,087 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:24:43,088 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:24:43,089 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:24:43,091 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:24:43,093 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:24:43,094 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:24:43,095 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:24:43,095 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:24:43,096 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:24:43,097 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:24:43,098 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:24:43,099 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:24:43,100 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:24:43,102 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:24:43,104 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:24:43,106 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:24:43,107 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:24:43,108 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:24:43,111 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:24:43,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:24:43,112 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:24:43,113 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:24:43,114 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:24:43,115 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:24:43,116 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:24:43,117 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:24:43,117 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:24:43,118 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:24:43,118 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:24:43,118 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:24:43,119 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:24:43,120 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:24:43,120 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:24:43,141 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:24:43,141 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:24:43,143 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:24:43,143 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:24:43,143 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:24:43,143 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:24:43,144 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:24:43,144 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:24:43,145 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:24:43,145 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:24:43,145 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:24:43,145 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:24:43,145 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:24:43,145 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:24:43,145 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:24:43,146 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:24:43,146 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:24:43,146 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:24:43,146 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:24:43,146 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:24:43,147 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:24:43,147 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:24:43,147 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:24:43,147 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:24:43,147 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:24:43,147 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:24:43,148 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:24:43,148 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:24:43,148 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:24:43,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:24:43,148 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:24:43,213 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:24:43,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:24:43,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:24:43,232 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:24:43,232 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:24:43,233 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono3_false-unreach-call1.c [2018-11-14 19:24:43,294 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6640e644/542d0b4a5d9647e2867a2b2d0eb0eb24/FLAGa86afe573 [2018-11-14 19:24:43,735 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:24:43,736 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono3_false-unreach-call1.c [2018-11-14 19:24:43,742 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6640e644/542d0b4a5d9647e2867a2b2d0eb0eb24/FLAGa86afe573 [2018-11-14 19:24:43,758 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6640e644/542d0b4a5d9647e2867a2b2d0eb0eb24 [2018-11-14 19:24:43,767 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:24:43,769 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:24:43,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:24:43,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:24:43,774 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:24:43,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:24:43" (1/1) ... [2018-11-14 19:24:43,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@445fe728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:43, skipping insertion in model container [2018-11-14 19:24:43,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:24:43" (1/1) ... [2018-11-14 19:24:43,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:24:43,811 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:24:44,061 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:24:44,068 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:24:44,092 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:24:44,109 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:24:44,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:44 WrapperNode [2018-11-14 19:24:44,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:24:44,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:24:44,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:24:44,111 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:24:44,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:44" (1/1) ... [2018-11-14 19:24:44,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:44" (1/1) ... [2018-11-14 19:24:44,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:44" (1/1) ... [2018-11-14 19:24:44,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:44" (1/1) ... [2018-11-14 19:24:44,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:44" (1/1) ... [2018-11-14 19:24:44,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:44" (1/1) ... [2018-11-14 19:24:44,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:44" (1/1) ... [2018-11-14 19:24:44,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:24:44,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:24:44,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:24:44,158 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:24:44,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:44" (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:24:44,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:24:44,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:24:44,301 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 19:24:44,301 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:24:44,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:24:44,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 19:24:44,301 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:24:44,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:24:44,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:24:44,753 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:24:44,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:24:44 BoogieIcfgContainer [2018-11-14 19:24:44,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:24:44,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:24:44,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:24:44,758 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:24:44,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:24:43" (1/3) ... [2018-11-14 19:24:44,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5ece6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:24:44, skipping insertion in model container [2018-11-14 19:24:44,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:24:44" (2/3) ... [2018-11-14 19:24:44,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a5ece6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:24:44, skipping insertion in model container [2018-11-14 19:24:44,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:24:44" (3/3) ... [2018-11-14 19:24:44,763 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono3_false-unreach-call1.c [2018-11-14 19:24:44,773 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:24:44,782 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:24:44,796 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:24:44,829 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:24:44,830 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:24:44,830 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:24:44,830 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:24:44,830 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:24:44,831 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:24:44,831 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:24:44,831 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:24:44,831 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:24:44,851 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-14 19:24:44,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 19:24:44,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:44,859 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:44,861 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:44,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:44,868 INFO L82 PathProgramCache]: Analyzing trace with hash -146959038, now seen corresponding path program 1 times [2018-11-14 19:24:44,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:44,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:44,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:44,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:44,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:45,038 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-14 19:24:45,042 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-14 19:24:45,042 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #39#return; {23#true} is VALID [2018-11-14 19:24:45,043 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2018-11-14 19:24:45,043 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} ~x~0 := 0;~y~0 := 0; {23#true} is VALID [2018-11-14 19:24:45,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-14 19:24:45,051 INFO L256 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {24#false} is VALID [2018-11-14 19:24:45,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-14 19:24:45,052 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} assume ~cond == 0; {24#false} is VALID [2018-11-14 19:24:45,052 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-14 19:24:45,055 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:24:45,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:24:45,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:24:45,064 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 19:24:45,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:45,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:24:45,136 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:24:45,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:24:45,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:24:45,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:24:45,147 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-14 19:24:45,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:45,219 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-14 19:24:45,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:24:45,219 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 19:24:45,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:24:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-14 19:24:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:24:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-14 19:24:45,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2018-11-14 19:24:45,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:45,479 INFO L225 Difference]: With dead ends: 31 [2018-11-14 19:24:45,480 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 19:24:45,483 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:24:45,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 19:24:45,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 19:24:45,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:45,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 19:24:45,523 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 19:24:45,523 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 19:24:45,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:45,527 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-14 19:24:45,527 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 19:24:45,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:45,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:45,528 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 19:24:45,528 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 19:24:45,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:45,532 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-14 19:24:45,532 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 19:24:45,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:45,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:45,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:45,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 19:24:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-14 19:24:45,537 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-14 19:24:45,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:45,538 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-14 19:24:45,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:24:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-14 19:24:45,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 19:24:45,539 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:45,539 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:45,540 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:45,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:45,540 INFO L82 PathProgramCache]: Analyzing trace with hash -717461825, now seen corresponding path program 1 times [2018-11-14 19:24:45,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:45,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:45,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:45,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:45,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:45,761 INFO L256 TraceCheckUtils]: 0: Hoare triple {116#true} call ULTIMATE.init(); {116#true} is VALID [2018-11-14 19:24:45,762 INFO L273 TraceCheckUtils]: 1: Hoare triple {116#true} assume true; {116#true} is VALID [2018-11-14 19:24:45,762 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {116#true} {116#true} #39#return; {116#true} is VALID [2018-11-14 19:24:45,762 INFO L256 TraceCheckUtils]: 3: Hoare triple {116#true} call #t~ret3 := main(); {116#true} is VALID [2018-11-14 19:24:45,766 INFO L273 TraceCheckUtils]: 4: Hoare triple {116#true} ~x~0 := 0;~y~0 := 0; {118#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:45,769 INFO L273 TraceCheckUtils]: 5: Hoare triple {118#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {118#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:45,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {118#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 1000000); {117#false} is VALID [2018-11-14 19:24:45,779 INFO L256 TraceCheckUtils]: 7: Hoare triple {117#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {117#false} is VALID [2018-11-14 19:24:45,779 INFO L273 TraceCheckUtils]: 8: Hoare triple {117#false} ~cond := #in~cond; {117#false} is VALID [2018-11-14 19:24:45,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {117#false} assume ~cond == 0; {117#false} is VALID [2018-11-14 19:24:45,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {117#false} assume !false; {117#false} is VALID [2018-11-14 19:24:45,781 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:24:45,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:24:45,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:24:45,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 19:24:45,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:45,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:24:45,927 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:24:45,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:24:45,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:24:45,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:24:45,928 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2018-11-14 19:24:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:46,163 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-14 19:24:46,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:24:46,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 19:24:46,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:24:46,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2018-11-14 19:24:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:24:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2018-11-14 19:24:46,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2018-11-14 19:24:46,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:46,284 INFO L225 Difference]: With dead ends: 27 [2018-11-14 19:24:46,285 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 19:24:46,286 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 19:24:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 19:24:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-14 19:24:46,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:46,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 17 states. [2018-11-14 19:24:46,298 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 17 states. [2018-11-14 19:24:46,298 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 17 states. [2018-11-14 19:24:46,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:46,301 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-14 19:24:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 19:24:46,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:46,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:46,302 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states. [2018-11-14 19:24:46,302 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states. [2018-11-14 19:24:46,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:46,304 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-14 19:24:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 19:24:46,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:46,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:46,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:46,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:46,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:24:46,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-14 19:24:46,307 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 11 [2018-11-14 19:24:46,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:46,308 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-14 19:24:46,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:24:46,308 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-14 19:24:46,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 19:24:46,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:46,309 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:46,310 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:46,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:46,310 INFO L82 PathProgramCache]: Analyzing trace with hash 514987241, now seen corresponding path program 1 times [2018-11-14 19:24:46,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:46,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:46,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:46,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:46,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:46,454 INFO L256 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2018-11-14 19:24:46,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-14 19:24:46,455 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {220#true} {220#true} #39#return; {220#true} is VALID [2018-11-14 19:24:46,455 INFO L256 TraceCheckUtils]: 3: Hoare triple {220#true} call #t~ret3 := main(); {220#true} is VALID [2018-11-14 19:24:46,457 INFO L273 TraceCheckUtils]: 4: Hoare triple {220#true} ~x~0 := 0;~y~0 := 0; {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:46,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:46,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:46,460 INFO L273 TraceCheckUtils]: 7: Hoare triple {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:46,461 INFO L273 TraceCheckUtils]: 8: Hoare triple {222#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {223#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:24:46,467 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {223#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:24:46,468 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 1000000); {221#false} is VALID [2018-11-14 19:24:46,468 INFO L256 TraceCheckUtils]: 11: Hoare triple {221#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {221#false} is VALID [2018-11-14 19:24:46,468 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#false} ~cond := #in~cond; {221#false} is VALID [2018-11-14 19:24:46,468 INFO L273 TraceCheckUtils]: 13: Hoare triple {221#false} assume ~cond == 0; {221#false} is VALID [2018-11-14 19:24:46,469 INFO L273 TraceCheckUtils]: 14: Hoare triple {221#false} assume !false; {221#false} is VALID [2018-11-14 19:24:46,470 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:24:46,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:24:46,471 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:24:46,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:46,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:24:46,958 INFO L256 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2018-11-14 19:24:46,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-14 19:24:46,959 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {220#true} {220#true} #39#return; {220#true} is VALID [2018-11-14 19:24:46,959 INFO L256 TraceCheckUtils]: 3: Hoare triple {220#true} call #t~ret3 := main(); {220#true} is VALID [2018-11-14 19:24:46,960 INFO L273 TraceCheckUtils]: 4: Hoare triple {220#true} ~x~0 := 0;~y~0 := 0; {239#(and (= main_~y~0 0) (= main_~x~0 0))} is VALID [2018-11-14 19:24:46,961 INFO L273 TraceCheckUtils]: 5: Hoare triple {239#(and (= main_~y~0 0) (= main_~x~0 0))} assume true; {239#(and (= main_~y~0 0) (= main_~x~0 0))} is VALID [2018-11-14 19:24:46,962 INFO L273 TraceCheckUtils]: 6: Hoare triple {239#(and (= main_~y~0 0) (= main_~x~0 0))} assume !!(~x~0 % 4294967296 < 1000000); {239#(and (= main_~y~0 0) (= main_~x~0 0))} is VALID [2018-11-14 19:24:46,962 INFO L273 TraceCheckUtils]: 7: Hoare triple {239#(and (= main_~y~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {249#(and (= main_~y~0 1) (= main_~x~0 0))} is VALID [2018-11-14 19:24:46,963 INFO L273 TraceCheckUtils]: 8: Hoare triple {249#(and (= main_~y~0 1) (= main_~x~0 0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {253#(and (= main_~x~0 1) (= main_~y~0 1))} is VALID [2018-11-14 19:24:46,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {253#(and (= main_~x~0 1) (= main_~y~0 1))} assume true; {253#(and (= main_~x~0 1) (= main_~y~0 1))} is VALID [2018-11-14 19:24:46,970 INFO L273 TraceCheckUtils]: 10: Hoare triple {253#(and (= main_~x~0 1) (= main_~y~0 1))} assume !(~x~0 % 4294967296 < 1000000); {221#false} is VALID [2018-11-14 19:24:46,970 INFO L256 TraceCheckUtils]: 11: Hoare triple {221#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {221#false} is VALID [2018-11-14 19:24:46,971 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#false} ~cond := #in~cond; {221#false} is VALID [2018-11-14 19:24:46,971 INFO L273 TraceCheckUtils]: 13: Hoare triple {221#false} assume ~cond == 0; {221#false} is VALID [2018-11-14 19:24:46,971 INFO L273 TraceCheckUtils]: 14: Hoare triple {221#false} assume !false; {221#false} is VALID [2018-11-14 19:24:46,973 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:24:46,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:24:46,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2018-11-14 19:24:46,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-14 19:24:46,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:46,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 19:24:47,060 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 19:24:47,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 19:24:47,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 19:24:47,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:24:47,061 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2018-11-14 19:24:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:47,525 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-14 19:24:47,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:24:47,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-14 19:24:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:24:47,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-14 19:24:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 19:24:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-14 19:24:47,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2018-11-14 19:24:47,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:47,636 INFO L225 Difference]: With dead ends: 31 [2018-11-14 19:24:47,636 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 19:24:47,636 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:24:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 19:24:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-14 19:24:47,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:47,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-14 19:24:47,664 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-14 19:24:47,665 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-14 19:24:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:47,667 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-14 19:24:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-14 19:24:47,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:47,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:47,668 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-14 19:24:47,668 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-14 19:24:47,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:47,671 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-14 19:24:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-14 19:24:47,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:47,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:47,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:47,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 19:24:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-14 19:24:47,674 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2018-11-14 19:24:47,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:47,674 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-14 19:24:47,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 19:24:47,675 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-14 19:24:47,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 19:24:47,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:47,676 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:47,676 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:47,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:47,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1005624851, now seen corresponding path program 2 times [2018-11-14 19:24:47,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:47,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:47,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:47,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:47,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:47,941 INFO L256 TraceCheckUtils]: 0: Hoare triple {388#true} call ULTIMATE.init(); {388#true} is VALID [2018-11-14 19:24:47,942 INFO L273 TraceCheckUtils]: 1: Hoare triple {388#true} assume true; {388#true} is VALID [2018-11-14 19:24:47,942 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {388#true} {388#true} #39#return; {388#true} is VALID [2018-11-14 19:24:47,942 INFO L256 TraceCheckUtils]: 3: Hoare triple {388#true} call #t~ret3 := main(); {388#true} is VALID [2018-11-14 19:24:47,944 INFO L273 TraceCheckUtils]: 4: Hoare triple {388#true} ~x~0 := 0;~y~0 := 0; {390#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:47,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {390#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {390#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:47,946 INFO L273 TraceCheckUtils]: 6: Hoare triple {390#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {390#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:47,946 INFO L273 TraceCheckUtils]: 7: Hoare triple {390#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {390#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:47,948 INFO L273 TraceCheckUtils]: 8: Hoare triple {390#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {391#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:47,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {391#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {391#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:47,960 INFO L273 TraceCheckUtils]: 10: Hoare triple {391#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {391#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:47,963 INFO L273 TraceCheckUtils]: 11: Hoare triple {391#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {391#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:47,964 INFO L273 TraceCheckUtils]: 12: Hoare triple {391#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {392#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:24:47,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {392#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {392#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:24:47,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {392#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 1000000); {389#false} is VALID [2018-11-14 19:24:47,975 INFO L256 TraceCheckUtils]: 15: Hoare triple {389#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {389#false} is VALID [2018-11-14 19:24:47,975 INFO L273 TraceCheckUtils]: 16: Hoare triple {389#false} ~cond := #in~cond; {389#false} is VALID [2018-11-14 19:24:47,976 INFO L273 TraceCheckUtils]: 17: Hoare triple {389#false} assume ~cond == 0; {389#false} is VALID [2018-11-14 19:24:47,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {389#false} assume !false; {389#false} is VALID [2018-11-14 19:24:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:47,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:24:47,978 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:24:47,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:24:47,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:24:47,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:24:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:48,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:24:48,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {388#true} call ULTIMATE.init(); {388#true} is VALID [2018-11-14 19:24:48,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {388#true} assume true; {388#true} is VALID [2018-11-14 19:24:48,241 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {388#true} {388#true} #39#return; {388#true} is VALID [2018-11-14 19:24:48,241 INFO L256 TraceCheckUtils]: 3: Hoare triple {388#true} call #t~ret3 := main(); {388#true} is VALID [2018-11-14 19:24:48,242 INFO L273 TraceCheckUtils]: 4: Hoare triple {388#true} ~x~0 := 0;~y~0 := 0; {408#(and (= main_~y~0 0) (= main_~x~0 0))} is VALID [2018-11-14 19:24:48,242 INFO L273 TraceCheckUtils]: 5: Hoare triple {408#(and (= main_~y~0 0) (= main_~x~0 0))} assume true; {408#(and (= main_~y~0 0) (= main_~x~0 0))} is VALID [2018-11-14 19:24:48,243 INFO L273 TraceCheckUtils]: 6: Hoare triple {408#(and (= main_~y~0 0) (= main_~x~0 0))} assume !!(~x~0 % 4294967296 < 1000000); {408#(and (= main_~y~0 0) (= main_~x~0 0))} is VALID [2018-11-14 19:24:48,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {408#(and (= main_~y~0 0) (= main_~x~0 0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {418#(and (= main_~y~0 1) (= main_~x~0 0))} is VALID [2018-11-14 19:24:48,244 INFO L273 TraceCheckUtils]: 8: Hoare triple {418#(and (= main_~y~0 1) (= main_~x~0 0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {422#(and (= main_~x~0 1) (= main_~y~0 1))} is VALID [2018-11-14 19:24:48,245 INFO L273 TraceCheckUtils]: 9: Hoare triple {422#(and (= main_~x~0 1) (= main_~y~0 1))} assume true; {422#(and (= main_~x~0 1) (= main_~y~0 1))} is VALID [2018-11-14 19:24:48,246 INFO L273 TraceCheckUtils]: 10: Hoare triple {422#(and (= main_~x~0 1) (= main_~y~0 1))} assume !!(~x~0 % 4294967296 < 1000000); {422#(and (= main_~x~0 1) (= main_~y~0 1))} is VALID [2018-11-14 19:24:48,247 INFO L273 TraceCheckUtils]: 11: Hoare triple {422#(and (= main_~x~0 1) (= main_~y~0 1))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {432#(and (= main_~x~0 1) (= main_~y~0 2))} is VALID [2018-11-14 19:24:48,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {432#(and (= main_~x~0 1) (= main_~y~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {436#(and (= main_~x~0 2) (= main_~y~0 2))} is VALID [2018-11-14 19:24:48,250 INFO L273 TraceCheckUtils]: 13: Hoare triple {436#(and (= main_~x~0 2) (= main_~y~0 2))} assume true; {436#(and (= main_~x~0 2) (= main_~y~0 2))} is VALID [2018-11-14 19:24:48,251 INFO L273 TraceCheckUtils]: 14: Hoare triple {436#(and (= main_~x~0 2) (= main_~y~0 2))} assume !(~x~0 % 4294967296 < 1000000); {389#false} is VALID [2018-11-14 19:24:48,251 INFO L256 TraceCheckUtils]: 15: Hoare triple {389#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {389#false} is VALID [2018-11-14 19:24:48,252 INFO L273 TraceCheckUtils]: 16: Hoare triple {389#false} ~cond := #in~cond; {389#false} is VALID [2018-11-14 19:24:48,252 INFO L273 TraceCheckUtils]: 17: Hoare triple {389#false} assume ~cond == 0; {389#false} is VALID [2018-11-14 19:24:48,253 INFO L273 TraceCheckUtils]: 18: Hoare triple {389#false} assume !false; {389#false} is VALID [2018-11-14 19:24:48,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:48,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:24:48,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-11-14 19:24:48,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-11-14 19:24:48,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:48,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 19:24:48,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:48,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 19:24:48,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 19:24:48,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:24:48,313 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2018-11-14 19:24:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:48,687 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-14 19:24:48,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:24:48,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-11-14 19:24:48,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:24:48,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2018-11-14 19:24:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:24:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2018-11-14 19:24:48,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2018-11-14 19:24:48,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:48,745 INFO L225 Difference]: With dead ends: 35 [2018-11-14 19:24:48,746 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 19:24:48,747 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:24:48,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 19:24:48,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-14 19:24:48,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:48,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-14 19:24:48,772 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-14 19:24:48,772 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-14 19:24:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:48,775 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-14 19:24:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-14 19:24:48,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:48,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:48,776 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-14 19:24:48,777 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-14 19:24:48,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:48,779 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-14 19:24:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-14 19:24:48,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:48,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:48,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:48,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:48,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 19:24:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-14 19:24:48,782 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2018-11-14 19:24:48,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:48,782 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-14 19:24:48,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 19:24:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-14 19:24:48,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 19:24:48,784 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:48,784 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:48,784 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:48,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:48,785 INFO L82 PathProgramCache]: Analyzing trace with hash 387088957, now seen corresponding path program 3 times [2018-11-14 19:24:48,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:48,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:48,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:48,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:24:48,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:48,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {589#true} call ULTIMATE.init(); {589#true} is VALID [2018-11-14 19:24:48,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {589#true} assume true; {589#true} is VALID [2018-11-14 19:24:48,975 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {589#true} {589#true} #39#return; {589#true} is VALID [2018-11-14 19:24:48,975 INFO L256 TraceCheckUtils]: 3: Hoare triple {589#true} call #t~ret3 := main(); {589#true} is VALID [2018-11-14 19:24:48,976 INFO L273 TraceCheckUtils]: 4: Hoare triple {589#true} ~x~0 := 0;~y~0 := 0; {591#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:48,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {591#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {591#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:48,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {591#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {591#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:48,978 INFO L273 TraceCheckUtils]: 7: Hoare triple {591#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {591#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:48,978 INFO L273 TraceCheckUtils]: 8: Hoare triple {591#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {592#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:48,979 INFO L273 TraceCheckUtils]: 9: Hoare triple {592#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {592#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:48,980 INFO L273 TraceCheckUtils]: 10: Hoare triple {592#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {592#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:48,980 INFO L273 TraceCheckUtils]: 11: Hoare triple {592#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {592#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:48,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {592#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {593#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:48,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {593#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {593#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:48,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {593#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {593#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:48,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {593#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {593#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:48,989 INFO L273 TraceCheckUtils]: 16: Hoare triple {593#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {594#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:24:48,990 INFO L273 TraceCheckUtils]: 17: Hoare triple {594#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {594#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:24:48,992 INFO L273 TraceCheckUtils]: 18: Hoare triple {594#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 1000000); {590#false} is VALID [2018-11-14 19:24:48,992 INFO L256 TraceCheckUtils]: 19: Hoare triple {590#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {590#false} is VALID [2018-11-14 19:24:48,992 INFO L273 TraceCheckUtils]: 20: Hoare triple {590#false} ~cond := #in~cond; {590#false} is VALID [2018-11-14 19:24:48,992 INFO L273 TraceCheckUtils]: 21: Hoare triple {590#false} assume ~cond == 0; {590#false} is VALID [2018-11-14 19:24:48,993 INFO L273 TraceCheckUtils]: 22: Hoare triple {590#false} assume !false; {590#false} is VALID [2018-11-14 19:24:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:48,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:24:48,996 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:24:49,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:24:49,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 19:24:49,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:24:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:49,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:24:49,163 INFO L256 TraceCheckUtils]: 0: Hoare triple {589#true} call ULTIMATE.init(); {589#true} is VALID [2018-11-14 19:24:49,164 INFO L273 TraceCheckUtils]: 1: Hoare triple {589#true} assume true; {589#true} is VALID [2018-11-14 19:24:49,164 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {589#true} {589#true} #39#return; {589#true} is VALID [2018-11-14 19:24:49,164 INFO L256 TraceCheckUtils]: 3: Hoare triple {589#true} call #t~ret3 := main(); {589#true} is VALID [2018-11-14 19:24:49,165 INFO L273 TraceCheckUtils]: 4: Hoare triple {589#true} ~x~0 := 0;~y~0 := 0; {589#true} is VALID [2018-11-14 19:24:49,165 INFO L273 TraceCheckUtils]: 5: Hoare triple {589#true} assume true; {589#true} is VALID [2018-11-14 19:24:49,165 INFO L273 TraceCheckUtils]: 6: Hoare triple {589#true} assume !!(~x~0 % 4294967296 < 1000000); {589#true} is VALID [2018-11-14 19:24:49,166 INFO L273 TraceCheckUtils]: 7: Hoare triple {589#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {589#true} is VALID [2018-11-14 19:24:49,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {589#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {589#true} is VALID [2018-11-14 19:24:49,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {589#true} assume true; {589#true} is VALID [2018-11-14 19:24:49,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {589#true} assume !!(~x~0 % 4294967296 < 1000000); {589#true} is VALID [2018-11-14 19:24:49,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {589#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {589#true} is VALID [2018-11-14 19:24:49,167 INFO L273 TraceCheckUtils]: 12: Hoare triple {589#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {589#true} is VALID [2018-11-14 19:24:49,168 INFO L273 TraceCheckUtils]: 13: Hoare triple {589#true} assume true; {589#true} is VALID [2018-11-14 19:24:49,168 INFO L273 TraceCheckUtils]: 14: Hoare triple {589#true} assume !!(~x~0 % 4294967296 < 1000000); {589#true} is VALID [2018-11-14 19:24:49,182 INFO L273 TraceCheckUtils]: 15: Hoare triple {589#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {643#(< (mod main_~x~0 4294967296) 500000)} is VALID [2018-11-14 19:24:49,186 INFO L273 TraceCheckUtils]: 16: Hoare triple {643#(< (mod main_~x~0 4294967296) 500000)} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {647#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2018-11-14 19:24:49,186 INFO L273 TraceCheckUtils]: 17: Hoare triple {647#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} assume true; {647#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2018-11-14 19:24:49,187 INFO L273 TraceCheckUtils]: 18: Hoare triple {647#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} assume !(~x~0 % 4294967296 < 1000000); {590#false} is VALID [2018-11-14 19:24:49,187 INFO L256 TraceCheckUtils]: 19: Hoare triple {590#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {590#false} is VALID [2018-11-14 19:24:49,188 INFO L273 TraceCheckUtils]: 20: Hoare triple {590#false} ~cond := #in~cond; {590#false} is VALID [2018-11-14 19:24:49,188 INFO L273 TraceCheckUtils]: 21: Hoare triple {590#false} assume ~cond == 0; {590#false} is VALID [2018-11-14 19:24:49,188 INFO L273 TraceCheckUtils]: 22: Hoare triple {590#false} assume !false; {590#false} is VALID [2018-11-14 19:24:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 19:24:49,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:24:49,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-14 19:24:49,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-14 19:24:49,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:49,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:24:49,254 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:24:49,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:24:49,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:24:49,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:24:49,256 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 8 states. [2018-11-14 19:24:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:49,908 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-14 19:24:49,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 19:24:49,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-14 19:24:49,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:24:49,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2018-11-14 19:24:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:24:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2018-11-14 19:24:49,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2018-11-14 19:24:49,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:49,993 INFO L225 Difference]: With dead ends: 48 [2018-11-14 19:24:49,994 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 19:24:49,994 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:24:49,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 19:24:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-14 19:24:50,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:50,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 36 states. [2018-11-14 19:24:50,020 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 36 states. [2018-11-14 19:24:50,020 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 36 states. [2018-11-14 19:24:50,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:50,024 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-14 19:24:50,024 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-14 19:24:50,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:50,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:50,025 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 39 states. [2018-11-14 19:24:50,025 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 39 states. [2018-11-14 19:24:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:50,028 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-14 19:24:50,028 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-14 19:24:50,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:50,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:50,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:50,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 19:24:50,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-14 19:24:50,032 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 23 [2018-11-14 19:24:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:50,032 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-14 19:24:50,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:24:50,032 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-14 19:24:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 19:24:50,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:50,034 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:50,034 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:50,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:50,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1305979513, now seen corresponding path program 1 times [2018-11-14 19:24:50,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:50,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:50,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:50,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:24:50,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:50,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {860#true} call ULTIMATE.init(); {860#true} is VALID [2018-11-14 19:24:50,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {860#true} assume true; {860#true} is VALID [2018-11-14 19:24:50,307 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {860#true} {860#true} #39#return; {860#true} is VALID [2018-11-14 19:24:50,308 INFO L256 TraceCheckUtils]: 3: Hoare triple {860#true} call #t~ret3 := main(); {860#true} is VALID [2018-11-14 19:24:50,309 INFO L273 TraceCheckUtils]: 4: Hoare triple {860#true} ~x~0 := 0;~y~0 := 0; {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:50,309 INFO L273 TraceCheckUtils]: 5: Hoare triple {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:50,310 INFO L273 TraceCheckUtils]: 6: Hoare triple {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:50,323 INFO L273 TraceCheckUtils]: 7: Hoare triple {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:50,324 INFO L273 TraceCheckUtils]: 8: Hoare triple {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:50,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:50,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:50,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:50,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:50,328 INFO L273 TraceCheckUtils]: 13: Hoare triple {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:50,329 INFO L273 TraceCheckUtils]: 14: Hoare triple {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:50,330 INFO L273 TraceCheckUtils]: 15: Hoare triple {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:50,331 INFO L273 TraceCheckUtils]: 16: Hoare triple {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:50,332 INFO L273 TraceCheckUtils]: 17: Hoare triple {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:50,332 INFO L273 TraceCheckUtils]: 18: Hoare triple {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:50,333 INFO L273 TraceCheckUtils]: 19: Hoare triple {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:50,334 INFO L273 TraceCheckUtils]: 20: Hoare triple {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:50,335 INFO L273 TraceCheckUtils]: 21: Hoare triple {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:50,336 INFO L273 TraceCheckUtils]: 22: Hoare triple {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 1000000); {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:50,337 INFO L273 TraceCheckUtils]: 23: Hoare triple {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:50,338 INFO L273 TraceCheckUtils]: 24: Hoare triple {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:50,339 INFO L273 TraceCheckUtils]: 25: Hoare triple {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:50,340 INFO L273 TraceCheckUtils]: 26: Hoare triple {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:50,341 INFO L273 TraceCheckUtils]: 27: Hoare triple {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:50,342 INFO L273 TraceCheckUtils]: 28: Hoare triple {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {868#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:24:50,343 INFO L273 TraceCheckUtils]: 29: Hoare triple {868#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {868#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:24:50,344 INFO L273 TraceCheckUtils]: 30: Hoare triple {868#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 1000000); {861#false} is VALID [2018-11-14 19:24:50,344 INFO L256 TraceCheckUtils]: 31: Hoare triple {861#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {861#false} is VALID [2018-11-14 19:24:50,345 INFO L273 TraceCheckUtils]: 32: Hoare triple {861#false} ~cond := #in~cond; {861#false} is VALID [2018-11-14 19:24:50,345 INFO L273 TraceCheckUtils]: 33: Hoare triple {861#false} assume ~cond == 0; {861#false} is VALID [2018-11-14 19:24:50,345 INFO L273 TraceCheckUtils]: 34: Hoare triple {861#false} assume !false; {861#false} is VALID [2018-11-14 19:24:50,350 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:50,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:24:50,350 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 19:24:50,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:50,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:24:50,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {860#true} call ULTIMATE.init(); {860#true} is VALID [2018-11-14 19:24:50,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {860#true} assume true; {860#true} is VALID [2018-11-14 19:24:50,605 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {860#true} {860#true} #39#return; {860#true} is VALID [2018-11-14 19:24:50,606 INFO L256 TraceCheckUtils]: 3: Hoare triple {860#true} call #t~ret3 := main(); {860#true} is VALID [2018-11-14 19:24:50,628 INFO L273 TraceCheckUtils]: 4: Hoare triple {860#true} ~x~0 := 0;~y~0 := 0; {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:50,643 INFO L273 TraceCheckUtils]: 5: Hoare triple {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:50,657 INFO L273 TraceCheckUtils]: 6: Hoare triple {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:50,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:50,682 INFO L273 TraceCheckUtils]: 8: Hoare triple {862#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:50,691 INFO L273 TraceCheckUtils]: 9: Hoare triple {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:50,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:50,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:50,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:50,739 INFO L273 TraceCheckUtils]: 13: Hoare triple {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:50,748 INFO L273 TraceCheckUtils]: 14: Hoare triple {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:50,761 INFO L273 TraceCheckUtils]: 15: Hoare triple {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:50,762 INFO L273 TraceCheckUtils]: 16: Hoare triple {864#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:50,767 INFO L273 TraceCheckUtils]: 17: Hoare triple {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:50,767 INFO L273 TraceCheckUtils]: 18: Hoare triple {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:50,769 INFO L273 TraceCheckUtils]: 19: Hoare triple {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:50,769 INFO L273 TraceCheckUtils]: 20: Hoare triple {865#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:50,771 INFO L273 TraceCheckUtils]: 21: Hoare triple {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:50,772 INFO L273 TraceCheckUtils]: 22: Hoare triple {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 1000000); {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:50,773 INFO L273 TraceCheckUtils]: 23: Hoare triple {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:50,774 INFO L273 TraceCheckUtils]: 24: Hoare triple {866#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:50,774 INFO L273 TraceCheckUtils]: 25: Hoare triple {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:50,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:50,776 INFO L273 TraceCheckUtils]: 27: Hoare triple {867#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {861#false} is VALID [2018-11-14 19:24:50,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {861#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {861#false} is VALID [2018-11-14 19:24:50,777 INFO L273 TraceCheckUtils]: 29: Hoare triple {861#false} assume true; {861#false} is VALID [2018-11-14 19:24:50,778 INFO L273 TraceCheckUtils]: 30: Hoare triple {861#false} assume !(~x~0 % 4294967296 < 1000000); {861#false} is VALID [2018-11-14 19:24:50,778 INFO L256 TraceCheckUtils]: 31: Hoare triple {861#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {861#false} is VALID [2018-11-14 19:24:50,779 INFO L273 TraceCheckUtils]: 32: Hoare triple {861#false} ~cond := #in~cond; {861#false} is VALID [2018-11-14 19:24:50,779 INFO L273 TraceCheckUtils]: 33: Hoare triple {861#false} assume ~cond == 0; {861#false} is VALID [2018-11-14 19:24:50,780 INFO L273 TraceCheckUtils]: 34: Hoare triple {861#false} assume !false; {861#false} is VALID [2018-11-14 19:24:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:50,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:24:50,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2018-11-14 19:24:50,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-14 19:24:50,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:50,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 19:24:50,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:50,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 19:24:50,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 19:24:50,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:24:50,904 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 9 states. [2018-11-14 19:24:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:51,403 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-11-14 19:24:51,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 19:24:51,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-14 19:24:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:24:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2018-11-14 19:24:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:24:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 55 transitions. [2018-11-14 19:24:51,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 55 transitions. [2018-11-14 19:24:51,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:51,497 INFO L225 Difference]: With dead ends: 57 [2018-11-14 19:24:51,497 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 19:24:51,497 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:24:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 19:24:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-14 19:24:51,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:51,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 44 states. [2018-11-14 19:24:51,550 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 44 states. [2018-11-14 19:24:51,551 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 44 states. [2018-11-14 19:24:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:51,553 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-14 19:24:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-14 19:24:51,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:51,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:51,554 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 45 states. [2018-11-14 19:24:51,554 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 45 states. [2018-11-14 19:24:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:51,556 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-14 19:24:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-14 19:24:51,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:51,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:51,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:51,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 19:24:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-14 19:24:51,560 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 35 [2018-11-14 19:24:51,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:51,560 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-14 19:24:51,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 19:24:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-14 19:24:51,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 19:24:51,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:51,562 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:51,562 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:51,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:51,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1729092147, now seen corresponding path program 2 times [2018-11-14 19:24:51,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:51,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:51,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:51,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:24:51,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:52,763 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-14 19:24:52,771 INFO L256 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2018-11-14 19:24:52,771 INFO L273 TraceCheckUtils]: 1: Hoare triple {1198#true} assume true; {1198#true} is VALID [2018-11-14 19:24:52,771 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1198#true} {1198#true} #39#return; {1198#true} is VALID [2018-11-14 19:24:52,772 INFO L256 TraceCheckUtils]: 3: Hoare triple {1198#true} call #t~ret3 := main(); {1198#true} is VALID [2018-11-14 19:24:52,772 INFO L273 TraceCheckUtils]: 4: Hoare triple {1198#true} ~x~0 := 0;~y~0 := 0; {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:52,774 INFO L273 TraceCheckUtils]: 5: Hoare triple {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:52,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:52,777 INFO L273 TraceCheckUtils]: 7: Hoare triple {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:52,777 INFO L273 TraceCheckUtils]: 8: Hoare triple {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:52,778 INFO L273 TraceCheckUtils]: 9: Hoare triple {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:52,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:52,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:52,782 INFO L273 TraceCheckUtils]: 12: Hoare triple {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:52,784 INFO L273 TraceCheckUtils]: 13: Hoare triple {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:52,785 INFO L273 TraceCheckUtils]: 14: Hoare triple {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:52,786 INFO L273 TraceCheckUtils]: 15: Hoare triple {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:52,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:52,788 INFO L273 TraceCheckUtils]: 17: Hoare triple {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:52,789 INFO L273 TraceCheckUtils]: 18: Hoare triple {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:52,790 INFO L273 TraceCheckUtils]: 19: Hoare triple {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:52,793 INFO L273 TraceCheckUtils]: 20: Hoare triple {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:52,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:52,794 INFO L273 TraceCheckUtils]: 22: Hoare triple {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 1000000); {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:52,796 INFO L273 TraceCheckUtils]: 23: Hoare triple {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:52,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:52,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:52,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:52,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:52,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:24:52,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:24:52,803 INFO L273 TraceCheckUtils]: 30: Hoare triple {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:24:52,805 INFO L273 TraceCheckUtils]: 31: Hoare triple {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:24:52,806 INFO L273 TraceCheckUtils]: 32: Hoare triple {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:24:52,807 INFO L273 TraceCheckUtils]: 33: Hoare triple {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:24:52,808 INFO L273 TraceCheckUtils]: 34: Hoare triple {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:24:52,809 INFO L273 TraceCheckUtils]: 35: Hoare triple {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:24:52,810 INFO L273 TraceCheckUtils]: 36: Hoare triple {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1208#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:24:52,812 INFO L273 TraceCheckUtils]: 37: Hoare triple {1208#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1208#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:24:52,814 INFO L273 TraceCheckUtils]: 38: Hoare triple {1208#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 1000000); {1199#false} is VALID [2018-11-14 19:24:52,814 INFO L256 TraceCheckUtils]: 39: Hoare triple {1199#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {1199#false} is VALID [2018-11-14 19:24:52,814 INFO L273 TraceCheckUtils]: 40: Hoare triple {1199#false} ~cond := #in~cond; {1199#false} is VALID [2018-11-14 19:24:52,815 INFO L273 TraceCheckUtils]: 41: Hoare triple {1199#false} assume ~cond == 0; {1199#false} is VALID [2018-11-14 19:24:52,815 INFO L273 TraceCheckUtils]: 42: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2018-11-14 19:24:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:52,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:24:52,823 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 19:24:52,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:24:52,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:24:52,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:24:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:52,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:24:53,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2018-11-14 19:24:53,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {1198#true} assume true; {1198#true} is VALID [2018-11-14 19:24:53,278 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1198#true} {1198#true} #39#return; {1198#true} is VALID [2018-11-14 19:24:53,279 INFO L256 TraceCheckUtils]: 3: Hoare triple {1198#true} call #t~ret3 := main(); {1198#true} is VALID [2018-11-14 19:24:53,279 INFO L273 TraceCheckUtils]: 4: Hoare triple {1198#true} ~x~0 := 0;~y~0 := 0; {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:53,282 INFO L273 TraceCheckUtils]: 5: Hoare triple {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:53,285 INFO L273 TraceCheckUtils]: 6: Hoare triple {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:53,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:53,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {1200#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:53,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:53,293 INFO L273 TraceCheckUtils]: 10: Hoare triple {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:53,298 INFO L273 TraceCheckUtils]: 11: Hoare triple {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:53,298 INFO L273 TraceCheckUtils]: 12: Hoare triple {1201#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:53,299 INFO L273 TraceCheckUtils]: 13: Hoare triple {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:53,299 INFO L273 TraceCheckUtils]: 14: Hoare triple {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:53,300 INFO L273 TraceCheckUtils]: 15: Hoare triple {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:53,300 INFO L273 TraceCheckUtils]: 16: Hoare triple {1202#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:53,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:53,302 INFO L273 TraceCheckUtils]: 18: Hoare triple {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:53,302 INFO L273 TraceCheckUtils]: 19: Hoare triple {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:53,303 INFO L273 TraceCheckUtils]: 20: Hoare triple {1203#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:53,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:53,305 INFO L273 TraceCheckUtils]: 22: Hoare triple {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 1000000); {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:53,306 INFO L273 TraceCheckUtils]: 23: Hoare triple {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:53,307 INFO L273 TraceCheckUtils]: 24: Hoare triple {1204#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:53,308 INFO L273 TraceCheckUtils]: 25: Hoare triple {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:53,308 INFO L273 TraceCheckUtils]: 26: Hoare triple {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:53,309 INFO L273 TraceCheckUtils]: 27: Hoare triple {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:53,310 INFO L273 TraceCheckUtils]: 28: Hoare triple {1205#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:24:53,311 INFO L273 TraceCheckUtils]: 29: Hoare triple {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:24:53,312 INFO L273 TraceCheckUtils]: 30: Hoare triple {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:24:53,313 INFO L273 TraceCheckUtils]: 31: Hoare triple {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:24:53,314 INFO L273 TraceCheckUtils]: 32: Hoare triple {1206#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:24:53,315 INFO L273 TraceCheckUtils]: 33: Hoare triple {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:24:53,315 INFO L273 TraceCheckUtils]: 34: Hoare triple {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:24:53,316 INFO L273 TraceCheckUtils]: 35: Hoare triple {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:24:53,317 INFO L273 TraceCheckUtils]: 36: Hoare triple {1207#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1320#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:24:53,318 INFO L273 TraceCheckUtils]: 37: Hoare triple {1320#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1320#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:24:53,319 INFO L273 TraceCheckUtils]: 38: Hoare triple {1320#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 1000000); {1199#false} is VALID [2018-11-14 19:24:53,319 INFO L256 TraceCheckUtils]: 39: Hoare triple {1199#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {1199#false} is VALID [2018-11-14 19:24:53,320 INFO L273 TraceCheckUtils]: 40: Hoare triple {1199#false} ~cond := #in~cond; {1199#false} is VALID [2018-11-14 19:24:53,320 INFO L273 TraceCheckUtils]: 41: Hoare triple {1199#false} assume ~cond == 0; {1199#false} is VALID [2018-11-14 19:24:53,320 INFO L273 TraceCheckUtils]: 42: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2018-11-14 19:24:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:53,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:24:53,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 19:24:53,348 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-11-14 19:24:53,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:53,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 19:24:53,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:53,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 19:24:53,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 19:24:53,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-14 19:24:53,405 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 12 states. [2018-11-14 19:24:54,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:54,835 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-11-14 19:24:54,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 19:24:54,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-11-14 19:24:54,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:54,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 19:24:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2018-11-14 19:24:54,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 19:24:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2018-11-14 19:24:54,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 63 transitions. [2018-11-14 19:24:54,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:54,949 INFO L225 Difference]: With dead ends: 65 [2018-11-14 19:24:54,949 INFO L226 Difference]: Without dead ends: 53 [2018-11-14 19:24:54,949 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-14 19:24:54,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-14 19:24:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-14 19:24:55,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:55,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2018-11-14 19:24:55,148 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2018-11-14 19:24:55,148 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2018-11-14 19:24:55,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:55,150 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-14 19:24:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-14 19:24:55,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:55,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:55,152 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2018-11-14 19:24:55,152 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2018-11-14 19:24:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:55,154 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-14 19:24:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-14 19:24:55,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:55,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:55,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:55,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 19:24:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-11-14 19:24:55,157 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 43 [2018-11-14 19:24:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:55,158 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-11-14 19:24:55,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 19:24:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-14 19:24:55,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 19:24:55,159 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:55,159 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:55,160 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:55,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:55,160 INFO L82 PathProgramCache]: Analyzing trace with hash -741208799, now seen corresponding path program 3 times [2018-11-14 19:24:55,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:55,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:55,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:55,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:24:55,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:55,683 INFO L256 TraceCheckUtils]: 0: Hoare triple {1599#true} call ULTIMATE.init(); {1599#true} is VALID [2018-11-14 19:24:55,683 INFO L273 TraceCheckUtils]: 1: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 19:24:55,683 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1599#true} {1599#true} #39#return; {1599#true} is VALID [2018-11-14 19:24:55,684 INFO L256 TraceCheckUtils]: 3: Hoare triple {1599#true} call #t~ret3 := main(); {1599#true} is VALID [2018-11-14 19:24:55,684 INFO L273 TraceCheckUtils]: 4: Hoare triple {1599#true} ~x~0 := 0;~y~0 := 0; {1601#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:55,685 INFO L273 TraceCheckUtils]: 5: Hoare triple {1601#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1601#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:55,685 INFO L273 TraceCheckUtils]: 6: Hoare triple {1601#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1601#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:55,686 INFO L273 TraceCheckUtils]: 7: Hoare triple {1601#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1601#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:24:55,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {1601#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1602#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:55,687 INFO L273 TraceCheckUtils]: 9: Hoare triple {1602#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1602#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:55,688 INFO L273 TraceCheckUtils]: 10: Hoare triple {1602#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1602#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:55,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {1602#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1602#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:24:55,690 INFO L273 TraceCheckUtils]: 12: Hoare triple {1602#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:55,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {1603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:55,692 INFO L273 TraceCheckUtils]: 14: Hoare triple {1603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {1603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:55,693 INFO L273 TraceCheckUtils]: 15: Hoare triple {1603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:24:55,695 INFO L273 TraceCheckUtils]: 16: Hoare triple {1603#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1604#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:55,696 INFO L273 TraceCheckUtils]: 17: Hoare triple {1604#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1604#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:55,696 INFO L273 TraceCheckUtils]: 18: Hoare triple {1604#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1604#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:55,697 INFO L273 TraceCheckUtils]: 19: Hoare triple {1604#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1604#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:24:55,697 INFO L273 TraceCheckUtils]: 20: Hoare triple {1604#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:55,698 INFO L273 TraceCheckUtils]: 21: Hoare triple {1605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:55,698 INFO L273 TraceCheckUtils]: 22: Hoare triple {1605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 1000000); {1605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:55,699 INFO L273 TraceCheckUtils]: 23: Hoare triple {1605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:24:55,700 INFO L273 TraceCheckUtils]: 24: Hoare triple {1605#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1606#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:55,701 INFO L273 TraceCheckUtils]: 25: Hoare triple {1606#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1606#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:55,702 INFO L273 TraceCheckUtils]: 26: Hoare triple {1606#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {1606#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:55,702 INFO L273 TraceCheckUtils]: 27: Hoare triple {1606#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1606#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:24:55,703 INFO L273 TraceCheckUtils]: 28: Hoare triple {1606#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:24:55,704 INFO L273 TraceCheckUtils]: 29: Hoare triple {1607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:24:55,705 INFO L273 TraceCheckUtils]: 30: Hoare triple {1607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:24:55,706 INFO L273 TraceCheckUtils]: 31: Hoare triple {1607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:24:55,707 INFO L273 TraceCheckUtils]: 32: Hoare triple {1607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:24:55,708 INFO L273 TraceCheckUtils]: 33: Hoare triple {1608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {1608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:24:55,709 INFO L273 TraceCheckUtils]: 34: Hoare triple {1608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {1608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:24:55,710 INFO L273 TraceCheckUtils]: 35: Hoare triple {1608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:24:55,711 INFO L273 TraceCheckUtils]: 36: Hoare triple {1608#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:24:55,711 INFO L273 TraceCheckUtils]: 37: Hoare triple {1609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:24:55,712 INFO L273 TraceCheckUtils]: 38: Hoare triple {1609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 1000000); {1609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:24:55,713 INFO L273 TraceCheckUtils]: 39: Hoare triple {1609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:24:55,714 INFO L273 TraceCheckUtils]: 40: Hoare triple {1609#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1610#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:24:55,715 INFO L273 TraceCheckUtils]: 41: Hoare triple {1610#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {1610#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:24:55,716 INFO L273 TraceCheckUtils]: 42: Hoare triple {1610#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 1000000); {1610#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:24:55,717 INFO L273 TraceCheckUtils]: 43: Hoare triple {1610#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {1610#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:24:55,718 INFO L273 TraceCheckUtils]: 44: Hoare triple {1610#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1611#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:24:55,719 INFO L273 TraceCheckUtils]: 45: Hoare triple {1611#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1611#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:24:55,720 INFO L273 TraceCheckUtils]: 46: Hoare triple {1611#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 1000000); {1600#false} is VALID [2018-11-14 19:24:55,720 INFO L256 TraceCheckUtils]: 47: Hoare triple {1600#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {1600#false} is VALID [2018-11-14 19:24:55,721 INFO L273 TraceCheckUtils]: 48: Hoare triple {1600#false} ~cond := #in~cond; {1600#false} is VALID [2018-11-14 19:24:55,721 INFO L273 TraceCheckUtils]: 49: Hoare triple {1600#false} assume ~cond == 0; {1600#false} is VALID [2018-11-14 19:24:55,721 INFO L273 TraceCheckUtils]: 50: Hoare triple {1600#false} assume !false; {1600#false} is VALID [2018-11-14 19:24:55,726 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:24:55,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:24:55,726 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 19:24:55,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:24:55,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 19:24:55,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:24:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:24:55,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:24:55,899 INFO L256 TraceCheckUtils]: 0: Hoare triple {1599#true} call ULTIMATE.init(); {1599#true} is VALID [2018-11-14 19:24:55,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 19:24:55,900 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1599#true} {1599#true} #39#return; {1599#true} is VALID [2018-11-14 19:24:55,900 INFO L256 TraceCheckUtils]: 3: Hoare triple {1599#true} call #t~ret3 := main(); {1599#true} is VALID [2018-11-14 19:24:55,900 INFO L273 TraceCheckUtils]: 4: Hoare triple {1599#true} ~x~0 := 0;~y~0 := 0; {1599#true} is VALID [2018-11-14 19:24:55,900 INFO L273 TraceCheckUtils]: 5: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 19:24:55,901 INFO L273 TraceCheckUtils]: 6: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 19:24:55,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1599#true} is VALID [2018-11-14 19:24:55,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {1599#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1599#true} is VALID [2018-11-14 19:24:55,902 INFO L273 TraceCheckUtils]: 9: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 19:24:55,902 INFO L273 TraceCheckUtils]: 10: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 19:24:55,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1599#true} is VALID [2018-11-14 19:24:55,903 INFO L273 TraceCheckUtils]: 12: Hoare triple {1599#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1599#true} is VALID [2018-11-14 19:24:55,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 19:24:55,903 INFO L273 TraceCheckUtils]: 14: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 19:24:55,903 INFO L273 TraceCheckUtils]: 15: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1599#true} is VALID [2018-11-14 19:24:55,903 INFO L273 TraceCheckUtils]: 16: Hoare triple {1599#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1599#true} is VALID [2018-11-14 19:24:55,904 INFO L273 TraceCheckUtils]: 17: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 19:24:55,904 INFO L273 TraceCheckUtils]: 18: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 19:24:55,904 INFO L273 TraceCheckUtils]: 19: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1599#true} is VALID [2018-11-14 19:24:55,904 INFO L273 TraceCheckUtils]: 20: Hoare triple {1599#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1599#true} is VALID [2018-11-14 19:24:55,904 INFO L273 TraceCheckUtils]: 21: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 19:24:55,905 INFO L273 TraceCheckUtils]: 22: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 19:24:55,905 INFO L273 TraceCheckUtils]: 23: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1599#true} is VALID [2018-11-14 19:24:55,905 INFO L273 TraceCheckUtils]: 24: Hoare triple {1599#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1599#true} is VALID [2018-11-14 19:24:55,905 INFO L273 TraceCheckUtils]: 25: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 19:24:55,905 INFO L273 TraceCheckUtils]: 26: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 19:24:55,905 INFO L273 TraceCheckUtils]: 27: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1599#true} is VALID [2018-11-14 19:24:55,906 INFO L273 TraceCheckUtils]: 28: Hoare triple {1599#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1599#true} is VALID [2018-11-14 19:24:55,906 INFO L273 TraceCheckUtils]: 29: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 19:24:55,906 INFO L273 TraceCheckUtils]: 30: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 19:24:55,906 INFO L273 TraceCheckUtils]: 31: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1599#true} is VALID [2018-11-14 19:24:55,907 INFO L273 TraceCheckUtils]: 32: Hoare triple {1599#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1599#true} is VALID [2018-11-14 19:24:55,907 INFO L273 TraceCheckUtils]: 33: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 19:24:55,907 INFO L273 TraceCheckUtils]: 34: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 19:24:55,907 INFO L273 TraceCheckUtils]: 35: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1599#true} is VALID [2018-11-14 19:24:55,907 INFO L273 TraceCheckUtils]: 36: Hoare triple {1599#true} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1599#true} is VALID [2018-11-14 19:24:55,907 INFO L273 TraceCheckUtils]: 37: Hoare triple {1599#true} assume true; {1599#true} is VALID [2018-11-14 19:24:55,908 INFO L273 TraceCheckUtils]: 38: Hoare triple {1599#true} assume !!(~x~0 % 4294967296 < 1000000); {1599#true} is VALID [2018-11-14 19:24:55,908 INFO L273 TraceCheckUtils]: 39: Hoare triple {1599#true} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {1732#(< (mod main_~x~0 4294967296) 500000)} is VALID [2018-11-14 19:24:55,909 INFO L273 TraceCheckUtils]: 40: Hoare triple {1732#(< (mod main_~x~0 4294967296) 500000)} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1736#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2018-11-14 19:24:55,911 INFO L273 TraceCheckUtils]: 41: Hoare triple {1736#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} assume true; {1736#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2018-11-14 19:24:55,913 INFO L273 TraceCheckUtils]: 42: Hoare triple {1736#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} assume !!(~x~0 % 4294967296 < 1000000); {1736#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2018-11-14 19:24:55,914 INFO L273 TraceCheckUtils]: 43: Hoare triple {1736#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {1736#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} is VALID [2018-11-14 19:24:55,915 INFO L273 TraceCheckUtils]: 44: Hoare triple {1736#(< (mod (+ main_~x~0 4294967295) 4294967296) 500000)} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1749#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} is VALID [2018-11-14 19:24:55,915 INFO L273 TraceCheckUtils]: 45: Hoare triple {1749#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} assume true; {1749#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} is VALID [2018-11-14 19:24:55,916 INFO L273 TraceCheckUtils]: 46: Hoare triple {1749#(< (mod (+ main_~x~0 4294967294) 4294967296) 500000)} assume !(~x~0 % 4294967296 < 1000000); {1600#false} is VALID [2018-11-14 19:24:55,916 INFO L256 TraceCheckUtils]: 47: Hoare triple {1600#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {1600#false} is VALID [2018-11-14 19:24:55,916 INFO L273 TraceCheckUtils]: 48: Hoare triple {1600#false} ~cond := #in~cond; {1600#false} is VALID [2018-11-14 19:24:55,916 INFO L273 TraceCheckUtils]: 49: Hoare triple {1600#false} assume ~cond == 0; {1600#false} is VALID [2018-11-14 19:24:55,917 INFO L273 TraceCheckUtils]: 50: Hoare triple {1600#false} assume !false; {1600#false} is VALID [2018-11-14 19:24:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 61 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-14 19:24:55,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:24:55,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2018-11-14 19:24:55,940 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-11-14 19:24:55,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:24:55,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 19:24:56,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:56,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 19:24:56,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 19:24:56,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-11-14 19:24:56,005 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 16 states. [2018-11-14 19:24:59,057 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 14 [2018-11-14 19:24:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:59,525 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2018-11-14 19:24:59,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 19:24:59,525 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-11-14 19:24:59,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:24:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 19:24:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2018-11-14 19:24:59,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 19:24:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2018-11-14 19:24:59,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 93 transitions. [2018-11-14 19:24:59,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:24:59,724 INFO L225 Difference]: With dead ends: 87 [2018-11-14 19:24:59,724 INFO L226 Difference]: Without dead ends: 75 [2018-11-14 19:24:59,725 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2018-11-14 19:24:59,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-14 19:24:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2018-11-14 19:24:59,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:24:59,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 68 states. [2018-11-14 19:24:59,767 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 68 states. [2018-11-14 19:24:59,767 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 68 states. [2018-11-14 19:24:59,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:59,773 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-11-14 19:24:59,773 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-14 19:24:59,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:59,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:59,774 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 75 states. [2018-11-14 19:24:59,774 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 75 states. [2018-11-14 19:24:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:24:59,777 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-11-14 19:24:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-14 19:24:59,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:24:59,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:24:59,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:24:59,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:24:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 19:24:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-14 19:24:59,781 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 51 [2018-11-14 19:24:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:24:59,781 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-14 19:24:59,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 19:24:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-14 19:24:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-14 19:24:59,784 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:24:59,784 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:24:59,785 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:24:59,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:24:59,788 INFO L82 PathProgramCache]: Analyzing trace with hash 732260999, now seen corresponding path program 4 times [2018-11-14 19:24:59,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:24:59,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:24:59,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:59,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:24:59,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:24:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:25:01,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {2128#true} call ULTIMATE.init(); {2128#true} is VALID [2018-11-14 19:25:01,003 INFO L273 TraceCheckUtils]: 1: Hoare triple {2128#true} assume true; {2128#true} is VALID [2018-11-14 19:25:01,003 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2128#true} {2128#true} #39#return; {2128#true} is VALID [2018-11-14 19:25:01,004 INFO L256 TraceCheckUtils]: 3: Hoare triple {2128#true} call #t~ret3 := main(); {2128#true} is VALID [2018-11-14 19:25:01,004 INFO L273 TraceCheckUtils]: 4: Hoare triple {2128#true} ~x~0 := 0;~y~0 := 0; {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:25:01,005 INFO L273 TraceCheckUtils]: 5: Hoare triple {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:25:01,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:25:01,006 INFO L273 TraceCheckUtils]: 7: Hoare triple {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:25:01,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:25:01,007 INFO L273 TraceCheckUtils]: 9: Hoare triple {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:25:01,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:25:01,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:25:01,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:25:01,010 INFO L273 TraceCheckUtils]: 13: Hoare triple {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:25:01,011 INFO L273 TraceCheckUtils]: 14: Hoare triple {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:25:01,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:25:01,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:25:01,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:25:01,013 INFO L273 TraceCheckUtils]: 18: Hoare triple {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:25:01,014 INFO L273 TraceCheckUtils]: 19: Hoare triple {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:25:01,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:25:01,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:25:01,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 1000000); {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:25:01,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:25:01,018 INFO L273 TraceCheckUtils]: 24: Hoare triple {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:25:01,018 INFO L273 TraceCheckUtils]: 25: Hoare triple {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:25:01,019 INFO L273 TraceCheckUtils]: 26: Hoare triple {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:25:01,020 INFO L273 TraceCheckUtils]: 27: Hoare triple {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:25:01,021 INFO L273 TraceCheckUtils]: 28: Hoare triple {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:25:01,021 INFO L273 TraceCheckUtils]: 29: Hoare triple {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:25:01,022 INFO L273 TraceCheckUtils]: 30: Hoare triple {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:25:01,023 INFO L273 TraceCheckUtils]: 31: Hoare triple {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:25:01,024 INFO L273 TraceCheckUtils]: 32: Hoare triple {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:25:01,024 INFO L273 TraceCheckUtils]: 33: Hoare triple {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:25:01,025 INFO L273 TraceCheckUtils]: 34: Hoare triple {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:25:01,026 INFO L273 TraceCheckUtils]: 35: Hoare triple {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:25:01,026 INFO L273 TraceCheckUtils]: 36: Hoare triple {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:25:01,027 INFO L273 TraceCheckUtils]: 37: Hoare triple {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:25:01,028 INFO L273 TraceCheckUtils]: 38: Hoare triple {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 1000000); {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:25:01,029 INFO L273 TraceCheckUtils]: 39: Hoare triple {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:25:01,029 INFO L273 TraceCheckUtils]: 40: Hoare triple {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:25:01,030 INFO L273 TraceCheckUtils]: 41: Hoare triple {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:25:01,037 INFO L273 TraceCheckUtils]: 42: Hoare triple {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 1000000); {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:25:01,038 INFO L273 TraceCheckUtils]: 43: Hoare triple {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:25:01,038 INFO L273 TraceCheckUtils]: 44: Hoare triple {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:25:01,039 INFO L273 TraceCheckUtils]: 45: Hoare triple {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:25:01,039 INFO L273 TraceCheckUtils]: 46: Hoare triple {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:25:01,039 INFO L273 TraceCheckUtils]: 47: Hoare triple {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:25:01,040 INFO L273 TraceCheckUtils]: 48: Hoare triple {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:25:01,040 INFO L273 TraceCheckUtils]: 49: Hoare triple {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:25:01,042 INFO L273 TraceCheckUtils]: 50: Hoare triple {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 1000000); {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:25:01,043 INFO L273 TraceCheckUtils]: 51: Hoare triple {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:25:01,044 INFO L273 TraceCheckUtils]: 52: Hoare triple {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:25:01,044 INFO L273 TraceCheckUtils]: 53: Hoare triple {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:25:01,045 INFO L273 TraceCheckUtils]: 54: Hoare triple {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:25:01,045 INFO L273 TraceCheckUtils]: 55: Hoare triple {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:25:01,046 INFO L273 TraceCheckUtils]: 56: Hoare triple {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2143#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:25:01,046 INFO L273 TraceCheckUtils]: 57: Hoare triple {2143#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {2143#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:25:01,047 INFO L273 TraceCheckUtils]: 58: Hoare triple {2143#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2143#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:25:01,047 INFO L273 TraceCheckUtils]: 59: Hoare triple {2143#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {2143#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:25:01,048 INFO L273 TraceCheckUtils]: 60: Hoare triple {2143#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2144#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:25:01,049 INFO L273 TraceCheckUtils]: 61: Hoare triple {2144#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {2144#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:25:01,050 INFO L273 TraceCheckUtils]: 62: Hoare triple {2144#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 1000000); {2129#false} is VALID [2018-11-14 19:25:01,050 INFO L256 TraceCheckUtils]: 63: Hoare triple {2129#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {2129#false} is VALID [2018-11-14 19:25:01,051 INFO L273 TraceCheckUtils]: 64: Hoare triple {2129#false} ~cond := #in~cond; {2129#false} is VALID [2018-11-14 19:25:01,051 INFO L273 TraceCheckUtils]: 65: Hoare triple {2129#false} assume ~cond == 0; {2129#false} is VALID [2018-11-14 19:25:01,051 INFO L273 TraceCheckUtils]: 66: Hoare triple {2129#false} assume !false; {2129#false} is VALID [2018-11-14 19:25:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:25:01,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:25:01,058 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 19:25:01,066 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 19:25:01,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 19:25:01,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:25:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:25:01,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:25:01,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {2128#true} call ULTIMATE.init(); {2128#true} is VALID [2018-11-14 19:25:01,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {2128#true} assume true; {2128#true} is VALID [2018-11-14 19:25:01,253 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2128#true} {2128#true} #39#return; {2128#true} is VALID [2018-11-14 19:25:01,253 INFO L256 TraceCheckUtils]: 3: Hoare triple {2128#true} call #t~ret3 := main(); {2128#true} is VALID [2018-11-14 19:25:01,254 INFO L273 TraceCheckUtils]: 4: Hoare triple {2128#true} ~x~0 := 0;~y~0 := 0; {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:25:01,254 INFO L273 TraceCheckUtils]: 5: Hoare triple {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:25:01,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:25:01,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:25:01,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {2130#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:25:01,286 INFO L273 TraceCheckUtils]: 9: Hoare triple {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:25:01,287 INFO L273 TraceCheckUtils]: 10: Hoare triple {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:25:01,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:25:01,288 INFO L273 TraceCheckUtils]: 12: Hoare triple {2131#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:25:01,288 INFO L273 TraceCheckUtils]: 13: Hoare triple {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:25:01,289 INFO L273 TraceCheckUtils]: 14: Hoare triple {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:25:01,289 INFO L273 TraceCheckUtils]: 15: Hoare triple {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:25:01,290 INFO L273 TraceCheckUtils]: 16: Hoare triple {2132#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:25:01,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:25:01,291 INFO L273 TraceCheckUtils]: 18: Hoare triple {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:25:01,292 INFO L273 TraceCheckUtils]: 19: Hoare triple {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:25:01,292 INFO L273 TraceCheckUtils]: 20: Hoare triple {2133#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:25:01,293 INFO L273 TraceCheckUtils]: 21: Hoare triple {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:25:01,294 INFO L273 TraceCheckUtils]: 22: Hoare triple {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 1000000); {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:25:01,294 INFO L273 TraceCheckUtils]: 23: Hoare triple {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:25:01,295 INFO L273 TraceCheckUtils]: 24: Hoare triple {2134#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:25:01,300 INFO L273 TraceCheckUtils]: 25: Hoare triple {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:25:01,301 INFO L273 TraceCheckUtils]: 26: Hoare triple {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:25:01,301 INFO L273 TraceCheckUtils]: 27: Hoare triple {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:25:01,302 INFO L273 TraceCheckUtils]: 28: Hoare triple {2135#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:25:01,302 INFO L273 TraceCheckUtils]: 29: Hoare triple {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:25:01,303 INFO L273 TraceCheckUtils]: 30: Hoare triple {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:25:01,303 INFO L273 TraceCheckUtils]: 31: Hoare triple {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:25:01,304 INFO L273 TraceCheckUtils]: 32: Hoare triple {2136#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:25:01,304 INFO L273 TraceCheckUtils]: 33: Hoare triple {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:25:01,304 INFO L273 TraceCheckUtils]: 34: Hoare triple {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:25:01,305 INFO L273 TraceCheckUtils]: 35: Hoare triple {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:25:01,306 INFO L273 TraceCheckUtils]: 36: Hoare triple {2137#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:25:01,307 INFO L273 TraceCheckUtils]: 37: Hoare triple {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:25:01,307 INFO L273 TraceCheckUtils]: 38: Hoare triple {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 1000000); {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:25:01,308 INFO L273 TraceCheckUtils]: 39: Hoare triple {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:25:01,309 INFO L273 TraceCheckUtils]: 40: Hoare triple {2138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:25:01,310 INFO L273 TraceCheckUtils]: 41: Hoare triple {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:25:01,310 INFO L273 TraceCheckUtils]: 42: Hoare triple {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 1000000); {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:25:01,311 INFO L273 TraceCheckUtils]: 43: Hoare triple {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:25:01,312 INFO L273 TraceCheckUtils]: 44: Hoare triple {2139#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:25:01,313 INFO L273 TraceCheckUtils]: 45: Hoare triple {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:25:01,314 INFO L273 TraceCheckUtils]: 46: Hoare triple {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:25:01,314 INFO L273 TraceCheckUtils]: 47: Hoare triple {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:25:01,315 INFO L273 TraceCheckUtils]: 48: Hoare triple {2140#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:25:01,316 INFO L273 TraceCheckUtils]: 49: Hoare triple {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:25:01,317 INFO L273 TraceCheckUtils]: 50: Hoare triple {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 1000000); {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:25:01,317 INFO L273 TraceCheckUtils]: 51: Hoare triple {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:25:01,333 INFO L273 TraceCheckUtils]: 52: Hoare triple {2141#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:25:01,334 INFO L273 TraceCheckUtils]: 53: Hoare triple {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:25:01,335 INFO L273 TraceCheckUtils]: 54: Hoare triple {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:25:01,335 INFO L273 TraceCheckUtils]: 55: Hoare triple {2142#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {2129#false} is VALID [2018-11-14 19:25:01,335 INFO L273 TraceCheckUtils]: 56: Hoare triple {2129#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2129#false} is VALID [2018-11-14 19:25:01,336 INFO L273 TraceCheckUtils]: 57: Hoare triple {2129#false} assume true; {2129#false} is VALID [2018-11-14 19:25:01,336 INFO L273 TraceCheckUtils]: 58: Hoare triple {2129#false} assume !!(~x~0 % 4294967296 < 1000000); {2129#false} is VALID [2018-11-14 19:25:01,336 INFO L273 TraceCheckUtils]: 59: Hoare triple {2129#false} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {2129#false} is VALID [2018-11-14 19:25:01,336 INFO L273 TraceCheckUtils]: 60: Hoare triple {2129#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2129#false} is VALID [2018-11-14 19:25:01,336 INFO L273 TraceCheckUtils]: 61: Hoare triple {2129#false} assume true; {2129#false} is VALID [2018-11-14 19:25:01,336 INFO L273 TraceCheckUtils]: 62: Hoare triple {2129#false} assume !(~x~0 % 4294967296 < 1000000); {2129#false} is VALID [2018-11-14 19:25:01,336 INFO L256 TraceCheckUtils]: 63: Hoare triple {2129#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {2129#false} is VALID [2018-11-14 19:25:01,336 INFO L273 TraceCheckUtils]: 64: Hoare triple {2129#false} ~cond := #in~cond; {2129#false} is VALID [2018-11-14 19:25:01,337 INFO L273 TraceCheckUtils]: 65: Hoare triple {2129#false} assume ~cond == 0; {2129#false} is VALID [2018-11-14 19:25:01,337 INFO L273 TraceCheckUtils]: 66: Hoare triple {2129#false} assume !false; {2129#false} is VALID [2018-11-14 19:25:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 89 proven. 300 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 19:25:01,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:25:01,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 17 [2018-11-14 19:25:01,365 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-14 19:25:01,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:25:01,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 19:25:01,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:25:01,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 19:25:01,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 19:25:01,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-14 19:25:01,434 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 17 states. [2018-11-14 19:25:03,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:25:03,101 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-11-14 19:25:03,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 19:25:03,102 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-11-14 19:25:03,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:25:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:25:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 88 transitions. [2018-11-14 19:25:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 19:25:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 88 transitions. [2018-11-14 19:25:03,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 88 transitions. [2018-11-14 19:25:03,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:25:03,255 INFO L225 Difference]: With dead ends: 97 [2018-11-14 19:25:03,255 INFO L226 Difference]: Without dead ends: 81 [2018-11-14 19:25:03,256 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-14 19:25:03,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-14 19:25:03,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-14 19:25:03,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:25:03,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 80 states. [2018-11-14 19:25:03,378 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 80 states. [2018-11-14 19:25:03,378 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 80 states. [2018-11-14 19:25:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:25:03,382 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-11-14 19:25:03,382 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-14 19:25:03,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:25:03,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:25:03,383 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 81 states. [2018-11-14 19:25:03,383 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 81 states. [2018-11-14 19:25:03,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:25:03,386 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-11-14 19:25:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-14 19:25:03,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:25:03,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:25:03,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:25:03,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:25:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 19:25:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-11-14 19:25:03,390 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 67 [2018-11-14 19:25:03,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:25:03,391 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-11-14 19:25:03,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 19:25:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-11-14 19:25:03,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-14 19:25:03,392 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:25:03,392 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 15, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:25:03,393 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:25:03,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:25:03,393 INFO L82 PathProgramCache]: Analyzing trace with hash 256570373, now seen corresponding path program 5 times [2018-11-14 19:25:03,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:25:03,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:25:03,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:25:03,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:25:03,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:25:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:25:04,349 INFO L256 TraceCheckUtils]: 0: Hoare triple {2737#true} call ULTIMATE.init(); {2737#true} is VALID [2018-11-14 19:25:04,349 INFO L273 TraceCheckUtils]: 1: Hoare triple {2737#true} assume true; {2737#true} is VALID [2018-11-14 19:25:04,349 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2737#true} {2737#true} #39#return; {2737#true} is VALID [2018-11-14 19:25:04,350 INFO L256 TraceCheckUtils]: 3: Hoare triple {2737#true} call #t~ret3 := main(); {2737#true} is VALID [2018-11-14 19:25:04,350 INFO L273 TraceCheckUtils]: 4: Hoare triple {2737#true} ~x~0 := 0;~y~0 := 0; {2739#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:25:04,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {2739#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2739#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:25:04,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {2739#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2739#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:25:04,352 INFO L273 TraceCheckUtils]: 7: Hoare triple {2739#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2739#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 19:25:04,353 INFO L273 TraceCheckUtils]: 8: Hoare triple {2739#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2740#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:25:04,354 INFO L273 TraceCheckUtils]: 9: Hoare triple {2740#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2740#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:25:04,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {2740#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2740#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:25:04,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {2740#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2740#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 19:25:04,356 INFO L273 TraceCheckUtils]: 12: Hoare triple {2740#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2741#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:25:04,357 INFO L273 TraceCheckUtils]: 13: Hoare triple {2741#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2741#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:25:04,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {2741#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 1000000); {2741#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:25:04,358 INFO L273 TraceCheckUtils]: 15: Hoare triple {2741#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2741#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 19:25:04,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {2741#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2742#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:25:04,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {2742#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2742#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:25:04,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {2742#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2742#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:25:04,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {2742#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2742#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 19:25:04,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {2742#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2743#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:25:04,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {2743#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2743#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:25:04,363 INFO L273 TraceCheckUtils]: 22: Hoare triple {2743#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 1000000); {2743#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:25:04,364 INFO L273 TraceCheckUtils]: 23: Hoare triple {2743#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2743#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 19:25:04,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {2743#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2744#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:25:04,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {2744#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2744#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:25:04,366 INFO L273 TraceCheckUtils]: 26: Hoare triple {2744#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 1000000); {2744#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:25:04,366 INFO L273 TraceCheckUtils]: 27: Hoare triple {2744#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2744#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 19:25:04,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {2744#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2745#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:25:04,368 INFO L273 TraceCheckUtils]: 29: Hoare triple {2745#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2745#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:25:04,368 INFO L273 TraceCheckUtils]: 30: Hoare triple {2745#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2745#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:25:04,369 INFO L273 TraceCheckUtils]: 31: Hoare triple {2745#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2745#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 19:25:04,370 INFO L273 TraceCheckUtils]: 32: Hoare triple {2745#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2746#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:25:04,371 INFO L273 TraceCheckUtils]: 33: Hoare triple {2746#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {2746#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:25:04,371 INFO L273 TraceCheckUtils]: 34: Hoare triple {2746#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2746#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:25:04,372 INFO L273 TraceCheckUtils]: 35: Hoare triple {2746#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2746#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 19:25:04,373 INFO L273 TraceCheckUtils]: 36: Hoare triple {2746#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2747#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:25:04,373 INFO L273 TraceCheckUtils]: 37: Hoare triple {2747#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2747#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:25:04,374 INFO L273 TraceCheckUtils]: 38: Hoare triple {2747#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 1000000); {2747#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:25:04,375 INFO L273 TraceCheckUtils]: 39: Hoare triple {2747#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2747#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 19:25:04,375 INFO L273 TraceCheckUtils]: 40: Hoare triple {2747#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2748#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:25:04,376 INFO L273 TraceCheckUtils]: 41: Hoare triple {2748#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {2748#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:25:04,377 INFO L273 TraceCheckUtils]: 42: Hoare triple {2748#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 1000000); {2748#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:25:04,377 INFO L273 TraceCheckUtils]: 43: Hoare triple {2748#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2748#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 19:25:04,378 INFO L273 TraceCheckUtils]: 44: Hoare triple {2748#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2749#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:25:04,379 INFO L273 TraceCheckUtils]: 45: Hoare triple {2749#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2749#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:25:04,379 INFO L273 TraceCheckUtils]: 46: Hoare triple {2749#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2749#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:25:04,380 INFO L273 TraceCheckUtils]: 47: Hoare triple {2749#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2749#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 19:25:04,381 INFO L273 TraceCheckUtils]: 48: Hoare triple {2749#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2750#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:25:04,381 INFO L273 TraceCheckUtils]: 49: Hoare triple {2750#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume true; {2750#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:25:04,382 INFO L273 TraceCheckUtils]: 50: Hoare triple {2750#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 1000000); {2750#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:25:04,383 INFO L273 TraceCheckUtils]: 51: Hoare triple {2750#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2750#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-14 19:25:04,384 INFO L273 TraceCheckUtils]: 52: Hoare triple {2750#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:25:04,384 INFO L273 TraceCheckUtils]: 53: Hoare triple {2751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:25:04,385 INFO L273 TraceCheckUtils]: 54: Hoare triple {2751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:25:04,386 INFO L273 TraceCheckUtils]: 55: Hoare triple {2751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 19:25:04,386 INFO L273 TraceCheckUtils]: 56: Hoare triple {2751#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2752#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:25:04,387 INFO L273 TraceCheckUtils]: 57: Hoare triple {2752#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume true; {2752#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:25:04,388 INFO L273 TraceCheckUtils]: 58: Hoare triple {2752#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2752#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:25:04,388 INFO L273 TraceCheckUtils]: 59: Hoare triple {2752#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2752#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-14 19:25:04,389 INFO L273 TraceCheckUtils]: 60: Hoare triple {2752#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2753#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:25:04,390 INFO L273 TraceCheckUtils]: 61: Hoare triple {2753#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2753#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:25:04,390 INFO L273 TraceCheckUtils]: 62: Hoare triple {2753#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2753#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:25:04,391 INFO L273 TraceCheckUtils]: 63: Hoare triple {2753#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 500000;#t~post0 := ~y~0;~y~0 := #t~post0 + 1;havoc #t~post0; {2753#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 19:25:04,392 INFO L273 TraceCheckUtils]: 64: Hoare triple {2753#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2754#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:25:04,392 INFO L273 TraceCheckUtils]: 65: Hoare triple {2754#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume true; {2754#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:25:04,393 INFO L273 TraceCheckUtils]: 66: Hoare triple {2754#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 1000000); {2754#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:25:04,394 INFO L273 TraceCheckUtils]: 67: Hoare triple {2754#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {2754#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-14 19:25:04,395 INFO L273 TraceCheckUtils]: 68: Hoare triple {2754#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:25:04,395 INFO L273 TraceCheckUtils]: 69: Hoare triple {2755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:25:04,396 INFO L273 TraceCheckUtils]: 70: Hoare triple {2755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 1000000); {2755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:25:04,397 INFO L273 TraceCheckUtils]: 71: Hoare triple {2755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 500000);#t~post1 := ~y~0;~y~0 := #t~post1 - 1;havoc #t~post1; {2755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 19:25:04,397 INFO L273 TraceCheckUtils]: 72: Hoare triple {2755#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2756#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:25:04,398 INFO L273 TraceCheckUtils]: 73: Hoare triple {2756#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {2756#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 19:25:04,399 INFO L273 TraceCheckUtils]: 74: Hoare triple {2756#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 1000000); {2738#false} is VALID [2018-11-14 19:25:04,399 INFO L256 TraceCheckUtils]: 75: Hoare triple {2738#false} call __VERIFIER_assert((if ~y~0 % 4294967296 != 0 then 1 else 0)); {2738#false} is VALID [2018-11-14 19:25:04,399 INFO L273 TraceCheckUtils]: 76: Hoare triple {2738#false} ~cond := #in~cond; {2738#false} is VALID [2018-11-14 19:25:04,400 INFO L273 TraceCheckUtils]: 77: Hoare triple {2738#false} assume ~cond == 0; {2738#false} is VALID [2018-11-14 19:25:04,400 INFO L273 TraceCheckUtils]: 78: Hoare triple {2738#false} assume !false; {2738#false} is VALID [2018-11-14 19:25:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 19:25:04,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:25:04,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:25:04,423 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1