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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono6_false-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:16:17,819 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:16:17,821 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:16:17,837 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:16:17,837 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:16:17,838 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:16:17,840 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:16:17,841 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:16:17,850 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:16:17,851 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:16:17,852 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:16:17,853 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:16:17,854 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:16:17,855 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:16:17,856 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:16:17,857 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:16:17,858 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:16:17,859 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:16:17,861 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:16:17,863 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:16:17,864 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:16:17,865 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:16:17,868 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:16:17,868 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:16:17,869 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:16:17,871 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:16:17,872 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:16:17,873 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:16:17,873 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:16:17,875 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:16:17,875 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:16:17,876 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:16:17,876 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:16:17,877 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:16:17,878 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:16:17,879 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:16:17,879 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:16:17,894 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:16:17,894 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:16:17,895 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:16:17,895 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:16:17,896 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:16:17,896 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:16:17,896 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:16:17,897 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:16:17,897 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:16:17,897 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:16:17,897 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:16:17,897 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:16:17,898 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:16:17,898 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:16:17,898 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:16:17,898 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:16:17,898 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:16:17,898 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:16:17,899 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:16:17,899 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:16:17,899 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:16:17,899 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:16:17,899 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:16:17,900 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:16:17,900 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:16:17,900 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:16:17,900 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:16:17,900 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:16:17,901 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:16:17,901 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:16:17,901 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:16:17,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:16:17,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:16:17,995 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:16:17,997 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:16:17,998 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:16:17,998 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono6_false-unreach-call1.c [2018-11-23 13:16:18,060 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5b0005c9/1a877d7a690b4e5a9062ca40a0aefd84/FLAG7a7d2e552 [2018-11-23 13:16:18,562 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:16:18,563 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_false-unreach-call1.c [2018-11-23 13:16:18,570 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5b0005c9/1a877d7a690b4e5a9062ca40a0aefd84/FLAG7a7d2e552 [2018-11-23 13:16:18,904 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5b0005c9/1a877d7a690b4e5a9062ca40a0aefd84 [2018-11-23 13:16:18,913 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:16:18,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:16:18,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:16:18,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:16:18,920 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:16:18,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:18" (1/1) ... [2018-11-23 13:16:18,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148c27e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:18, skipping insertion in model container [2018-11-23 13:16:18,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:18" (1/1) ... [2018-11-23 13:16:18,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:16:18,953 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:16:19,204 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:16:19,209 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:16:19,227 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:16:19,243 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:16:19,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:19 WrapperNode [2018-11-23 13:16:19,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:16:19,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:16:19,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:16:19,245 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:16:19,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:19" (1/1) ... [2018-11-23 13:16:19,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:19" (1/1) ... [2018-11-23 13:16:19,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:16:19,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:16:19,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:16:19,269 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:16:19,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:19" (1/1) ... [2018-11-23 13:16:19,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:19" (1/1) ... [2018-11-23 13:16:19,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:19" (1/1) ... [2018-11-23 13:16:19,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:19" (1/1) ... [2018-11-23 13:16:19,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:19" (1/1) ... [2018-11-23 13:16:19,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:19" (1/1) ... [2018-11-23 13:16:19,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:19" (1/1) ... [2018-11-23 13:16:19,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:16:19,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:16:19,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:16:19,302 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:16:19,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:19" (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-23 13:16:19,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:16:19,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:16:19,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:16:19,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:16:19,423 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:16:19,423 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:16:19,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:16:19,424 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:16:19,881 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:16:19,881 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:16:19,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:19 BoogieIcfgContainer [2018-11-23 13:16:19,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:16:19,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:16:19,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:16:19,887 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:16:19,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:16:18" (1/3) ... [2018-11-23 13:16:19,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@899f4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:19, skipping insertion in model container [2018-11-23 13:16:19,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:19" (2/3) ... [2018-11-23 13:16:19,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@899f4fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:19, skipping insertion in model container [2018-11-23 13:16:19,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:19" (3/3) ... [2018-11-23 13:16:19,891 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono6_false-unreach-call1.c [2018-11-23 13:16:19,901 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:16:19,911 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:16:19,928 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:16:19,958 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:16:19,959 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:16:19,959 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:16:19,959 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:16:19,959 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:16:19,960 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:16:19,960 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:16:19,960 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:16:19,960 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:16:19,978 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 13:16:19,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:16:19,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:19,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:19,987 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:19,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:19,994 INFO L82 PathProgramCache]: Analyzing trace with hash -147882559, now seen corresponding path program 1 times [2018-11-23 13:16:19,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:19,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:20,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:20,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:20,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:20,128 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-23 13:16:20,131 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-23 13:16:20,132 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #39#return; {23#true} is VALID [2018-11-23 13:16:20,133 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2018-11-23 13:16:20,133 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {23#true} is VALID [2018-11-23 13:16:20,147 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-23 13:16:20,147 INFO L256 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {24#false} is VALID [2018-11-23 13:16:20,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-23 13:16:20,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2018-11-23 13:16:20,148 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-23 13:16:20,151 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-23 13:16:20,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:16:20,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:16:20,158 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:16:20,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:20,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:16:20,214 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-23 13:16:20,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:16:20,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:16:20,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:16:20,226 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 13:16:20,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:20,312 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 13:16:20,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:16:20,313 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:16:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:20,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:16:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 13:16:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:16:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2018-11-23 13:16:20,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2018-11-23 13:16:20,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:20,572 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:16:20,572 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:16:20,576 INFO L631 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-23 13:16:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:16:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:16:20,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:20,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:16:20,632 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:16:20,632 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:16:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:20,636 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 13:16:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:16:20,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:20,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:20,637 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:16:20,637 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:16:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:20,640 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 13:16:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:16:20,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:20,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:20,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:20,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:16:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 13:16:20,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 13:16:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:20,645 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 13:16:20,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:16:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:16:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:16:20,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:20,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:20,647 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:20,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:20,647 INFO L82 PathProgramCache]: Analyzing trace with hash -158041290, now seen corresponding path program 1 times [2018-11-23 13:16:20,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:20,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:20,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:20,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:21,025 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 10 [2018-11-23 13:16:21,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {114#true} call ULTIMATE.init(); {114#true} is VALID [2018-11-23 13:16:21,125 INFO L273 TraceCheckUtils]: 1: Hoare triple {114#true} assume true; {114#true} is VALID [2018-11-23 13:16:21,125 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {114#true} {114#true} #39#return; {114#true} is VALID [2018-11-23 13:16:21,126 INFO L256 TraceCheckUtils]: 3: Hoare triple {114#true} call #t~ret2 := main(); {114#true} is VALID [2018-11-23 13:16:21,127 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {116#(and (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)))} is VALID [2018-11-23 13:16:21,128 INFO L273 TraceCheckUtils]: 5: Hoare triple {116#(and (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {115#false} is VALID [2018-11-23 13:16:21,128 INFO L256 TraceCheckUtils]: 6: Hoare triple {115#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {117#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:16:21,133 INFO L273 TraceCheckUtils]: 7: Hoare triple {117#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {118#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:16:21,139 INFO L273 TraceCheckUtils]: 8: Hoare triple {118#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {115#false} is VALID [2018-11-23 13:16:21,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {115#false} assume !false; {115#false} is VALID [2018-11-23 13:16:21,140 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-23 13:16:21,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:16:21,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:16:21,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 13:16:21,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:21,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:16:21,174 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-23 13:16:21,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:16:21,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:16:21,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:16:21,175 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2018-11-23 13:16:21,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:21,456 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 13:16:21,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:16:21,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 13:16:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:16:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-11-23 13:16:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:16:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2018-11-23 13:16:21,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2018-11-23 13:16:21,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:21,612 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:16:21,612 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:16:21,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:16:21,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:16:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-11-23 13:16:21,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:21,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 14 states. [2018-11-23 13:16:21,629 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 14 states. [2018-11-23 13:16:21,630 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 14 states. [2018-11-23 13:16:21,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:21,632 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 13:16:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:16:21,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:21,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:21,633 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 16 states. [2018-11-23 13:16:21,633 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 16 states. [2018-11-23 13:16:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:21,634 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2018-11-23 13:16:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 13:16:21,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:21,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:21,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:21,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:16:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 13:16:21,637 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-23 13:16:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:21,638 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 13:16:21,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:16:21,638 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:16:21,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:16:21,639 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:21,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:21,639 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:21,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:21,640 INFO L82 PathProgramCache]: Analyzing trace with hash 743821333, now seen corresponding path program 1 times [2018-11-23 13:16:21,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:21,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:21,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:21,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:21,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:22,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {206#true} call ULTIMATE.init(); {206#true} is VALID [2018-11-23 13:16:22,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {206#true} assume true; {206#true} is VALID [2018-11-23 13:16:22,085 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} #39#return; {206#true} is VALID [2018-11-23 13:16:22,085 INFO L256 TraceCheckUtils]: 3: Hoare triple {206#true} call #t~ret2 := main(); {206#true} is VALID [2018-11-23 13:16:22,087 INFO L273 TraceCheckUtils]: 4: Hoare triple {206#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {208#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:22,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {208#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {208#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:22,100 INFO L273 TraceCheckUtils]: 6: Hoare triple {208#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {207#false} is VALID [2018-11-23 13:16:22,101 INFO L273 TraceCheckUtils]: 7: Hoare triple {207#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {207#false} is VALID [2018-11-23 13:16:22,101 INFO L273 TraceCheckUtils]: 8: Hoare triple {207#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {207#false} is VALID [2018-11-23 13:16:22,101 INFO L256 TraceCheckUtils]: 9: Hoare triple {207#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {207#false} is VALID [2018-11-23 13:16:22,101 INFO L273 TraceCheckUtils]: 10: Hoare triple {207#false} ~cond := #in~cond; {207#false} is VALID [2018-11-23 13:16:22,102 INFO L273 TraceCheckUtils]: 11: Hoare triple {207#false} assume 0 == ~cond; {207#false} is VALID [2018-11-23 13:16:22,102 INFO L273 TraceCheckUtils]: 12: Hoare triple {207#false} assume !false; {207#false} is VALID [2018-11-23 13:16:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:22,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:16:22,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:16:22,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 13:16:22,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:22,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:16:22,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:22,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:16:22,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:16:22,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:16:22,152 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2018-11-23 13:16:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:22,300 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 13:16:22,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:16:22,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 13:16:22,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:16:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-11-23 13:16:22,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:16:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2018-11-23 13:16:22,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 27 transitions. [2018-11-23 13:16:22,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:22,339 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:16:22,340 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:16:22,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:16:22,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:16:22,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 13:16:22,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:22,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-23 13:16:22,360 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-23 13:16:22,361 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-23 13:16:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:22,364 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 13:16:22,364 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:16:22,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:22,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:22,365 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-23 13:16:22,365 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-23 13:16:22,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:22,367 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 13:16:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:16:22,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:22,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:22,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:22,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:16:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 13:16:22,370 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-11-23 13:16:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:22,370 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 13:16:22,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:16:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 13:16:22,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:16:22,371 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:22,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:22,371 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:22,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:22,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1776138601, now seen corresponding path program 1 times [2018-11-23 13:16:22,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:22,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:22,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:22,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:22,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:22,682 INFO L256 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {301#true} is VALID [2018-11-23 13:16:22,682 INFO L273 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2018-11-23 13:16:22,683 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #39#return; {301#true} is VALID [2018-11-23 13:16:22,683 INFO L256 TraceCheckUtils]: 3: Hoare triple {301#true} call #t~ret2 := main(); {301#true} is VALID [2018-11-23 13:16:22,684 INFO L273 TraceCheckUtils]: 4: Hoare triple {301#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {303#(and (or (<= main_~y~0 (+ main_~x~0 10000000)) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296))) (or (<= (+ main_~x~0 10000000) main_~y~0) (< (div main_~x~0 4294967296) (div main_~y~0 4294967296))))} is VALID [2018-11-23 13:16:22,685 INFO L273 TraceCheckUtils]: 5: Hoare triple {303#(and (or (<= main_~y~0 (+ main_~x~0 10000000)) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296))) (or (<= (+ main_~x~0 10000000) main_~y~0) (< (div main_~x~0 4294967296) (div main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {304#(and (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)))} is VALID [2018-11-23 13:16:22,694 INFO L273 TraceCheckUtils]: 6: Hoare triple {304#(and (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {304#(and (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)))} is VALID [2018-11-23 13:16:22,695 INFO L273 TraceCheckUtils]: 7: Hoare triple {304#(and (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {305#(and (<= (+ main_~x~0 9999999) main_~y~0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)))} is VALID [2018-11-23 13:16:22,696 INFO L273 TraceCheckUtils]: 8: Hoare triple {305#(and (<= (+ main_~x~0 9999999) main_~y~0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {302#false} is VALID [2018-11-23 13:16:22,697 INFO L256 TraceCheckUtils]: 9: Hoare triple {302#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {302#false} is VALID [2018-11-23 13:16:22,697 INFO L273 TraceCheckUtils]: 10: Hoare triple {302#false} ~cond := #in~cond; {302#false} is VALID [2018-11-23 13:16:22,697 INFO L273 TraceCheckUtils]: 11: Hoare triple {302#false} assume 0 == ~cond; {302#false} is VALID [2018-11-23 13:16:22,698 INFO L273 TraceCheckUtils]: 12: Hoare triple {302#false} assume !false; {302#false} is VALID [2018-11-23 13:16:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:22,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:22,700 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-23 13:16:22,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:22,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:22,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {301#true} is VALID [2018-11-23 13:16:22,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2018-11-23 13:16:22,861 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #39#return; {301#true} is VALID [2018-11-23 13:16:22,861 INFO L256 TraceCheckUtils]: 3: Hoare triple {301#true} call #t~ret2 := main(); {301#true} is VALID [2018-11-23 13:16:22,863 INFO L273 TraceCheckUtils]: 4: Hoare triple {301#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {321#(and (= 10000000 main_~y~0) (= main_~x~0 0))} is VALID [2018-11-23 13:16:22,870 INFO L273 TraceCheckUtils]: 5: Hoare triple {321#(and (= 10000000 main_~y~0) (= main_~x~0 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {321#(and (= 10000000 main_~y~0) (= main_~x~0 0))} is VALID [2018-11-23 13:16:22,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {321#(and (= 10000000 main_~y~0) (= main_~x~0 0))} assume !(~x~0 % 4294967296 >= 5000000); {321#(and (= 10000000 main_~y~0) (= main_~x~0 0))} is VALID [2018-11-23 13:16:22,871 INFO L273 TraceCheckUtils]: 7: Hoare triple {321#(and (= 10000000 main_~y~0) (= main_~x~0 0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {331#(and (= 10000000 main_~y~0) (= main_~x~0 1))} is VALID [2018-11-23 13:16:22,875 INFO L273 TraceCheckUtils]: 8: Hoare triple {331#(and (= 10000000 main_~y~0) (= main_~x~0 1))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {302#false} is VALID [2018-11-23 13:16:22,875 INFO L256 TraceCheckUtils]: 9: Hoare triple {302#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {302#false} is VALID [2018-11-23 13:16:22,875 INFO L273 TraceCheckUtils]: 10: Hoare triple {302#false} ~cond := #in~cond; {302#false} is VALID [2018-11-23 13:16:22,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {302#false} assume 0 == ~cond; {302#false} is VALID [2018-11-23 13:16:22,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {302#false} assume !false; {302#false} is VALID [2018-11-23 13:16:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:22,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:22,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-23 13:16:22,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 13:16:22,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:22,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:16:22,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:22,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:16:22,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:16:22,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:16:22,929 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2018-11-23 13:16:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:23,258 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 13:16:23,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:16:23,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 13:16:23,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:16:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-23 13:16:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:16:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2018-11-23 13:16:23,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2018-11-23 13:16:23,316 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-23 13:16:23,318 INFO L225 Difference]: With dead ends: 27 [2018-11-23 13:16:23,318 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 13:16:23,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:16:23,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 13:16:23,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-23 13:16:23,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:23,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 18 states. [2018-11-23 13:16:23,338 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 18 states. [2018-11-23 13:16:23,338 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 18 states. [2018-11-23 13:16:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:23,341 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 13:16:23,341 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 13:16:23,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:23,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:23,342 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 19 states. [2018-11-23 13:16:23,342 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 19 states. [2018-11-23 13:16:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:23,344 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 13:16:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 13:16:23,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:23,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:23,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:23,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:16:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 13:16:23,346 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 13:16:23,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:23,347 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 13:16:23,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:16:23,347 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 13:16:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:16:23,348 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:23,348 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:23,348 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:23,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:23,349 INFO L82 PathProgramCache]: Analyzing trace with hash 199799702, now seen corresponding path program 2 times [2018-11-23 13:16:23,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:23,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:23,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:23,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:23,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:23,813 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-23 13:16:24,249 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-11-23 13:16:24,415 INFO L256 TraceCheckUtils]: 0: Hoare triple {450#true} call ULTIMATE.init(); {450#true} is VALID [2018-11-23 13:16:24,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-23 13:16:24,416 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {450#true} {450#true} #39#return; {450#true} is VALID [2018-11-23 13:16:24,416 INFO L256 TraceCheckUtils]: 3: Hoare triple {450#true} call #t~ret2 := main(); {450#true} is VALID [2018-11-23 13:16:24,418 INFO L273 TraceCheckUtils]: 4: Hoare triple {450#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {452#(and (or (<= main_~y~0 (+ main_~x~0 10000000)) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296))) (or (<= (+ main_~x~0 10000000) main_~y~0) (< (div main_~x~0 4294967296) (div main_~y~0 4294967296))))} is VALID [2018-11-23 13:16:24,419 INFO L273 TraceCheckUtils]: 5: Hoare triple {452#(and (or (<= main_~y~0 (+ main_~x~0 10000000)) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296))) (or (<= (+ main_~x~0 10000000) main_~y~0) (< (div main_~x~0 4294967296) (div main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {453#(and (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)))} is VALID [2018-11-23 13:16:24,421 INFO L273 TraceCheckUtils]: 6: Hoare triple {453#(and (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {453#(and (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)))} is VALID [2018-11-23 13:16:24,422 INFO L273 TraceCheckUtils]: 7: Hoare triple {453#(and (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {454#(and (<= (+ (* 4294967296 (div main_~y~0 4294967296)) 1) main_~x~0) (<= (+ main_~x~0 9999999) main_~y~0))} is VALID [2018-11-23 13:16:24,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {454#(and (<= (+ (* 4294967296 (div main_~y~0 4294967296)) 1) main_~x~0) (<= (+ main_~x~0 9999999) main_~y~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {454#(and (<= (+ (* 4294967296 (div main_~y~0 4294967296)) 1) main_~x~0) (<= (+ main_~x~0 9999999) main_~y~0))} is VALID [2018-11-23 13:16:24,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {454#(and (<= (+ (* 4294967296 (div main_~y~0 4294967296)) 1) main_~x~0) (<= (+ main_~x~0 9999999) main_~y~0))} assume !(~x~0 % 4294967296 >= 5000000); {454#(and (<= (+ (* 4294967296 (div main_~y~0 4294967296)) 1) main_~x~0) (<= (+ main_~x~0 9999999) main_~y~0))} is VALID [2018-11-23 13:16:24,427 INFO L273 TraceCheckUtils]: 10: Hoare triple {454#(and (<= (+ (* 4294967296 (div main_~y~0 4294967296)) 1) main_~x~0) (<= (+ main_~x~0 9999999) main_~y~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {455#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)))} is VALID [2018-11-23 13:16:24,428 INFO L273 TraceCheckUtils]: 11: Hoare triple {455#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {451#false} is VALID [2018-11-23 13:16:24,429 INFO L256 TraceCheckUtils]: 12: Hoare triple {451#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {451#false} is VALID [2018-11-23 13:16:24,429 INFO L273 TraceCheckUtils]: 13: Hoare triple {451#false} ~cond := #in~cond; {451#false} is VALID [2018-11-23 13:16:24,430 INFO L273 TraceCheckUtils]: 14: Hoare triple {451#false} assume 0 == ~cond; {451#false} is VALID [2018-11-23 13:16:24,430 INFO L273 TraceCheckUtils]: 15: Hoare triple {451#false} assume !false; {451#false} is VALID [2018-11-23 13:16:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:24,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:24,432 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-23 13:16:24,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:16:24,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 13:16:24,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:24,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:24,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {450#true} call ULTIMATE.init(); {450#true} is VALID [2018-11-23 13:16:24,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-23 13:16:24,619 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {450#true} {450#true} #39#return; {450#true} is VALID [2018-11-23 13:16:24,619 INFO L256 TraceCheckUtils]: 3: Hoare triple {450#true} call #t~ret2 := main(); {450#true} is VALID [2018-11-23 13:16:24,620 INFO L273 TraceCheckUtils]: 4: Hoare triple {450#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {471#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:24,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {471#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {471#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:24,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {471#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {471#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:24,622 INFO L273 TraceCheckUtils]: 7: Hoare triple {471#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {471#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:24,623 INFO L273 TraceCheckUtils]: 8: Hoare triple {471#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {471#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:24,623 INFO L273 TraceCheckUtils]: 9: Hoare triple {471#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {471#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:24,624 INFO L273 TraceCheckUtils]: 10: Hoare triple {471#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {471#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:24,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {471#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {493#(and (<= 10000000 (mod main_~x~0 4294967296)) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:24,626 INFO L256 TraceCheckUtils]: 12: Hoare triple {493#(and (<= 10000000 (mod main_~x~0 4294967296)) (= main_~z~0 5000000))} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {497#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:16:24,627 INFO L273 TraceCheckUtils]: 13: Hoare triple {497#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {501#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:16:24,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {501#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {451#false} is VALID [2018-11-23 13:16:24,629 INFO L273 TraceCheckUtils]: 15: Hoare triple {451#false} assume !false; {451#false} is VALID [2018-11-23 13:16:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:16:24,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:16:24,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-23 13:16:24,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 13:16:24,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:24,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:16:24,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:24,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:16:24,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:16:24,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:16:24,771 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 10 states. [2018-11-23 13:16:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:25,286 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-11-23 13:16:25,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:16:25,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 13:16:25,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:16:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2018-11-23 13:16:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:16:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2018-11-23 13:16:25,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2018-11-23 13:16:25,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:25,433 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:16:25,433 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:16:25,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:16:25,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:16:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 13:16:25,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:25,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 24 states. [2018-11-23 13:16:25,640 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 24 states. [2018-11-23 13:16:25,640 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 24 states. [2018-11-23 13:16:25,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:25,642 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 13:16:25,643 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 13:16:25,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:25,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:25,643 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states. [2018-11-23 13:16:25,644 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states. [2018-11-23 13:16:25,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:25,646 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 13:16:25,646 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 13:16:25,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:25,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:25,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:25,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:16:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 13:16:25,651 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2018-11-23 13:16:25,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:25,651 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 13:16:25,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:16:25,651 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 13:16:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:16:25,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:25,652 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:25,655 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:25,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:25,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1682133644, now seen corresponding path program 1 times [2018-11-23 13:16:25,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:25,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:25,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:25,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:25,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:25,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {654#true} call ULTIMATE.init(); {654#true} is VALID [2018-11-23 13:16:25,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {654#true} assume true; {654#true} is VALID [2018-11-23 13:16:25,897 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {654#true} {654#true} #39#return; {654#true} is VALID [2018-11-23 13:16:25,898 INFO L256 TraceCheckUtils]: 3: Hoare triple {654#true} call #t~ret2 := main(); {654#true} is VALID [2018-11-23 13:16:25,899 INFO L273 TraceCheckUtils]: 4: Hoare triple {654#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {656#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:25,900 INFO L273 TraceCheckUtils]: 5: Hoare triple {656#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {656#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:25,901 INFO L273 TraceCheckUtils]: 6: Hoare triple {656#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {656#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:25,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {656#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {657#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:25,902 INFO L273 TraceCheckUtils]: 8: Hoare triple {657#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {657#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:25,903 INFO L273 TraceCheckUtils]: 9: Hoare triple {657#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {657#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:25,904 INFO L273 TraceCheckUtils]: 10: Hoare triple {657#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:25,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:25,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:25,908 INFO L273 TraceCheckUtils]: 13: Hoare triple {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {659#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:25,915 INFO L273 TraceCheckUtils]: 14: Hoare triple {659#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {659#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:25,917 INFO L273 TraceCheckUtils]: 15: Hoare triple {659#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {655#false} is VALID [2018-11-23 13:16:25,917 INFO L273 TraceCheckUtils]: 16: Hoare triple {655#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {655#false} is VALID [2018-11-23 13:16:25,917 INFO L273 TraceCheckUtils]: 17: Hoare triple {655#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {655#false} is VALID [2018-11-23 13:16:25,917 INFO L256 TraceCheckUtils]: 18: Hoare triple {655#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {655#false} is VALID [2018-11-23 13:16:25,918 INFO L273 TraceCheckUtils]: 19: Hoare triple {655#false} ~cond := #in~cond; {655#false} is VALID [2018-11-23 13:16:25,918 INFO L273 TraceCheckUtils]: 20: Hoare triple {655#false} assume 0 == ~cond; {655#false} is VALID [2018-11-23 13:16:25,918 INFO L273 TraceCheckUtils]: 21: Hoare triple {655#false} assume !false; {655#false} is VALID [2018-11-23 13:16:25,920 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:25,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:25,920 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-23 13:16:25,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:25,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:26,125 INFO L256 TraceCheckUtils]: 0: Hoare triple {654#true} call ULTIMATE.init(); {654#true} is VALID [2018-11-23 13:16:26,126 INFO L273 TraceCheckUtils]: 1: Hoare triple {654#true} assume true; {654#true} is VALID [2018-11-23 13:16:26,126 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {654#true} {654#true} #39#return; {654#true} is VALID [2018-11-23 13:16:26,127 INFO L256 TraceCheckUtils]: 3: Hoare triple {654#true} call #t~ret2 := main(); {654#true} is VALID [2018-11-23 13:16:26,140 INFO L273 TraceCheckUtils]: 4: Hoare triple {654#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {656#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:26,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {656#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {656#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:26,167 INFO L273 TraceCheckUtils]: 6: Hoare triple {656#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {656#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:26,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {656#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {657#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:26,189 INFO L273 TraceCheckUtils]: 8: Hoare triple {657#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {657#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:26,202 INFO L273 TraceCheckUtils]: 9: Hoare triple {657#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {657#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:26,208 INFO L273 TraceCheckUtils]: 10: Hoare triple {657#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:26,210 INFO L273 TraceCheckUtils]: 11: Hoare triple {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:26,210 INFO L273 TraceCheckUtils]: 12: Hoare triple {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:26,212 INFO L273 TraceCheckUtils]: 13: Hoare triple {658#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {702#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:26,214 INFO L273 TraceCheckUtils]: 14: Hoare triple {702#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {702#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:26,218 INFO L273 TraceCheckUtils]: 15: Hoare triple {702#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {655#false} is VALID [2018-11-23 13:16:26,218 INFO L273 TraceCheckUtils]: 16: Hoare triple {655#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {655#false} is VALID [2018-11-23 13:16:26,218 INFO L273 TraceCheckUtils]: 17: Hoare triple {655#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {655#false} is VALID [2018-11-23 13:16:26,218 INFO L256 TraceCheckUtils]: 18: Hoare triple {655#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {655#false} is VALID [2018-11-23 13:16:26,219 INFO L273 TraceCheckUtils]: 19: Hoare triple {655#false} ~cond := #in~cond; {655#false} is VALID [2018-11-23 13:16:26,219 INFO L273 TraceCheckUtils]: 20: Hoare triple {655#false} assume 0 == ~cond; {655#false} is VALID [2018-11-23 13:16:26,219 INFO L273 TraceCheckUtils]: 21: Hoare triple {655#false} assume !false; {655#false} is VALID [2018-11-23 13:16:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:26,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:26,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:16:26,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 13:16:26,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:26,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:16:26,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:26,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:16:26,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:16:26,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:16:26,276 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2018-11-23 13:16:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:26,548 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-23 13:16:26,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:16:26,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 13:16:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:26,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:16:26,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2018-11-23 13:16:26,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:16:26,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2018-11-23 13:16:26,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2018-11-23 13:16:26,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:26,617 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:16:26,617 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:16:26,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:16:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:16:26,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 13:16:26,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:26,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 13:16:26,660 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 13:16:26,660 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 13:16:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:26,662 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-23 13:16:26,662 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 13:16:26,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:26,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:26,663 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 13:16:26,663 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 13:16:26,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:26,665 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-23 13:16:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 13:16:26,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:26,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:26,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:26,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:16:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 13:16:26,668 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 22 [2018-11-23 13:16:26,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:26,669 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 13:16:26,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:16:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 13:16:26,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:16:26,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:26,670 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:26,670 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:26,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:26,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1785237675, now seen corresponding path program 2 times [2018-11-23 13:16:26,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:26,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:26,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:26,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:26,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:27,292 INFO L256 TraceCheckUtils]: 0: Hoare triple {872#true} call ULTIMATE.init(); {872#true} is VALID [2018-11-23 13:16:27,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {872#true} assume true; {872#true} is VALID [2018-11-23 13:16:27,293 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {872#true} {872#true} #39#return; {872#true} is VALID [2018-11-23 13:16:27,294 INFO L256 TraceCheckUtils]: 3: Hoare triple {872#true} call #t~ret2 := main(); {872#true} is VALID [2018-11-23 13:16:27,294 INFO L273 TraceCheckUtils]: 4: Hoare triple {872#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:27,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:27,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:27,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:27,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:27,297 INFO L273 TraceCheckUtils]: 9: Hoare triple {875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:27,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:27,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:27,300 INFO L273 TraceCheckUtils]: 12: Hoare triple {876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:27,321 INFO L273 TraceCheckUtils]: 13: Hoare triple {876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:27,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:27,340 INFO L273 TraceCheckUtils]: 15: Hoare triple {877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:27,342 INFO L273 TraceCheckUtils]: 16: Hoare triple {877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {878#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:27,342 INFO L273 TraceCheckUtils]: 17: Hoare triple {878#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {878#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:27,343 INFO L273 TraceCheckUtils]: 18: Hoare triple {878#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {873#false} is VALID [2018-11-23 13:16:27,343 INFO L273 TraceCheckUtils]: 19: Hoare triple {873#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {873#false} is VALID [2018-11-23 13:16:27,344 INFO L273 TraceCheckUtils]: 20: Hoare triple {873#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {873#false} is VALID [2018-11-23 13:16:27,344 INFO L256 TraceCheckUtils]: 21: Hoare triple {873#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {873#false} is VALID [2018-11-23 13:16:27,344 INFO L273 TraceCheckUtils]: 22: Hoare triple {873#false} ~cond := #in~cond; {873#false} is VALID [2018-11-23 13:16:27,344 INFO L273 TraceCheckUtils]: 23: Hoare triple {873#false} assume 0 == ~cond; {873#false} is VALID [2018-11-23 13:16:27,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {873#false} assume !false; {873#false} is VALID [2018-11-23 13:16:27,347 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:27,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:27,348 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-23 13:16:27,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:16:27,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:16:27,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:27,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:27,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {872#true} call ULTIMATE.init(); {872#true} is VALID [2018-11-23 13:16:27,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {872#true} assume true; {872#true} is VALID [2018-11-23 13:16:27,554 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {872#true} {872#true} #39#return; {872#true} is VALID [2018-11-23 13:16:27,554 INFO L256 TraceCheckUtils]: 3: Hoare triple {872#true} call #t~ret2 := main(); {872#true} is VALID [2018-11-23 13:16:27,555 INFO L273 TraceCheckUtils]: 4: Hoare triple {872#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:27,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:27,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:27,557 INFO L273 TraceCheckUtils]: 7: Hoare triple {874#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:27,557 INFO L273 TraceCheckUtils]: 8: Hoare triple {875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:27,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:27,559 INFO L273 TraceCheckUtils]: 10: Hoare triple {875#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:27,559 INFO L273 TraceCheckUtils]: 11: Hoare triple {876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:27,560 INFO L273 TraceCheckUtils]: 12: Hoare triple {876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:27,560 INFO L273 TraceCheckUtils]: 13: Hoare triple {876#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:27,561 INFO L273 TraceCheckUtils]: 14: Hoare triple {877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:27,562 INFO L273 TraceCheckUtils]: 15: Hoare triple {877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:27,563 INFO L273 TraceCheckUtils]: 16: Hoare triple {877#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {930#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:27,564 INFO L273 TraceCheckUtils]: 17: Hoare triple {930#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {930#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:27,565 INFO L273 TraceCheckUtils]: 18: Hoare triple {930#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {873#false} is VALID [2018-11-23 13:16:27,566 INFO L273 TraceCheckUtils]: 19: Hoare triple {873#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {873#false} is VALID [2018-11-23 13:16:27,566 INFO L273 TraceCheckUtils]: 20: Hoare triple {873#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {873#false} is VALID [2018-11-23 13:16:27,567 INFO L256 TraceCheckUtils]: 21: Hoare triple {873#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {873#false} is VALID [2018-11-23 13:16:27,567 INFO L273 TraceCheckUtils]: 22: Hoare triple {873#false} ~cond := #in~cond; {873#false} is VALID [2018-11-23 13:16:27,567 INFO L273 TraceCheckUtils]: 23: Hoare triple {873#false} assume 0 == ~cond; {873#false} is VALID [2018-11-23 13:16:27,568 INFO L273 TraceCheckUtils]: 24: Hoare triple {873#false} assume !false; {873#false} is VALID [2018-11-23 13:16:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:27,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:27,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:16:27,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 13:16:27,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:27,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:16:27,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:27,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:16:27,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:16:27,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:16:27,623 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 8 states. [2018-11-23 13:16:28,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:28,140 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-23 13:16:28,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:16:28,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 13:16:28,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:28,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:16:28,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 13:16:28,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:16:28,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 13:16:28,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2018-11-23 13:16:28,189 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-23 13:16:28,191 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:16:28,191 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:16:28,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:16:28,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:16:28,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 13:16:28,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:28,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 13:16:28,239 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 13:16:28,239 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 13:16:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:28,241 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 13:16:28,241 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 13:16:28,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:28,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:28,242 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 13:16:28,242 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 13:16:28,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:28,243 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 13:16:28,244 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 13:16:28,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:28,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:28,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:28,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:16:28,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-23 13:16:28,246 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2018-11-23 13:16:28,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:28,247 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-23 13:16:28,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:16:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 13:16:28,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:16:28,248 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:28,248 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:28,248 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:28,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:28,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1839158740, now seen corresponding path program 3 times [2018-11-23 13:16:28,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:28,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:28,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:28,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:28,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:28,591 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 13:16:28,591 INFO L273 TraceCheckUtils]: 1: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 13:16:28,592 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1114#true} {1114#true} #39#return; {1114#true} is VALID [2018-11-23 13:16:28,592 INFO L256 TraceCheckUtils]: 3: Hoare triple {1114#true} call #t~ret2 := main(); {1114#true} is VALID [2018-11-23 13:16:28,594 INFO L273 TraceCheckUtils]: 4: Hoare triple {1114#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1116#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:28,595 INFO L273 TraceCheckUtils]: 5: Hoare triple {1116#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1116#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:28,595 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1116#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:28,596 INFO L273 TraceCheckUtils]: 7: Hoare triple {1116#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1117#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:28,597 INFO L273 TraceCheckUtils]: 8: Hoare triple {1117#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1117#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:28,598 INFO L273 TraceCheckUtils]: 9: Hoare triple {1117#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1117#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:28,598 INFO L273 TraceCheckUtils]: 10: Hoare triple {1117#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1118#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:28,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {1118#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1118#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:28,600 INFO L273 TraceCheckUtils]: 12: Hoare triple {1118#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1118#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:28,601 INFO L273 TraceCheckUtils]: 13: Hoare triple {1118#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1119#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:28,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {1119#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1119#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:28,604 INFO L273 TraceCheckUtils]: 15: Hoare triple {1119#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1119#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:28,605 INFO L273 TraceCheckUtils]: 16: Hoare triple {1119#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1120#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:28,606 INFO L273 TraceCheckUtils]: 17: Hoare triple {1120#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1120#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:28,614 INFO L273 TraceCheckUtils]: 18: Hoare triple {1120#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {1120#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:28,615 INFO L273 TraceCheckUtils]: 19: Hoare triple {1120#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1121#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:28,616 INFO L273 TraceCheckUtils]: 20: Hoare triple {1121#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1121#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:28,617 INFO L273 TraceCheckUtils]: 21: Hoare triple {1121#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {1115#false} is VALID [2018-11-23 13:16:28,617 INFO L273 TraceCheckUtils]: 22: Hoare triple {1115#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1115#false} is VALID [2018-11-23 13:16:28,617 INFO L273 TraceCheckUtils]: 23: Hoare triple {1115#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1115#false} is VALID [2018-11-23 13:16:28,617 INFO L256 TraceCheckUtils]: 24: Hoare triple {1115#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {1115#false} is VALID [2018-11-23 13:16:28,617 INFO L273 TraceCheckUtils]: 25: Hoare triple {1115#false} ~cond := #in~cond; {1115#false} is VALID [2018-11-23 13:16:28,618 INFO L273 TraceCheckUtils]: 26: Hoare triple {1115#false} assume 0 == ~cond; {1115#false} is VALID [2018-11-23 13:16:28,618 INFO L273 TraceCheckUtils]: 27: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 13:16:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:28,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:28,621 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-23 13:16:28,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:16:28,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 13:16:28,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:28,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:28,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {1114#true} call ULTIMATE.init(); {1114#true} is VALID [2018-11-23 13:16:28,957 INFO L273 TraceCheckUtils]: 1: Hoare triple {1114#true} assume true; {1114#true} is VALID [2018-11-23 13:16:28,957 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1114#true} {1114#true} #39#return; {1114#true} is VALID [2018-11-23 13:16:28,958 INFO L256 TraceCheckUtils]: 3: Hoare triple {1114#true} call #t~ret2 := main(); {1114#true} is VALID [2018-11-23 13:16:28,959 INFO L273 TraceCheckUtils]: 4: Hoare triple {1114#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,959 INFO L273 TraceCheckUtils]: 5: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,961 INFO L273 TraceCheckUtils]: 8: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,962 INFO L273 TraceCheckUtils]: 9: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,963 INFO L273 TraceCheckUtils]: 10: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,964 INFO L273 TraceCheckUtils]: 11: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,964 INFO L273 TraceCheckUtils]: 12: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,965 INFO L273 TraceCheckUtils]: 13: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,966 INFO L273 TraceCheckUtils]: 14: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,968 INFO L273 TraceCheckUtils]: 16: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,969 INFO L273 TraceCheckUtils]: 17: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,970 INFO L273 TraceCheckUtils]: 18: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,971 INFO L273 TraceCheckUtils]: 19: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,972 INFO L273 TraceCheckUtils]: 20: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:16:28,973 INFO L273 TraceCheckUtils]: 21: Hoare triple {1137#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {1189#(and (= main_~z~0 5000001) (= 10000000 main_~y~0))} is VALID [2018-11-23 13:16:28,974 INFO L273 TraceCheckUtils]: 22: Hoare triple {1189#(and (= main_~z~0 5000001) (= 10000000 main_~y~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1189#(and (= main_~z~0 5000001) (= 10000000 main_~y~0))} is VALID [2018-11-23 13:16:28,975 INFO L273 TraceCheckUtils]: 23: Hoare triple {1189#(and (= main_~z~0 5000001) (= 10000000 main_~y~0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1196#(and (<= 10000000 (mod main_~x~0 4294967296)) (= main_~z~0 5000001))} is VALID [2018-11-23 13:16:28,977 INFO L256 TraceCheckUtils]: 24: Hoare triple {1196#(and (<= 10000000 (mod main_~x~0 4294967296)) (= main_~z~0 5000001))} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {1200#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:16:28,978 INFO L273 TraceCheckUtils]: 25: Hoare triple {1200#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1204#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:16:28,978 INFO L273 TraceCheckUtils]: 26: Hoare triple {1204#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1115#false} is VALID [2018-11-23 13:16:28,979 INFO L273 TraceCheckUtils]: 27: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2018-11-23 13:16:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 13:16:29,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:29,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 13:16:29,003 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-11-23 13:16:29,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:29,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:16:29,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:29,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:16:29,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:16:29,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:16:29,047 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 13 states. [2018-11-23 13:16:29,567 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-23 13:16:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:30,358 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 13:16:30,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:16:30,358 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-11-23 13:16:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:16:30,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2018-11-23 13:16:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:16:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2018-11-23 13:16:30,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 54 transitions. [2018-11-23 13:16:30,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:30,419 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:16:30,419 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 13:16:30,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:16:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 13:16:30,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-23 13:16:30,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:30,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2018-11-23 13:16:30,461 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2018-11-23 13:16:30,461 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2018-11-23 13:16:30,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:30,463 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-23 13:16:30,463 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 13:16:30,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:30,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:30,464 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2018-11-23 13:16:30,464 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2018-11-23 13:16:30,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:30,466 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-23 13:16:30,466 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 13:16:30,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:30,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:30,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:30,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:16:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-11-23 13:16:30,469 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 28 [2018-11-23 13:16:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:30,469 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-23 13:16:30,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:16:30,469 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-23 13:16:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:16:30,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:30,470 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:30,470 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:30,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:30,471 INFO L82 PathProgramCache]: Analyzing trace with hash -760785930, now seen corresponding path program 4 times [2018-11-23 13:16:30,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:30,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:30,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:30,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:30,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:30,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {1419#true} call ULTIMATE.init(); {1419#true} is VALID [2018-11-23 13:16:30,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {1419#true} assume true; {1419#true} is VALID [2018-11-23 13:16:30,795 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1419#true} {1419#true} #39#return; {1419#true} is VALID [2018-11-23 13:16:30,796 INFO L256 TraceCheckUtils]: 3: Hoare triple {1419#true} call #t~ret2 := main(); {1419#true} is VALID [2018-11-23 13:16:30,797 INFO L273 TraceCheckUtils]: 4: Hoare triple {1419#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1421#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:30,797 INFO L273 TraceCheckUtils]: 5: Hoare triple {1421#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1421#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:30,798 INFO L273 TraceCheckUtils]: 6: Hoare triple {1421#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1421#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:30,799 INFO L273 TraceCheckUtils]: 7: Hoare triple {1421#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1422#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:30,802 INFO L273 TraceCheckUtils]: 8: Hoare triple {1422#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1422#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:30,803 INFO L273 TraceCheckUtils]: 9: Hoare triple {1422#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1422#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:30,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {1422#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:30,804 INFO L273 TraceCheckUtils]: 11: Hoare triple {1423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:30,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {1423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:30,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {1423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1424#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:30,812 INFO L273 TraceCheckUtils]: 14: Hoare triple {1424#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1424#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:30,813 INFO L273 TraceCheckUtils]: 15: Hoare triple {1424#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1424#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:30,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {1424#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1425#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:30,814 INFO L273 TraceCheckUtils]: 17: Hoare triple {1425#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1425#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:30,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {1425#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {1425#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:30,815 INFO L273 TraceCheckUtils]: 19: Hoare triple {1425#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1426#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:30,816 INFO L273 TraceCheckUtils]: 20: Hoare triple {1426#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1426#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:30,816 INFO L273 TraceCheckUtils]: 21: Hoare triple {1426#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {1426#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:30,817 INFO L273 TraceCheckUtils]: 22: Hoare triple {1426#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1427#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:30,817 INFO L273 TraceCheckUtils]: 23: Hoare triple {1427#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1427#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:30,818 INFO L273 TraceCheckUtils]: 24: Hoare triple {1427#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {1427#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:30,819 INFO L273 TraceCheckUtils]: 25: Hoare triple {1427#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1428#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:30,820 INFO L273 TraceCheckUtils]: 26: Hoare triple {1428#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1428#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:30,821 INFO L273 TraceCheckUtils]: 27: Hoare triple {1428#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {1420#false} is VALID [2018-11-23 13:16:30,821 INFO L273 TraceCheckUtils]: 28: Hoare triple {1420#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1420#false} is VALID [2018-11-23 13:16:30,822 INFO L273 TraceCheckUtils]: 29: Hoare triple {1420#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1420#false} is VALID [2018-11-23 13:16:30,822 INFO L256 TraceCheckUtils]: 30: Hoare triple {1420#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {1420#false} is VALID [2018-11-23 13:16:30,822 INFO L273 TraceCheckUtils]: 31: Hoare triple {1420#false} ~cond := #in~cond; {1420#false} is VALID [2018-11-23 13:16:30,822 INFO L273 TraceCheckUtils]: 32: Hoare triple {1420#false} assume 0 == ~cond; {1420#false} is VALID [2018-11-23 13:16:30,823 INFO L273 TraceCheckUtils]: 33: Hoare triple {1420#false} assume !false; {1420#false} is VALID [2018-11-23 13:16:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:30,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:30,826 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-23 13:16:30,843 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:16:30,869 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:16:30,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:30,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:30,968 INFO L256 TraceCheckUtils]: 0: Hoare triple {1419#true} call ULTIMATE.init(); {1419#true} is VALID [2018-11-23 13:16:30,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {1419#true} assume true; {1419#true} is VALID [2018-11-23 13:16:30,969 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1419#true} {1419#true} #39#return; {1419#true} is VALID [2018-11-23 13:16:30,969 INFO L256 TraceCheckUtils]: 3: Hoare triple {1419#true} call #t~ret2 := main(); {1419#true} is VALID [2018-11-23 13:16:30,970 INFO L273 TraceCheckUtils]: 4: Hoare triple {1419#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1421#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:30,970 INFO L273 TraceCheckUtils]: 5: Hoare triple {1421#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1421#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:30,971 INFO L273 TraceCheckUtils]: 6: Hoare triple {1421#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1421#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:30,971 INFO L273 TraceCheckUtils]: 7: Hoare triple {1421#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1422#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:30,972 INFO L273 TraceCheckUtils]: 8: Hoare triple {1422#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1422#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:30,973 INFO L273 TraceCheckUtils]: 9: Hoare triple {1422#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1422#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:30,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {1422#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:30,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {1423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:30,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {1423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:30,976 INFO L273 TraceCheckUtils]: 13: Hoare triple {1423#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1424#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:30,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {1424#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1424#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:30,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {1424#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1424#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:30,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {1424#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1425#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:30,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {1425#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1425#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:30,980 INFO L273 TraceCheckUtils]: 18: Hoare triple {1425#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {1425#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:30,981 INFO L273 TraceCheckUtils]: 19: Hoare triple {1425#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1426#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:30,982 INFO L273 TraceCheckUtils]: 20: Hoare triple {1426#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1426#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:30,982 INFO L273 TraceCheckUtils]: 21: Hoare triple {1426#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {1426#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:30,983 INFO L273 TraceCheckUtils]: 22: Hoare triple {1426#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1427#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:30,984 INFO L273 TraceCheckUtils]: 23: Hoare triple {1427#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1427#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:30,985 INFO L273 TraceCheckUtils]: 24: Hoare triple {1427#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {1420#false} is VALID [2018-11-23 13:16:30,985 INFO L273 TraceCheckUtils]: 25: Hoare triple {1420#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1420#false} is VALID [2018-11-23 13:16:30,986 INFO L273 TraceCheckUtils]: 26: Hoare triple {1420#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1420#false} is VALID [2018-11-23 13:16:30,986 INFO L273 TraceCheckUtils]: 27: Hoare triple {1420#false} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {1420#false} is VALID [2018-11-23 13:16:30,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {1420#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1420#false} is VALID [2018-11-23 13:16:30,986 INFO L273 TraceCheckUtils]: 29: Hoare triple {1420#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1420#false} is VALID [2018-11-23 13:16:30,987 INFO L256 TraceCheckUtils]: 30: Hoare triple {1420#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {1420#false} is VALID [2018-11-23 13:16:30,987 INFO L273 TraceCheckUtils]: 31: Hoare triple {1420#false} ~cond := #in~cond; {1420#false} is VALID [2018-11-23 13:16:30,987 INFO L273 TraceCheckUtils]: 32: Hoare triple {1420#false} assume 0 == ~cond; {1420#false} is VALID [2018-11-23 13:16:30,987 INFO L273 TraceCheckUtils]: 33: Hoare triple {1420#false} assume !false; {1420#false} is VALID [2018-11-23 13:16:30,989 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 33 proven. 57 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:16:31,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:31,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 10 [2018-11-23 13:16:31,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-23 13:16:31,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:31,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:16:31,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:31,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:16:31,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:16:31,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:16:31,048 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 10 states. [2018-11-23 13:16:31,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:31,538 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-23 13:16:31,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:16:31,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-23 13:16:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:16:31,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2018-11-23 13:16:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:16:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 49 transitions. [2018-11-23 13:16:31,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 49 transitions. [2018-11-23 13:16:31,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:31,617 INFO L225 Difference]: With dead ends: 54 [2018-11-23 13:16:31,617 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 13:16:31,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:16:31,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 13:16:31,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 13:16:31,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:31,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-23 13:16:31,655 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-23 13:16:31,655 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-23 13:16:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:31,658 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-23 13:16:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-23 13:16:31,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:31,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:31,659 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-23 13:16:31,659 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-23 13:16:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:31,661 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-23 13:16:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-23 13:16:31,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:31,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:31,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:31,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:31,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:16:31,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-23 13:16:31,664 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 34 [2018-11-23 13:16:31,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:31,665 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-23 13:16:31,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:16:31,665 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-23 13:16:31,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:16:31,666 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:31,666 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:31,666 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:31,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:31,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1324379222, now seen corresponding path program 5 times [2018-11-23 13:16:31,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:31,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:31,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:31,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:31,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:32,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {1750#true} call ULTIMATE.init(); {1750#true} is VALID [2018-11-23 13:16:32,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {1750#true} assume true; {1750#true} is VALID [2018-11-23 13:16:32,197 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1750#true} {1750#true} #39#return; {1750#true} is VALID [2018-11-23 13:16:32,197 INFO L256 TraceCheckUtils]: 3: Hoare triple {1750#true} call #t~ret2 := main(); {1750#true} is VALID [2018-11-23 13:16:32,215 INFO L273 TraceCheckUtils]: 4: Hoare triple {1750#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1752#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:32,224 INFO L273 TraceCheckUtils]: 5: Hoare triple {1752#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1752#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:32,238 INFO L273 TraceCheckUtils]: 6: Hoare triple {1752#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1752#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:32,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {1752#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1753#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:32,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {1753#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1753#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:32,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {1753#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1753#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:32,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {1753#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:32,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {1754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:32,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {1754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:32,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {1754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1755#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:32,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {1755#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1755#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:32,274 INFO L273 TraceCheckUtils]: 15: Hoare triple {1755#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1755#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:32,275 INFO L273 TraceCheckUtils]: 16: Hoare triple {1755#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1756#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:32,275 INFO L273 TraceCheckUtils]: 17: Hoare triple {1756#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1756#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:32,276 INFO L273 TraceCheckUtils]: 18: Hoare triple {1756#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {1756#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:32,277 INFO L273 TraceCheckUtils]: 19: Hoare triple {1756#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1757#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:32,277 INFO L273 TraceCheckUtils]: 20: Hoare triple {1757#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1757#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:32,278 INFO L273 TraceCheckUtils]: 21: Hoare triple {1757#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {1757#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:32,279 INFO L273 TraceCheckUtils]: 22: Hoare triple {1757#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1758#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:32,280 INFO L273 TraceCheckUtils]: 23: Hoare triple {1758#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1758#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:32,280 INFO L273 TraceCheckUtils]: 24: Hoare triple {1758#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1758#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:32,281 INFO L273 TraceCheckUtils]: 25: Hoare triple {1758#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1759#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:32,282 INFO L273 TraceCheckUtils]: 26: Hoare triple {1759#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1759#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:32,283 INFO L273 TraceCheckUtils]: 27: Hoare triple {1759#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1759#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:32,292 INFO L273 TraceCheckUtils]: 28: Hoare triple {1759#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1760#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:32,292 INFO L273 TraceCheckUtils]: 29: Hoare triple {1760#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1760#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:32,293 INFO L273 TraceCheckUtils]: 30: Hoare triple {1760#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {1760#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:32,294 INFO L273 TraceCheckUtils]: 31: Hoare triple {1760#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1761#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:32,294 INFO L273 TraceCheckUtils]: 32: Hoare triple {1761#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1761#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:32,295 INFO L273 TraceCheckUtils]: 33: Hoare triple {1761#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {1751#false} is VALID [2018-11-23 13:16:32,295 INFO L273 TraceCheckUtils]: 34: Hoare triple {1751#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1751#false} is VALID [2018-11-23 13:16:32,295 INFO L273 TraceCheckUtils]: 35: Hoare triple {1751#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1751#false} is VALID [2018-11-23 13:16:32,295 INFO L256 TraceCheckUtils]: 36: Hoare triple {1751#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {1751#false} is VALID [2018-11-23 13:16:32,295 INFO L273 TraceCheckUtils]: 37: Hoare triple {1751#false} ~cond := #in~cond; {1751#false} is VALID [2018-11-23 13:16:32,295 INFO L273 TraceCheckUtils]: 38: Hoare triple {1751#false} assume 0 == ~cond; {1751#false} is VALID [2018-11-23 13:16:32,295 INFO L273 TraceCheckUtils]: 39: Hoare triple {1751#false} assume !false; {1751#false} is VALID [2018-11-23 13:16:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:32,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:32,298 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-23 13:16:32,307 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:17:40,665 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 13:17:40,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:17:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:42,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:17:42,486 INFO L256 TraceCheckUtils]: 0: Hoare triple {1750#true} call ULTIMATE.init(); {1750#true} is VALID [2018-11-23 13:17:42,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {1750#true} assume true; {1750#true} is VALID [2018-11-23 13:17:42,486 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1750#true} {1750#true} #39#return; {1750#true} is VALID [2018-11-23 13:17:42,486 INFO L256 TraceCheckUtils]: 3: Hoare triple {1750#true} call #t~ret2 := main(); {1750#true} is VALID [2018-11-23 13:17:42,487 INFO L273 TraceCheckUtils]: 4: Hoare triple {1750#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1752#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:42,487 INFO L273 TraceCheckUtils]: 5: Hoare triple {1752#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1752#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:42,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {1752#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1752#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:42,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {1752#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1753#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:42,488 INFO L273 TraceCheckUtils]: 8: Hoare triple {1753#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1753#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:42,489 INFO L273 TraceCheckUtils]: 9: Hoare triple {1753#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1753#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:42,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {1753#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:42,490 INFO L273 TraceCheckUtils]: 11: Hoare triple {1754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:42,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {1754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:42,492 INFO L273 TraceCheckUtils]: 13: Hoare triple {1754#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1755#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:42,492 INFO L273 TraceCheckUtils]: 14: Hoare triple {1755#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1755#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:42,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {1755#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1755#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:42,494 INFO L273 TraceCheckUtils]: 16: Hoare triple {1755#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1756#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:42,495 INFO L273 TraceCheckUtils]: 17: Hoare triple {1756#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1756#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:42,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {1756#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {1756#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:42,496 INFO L273 TraceCheckUtils]: 19: Hoare triple {1756#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1757#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:42,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {1757#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1757#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:42,498 INFO L273 TraceCheckUtils]: 21: Hoare triple {1757#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {1757#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:42,499 INFO L273 TraceCheckUtils]: 22: Hoare triple {1757#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1758#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:42,499 INFO L273 TraceCheckUtils]: 23: Hoare triple {1758#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1758#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:42,500 INFO L273 TraceCheckUtils]: 24: Hoare triple {1758#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1758#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:42,501 INFO L273 TraceCheckUtils]: 25: Hoare triple {1758#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1759#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:42,502 INFO L273 TraceCheckUtils]: 26: Hoare triple {1759#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1759#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:42,502 INFO L273 TraceCheckUtils]: 27: Hoare triple {1759#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1759#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:42,505 INFO L273 TraceCheckUtils]: 28: Hoare triple {1759#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1760#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:42,506 INFO L273 TraceCheckUtils]: 29: Hoare triple {1760#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1760#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:42,506 INFO L273 TraceCheckUtils]: 30: Hoare triple {1760#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {1760#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:42,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {1760#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1858#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:42,508 INFO L273 TraceCheckUtils]: 32: Hoare triple {1858#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1858#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:42,509 INFO L273 TraceCheckUtils]: 33: Hoare triple {1858#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {1751#false} is VALID [2018-11-23 13:17:42,509 INFO L273 TraceCheckUtils]: 34: Hoare triple {1751#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1751#false} is VALID [2018-11-23 13:17:42,509 INFO L273 TraceCheckUtils]: 35: Hoare triple {1751#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1751#false} is VALID [2018-11-23 13:17:42,509 INFO L256 TraceCheckUtils]: 36: Hoare triple {1751#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {1751#false} is VALID [2018-11-23 13:17:42,510 INFO L273 TraceCheckUtils]: 37: Hoare triple {1751#false} ~cond := #in~cond; {1751#false} is VALID [2018-11-23 13:17:42,510 INFO L273 TraceCheckUtils]: 38: Hoare triple {1751#false} assume 0 == ~cond; {1751#false} is VALID [2018-11-23 13:17:42,510 INFO L273 TraceCheckUtils]: 39: Hoare triple {1751#false} assume !false; {1751#false} is VALID [2018-11-23 13:17:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:17:42,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:17:42,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 13:17:42,535 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-23 13:17:42,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:17:42,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:17:42,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:42,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:17:42,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:17:42,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:17:42,589 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 13 states. [2018-11-23 13:17:43,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:43,717 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-11-23 13:17:43,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:17:43,717 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-23 13:17:43,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:17:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:17:43,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2018-11-23 13:17:43,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:17:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2018-11-23 13:17:43,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2018-11-23 13:17:43,817 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-23 13:17:43,818 INFO L225 Difference]: With dead ends: 60 [2018-11-23 13:17:43,819 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 13:17:43,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:17:43,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 13:17:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-23 13:17:43,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:17:43,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 48 states. [2018-11-23 13:17:43,867 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 48 states. [2018-11-23 13:17:43,867 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 48 states. [2018-11-23 13:17:43,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:43,869 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-23 13:17:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-23 13:17:43,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:43,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:43,870 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 49 states. [2018-11-23 13:17:43,871 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 49 states. [2018-11-23 13:17:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:43,872 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-11-23 13:17:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-11-23 13:17:43,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:43,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:43,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:17:43,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:17:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:17:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-11-23 13:17:43,875 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 40 [2018-11-23 13:17:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:17:43,875 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-11-23 13:17:43,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:17:43,875 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-11-23 13:17:43,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:17:43,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:17:43,877 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:17:43,877 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:17:43,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:17:43,877 INFO L82 PathProgramCache]: Analyzing trace with hash 475905206, now seen corresponding path program 6 times [2018-11-23 13:17:43,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:17:43,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:17:43,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:43,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:17:43,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:44,386 INFO L256 TraceCheckUtils]: 0: Hoare triple {2130#true} call ULTIMATE.init(); {2130#true} is VALID [2018-11-23 13:17:44,387 INFO L273 TraceCheckUtils]: 1: Hoare triple {2130#true} assume true; {2130#true} is VALID [2018-11-23 13:17:44,387 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2130#true} {2130#true} #39#return; {2130#true} is VALID [2018-11-23 13:17:44,387 INFO L256 TraceCheckUtils]: 3: Hoare triple {2130#true} call #t~ret2 := main(); {2130#true} is VALID [2018-11-23 13:17:44,388 INFO L273 TraceCheckUtils]: 4: Hoare triple {2130#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2132#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:44,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {2132#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2132#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:44,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {2132#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2132#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:44,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {2132#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2133#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:44,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {2133#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2133#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:44,391 INFO L273 TraceCheckUtils]: 9: Hoare triple {2133#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2133#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:44,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {2133#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:44,392 INFO L273 TraceCheckUtils]: 11: Hoare triple {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:44,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:44,394 INFO L273 TraceCheckUtils]: 13: Hoare triple {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2135#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:44,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {2135#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2135#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:44,395 INFO L273 TraceCheckUtils]: 15: Hoare triple {2135#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2135#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:44,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {2135#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2136#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:44,397 INFO L273 TraceCheckUtils]: 17: Hoare triple {2136#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2136#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:44,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {2136#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {2136#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:44,398 INFO L273 TraceCheckUtils]: 19: Hoare triple {2136#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2137#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:44,399 INFO L273 TraceCheckUtils]: 20: Hoare triple {2137#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2137#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:44,400 INFO L273 TraceCheckUtils]: 21: Hoare triple {2137#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {2137#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:44,401 INFO L273 TraceCheckUtils]: 22: Hoare triple {2137#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2138#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:44,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {2138#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2138#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:44,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {2138#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2138#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:44,403 INFO L273 TraceCheckUtils]: 25: Hoare triple {2138#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2139#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:44,404 INFO L273 TraceCheckUtils]: 26: Hoare triple {2139#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2139#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:44,404 INFO L273 TraceCheckUtils]: 27: Hoare triple {2139#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2139#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:44,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {2139#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2140#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:44,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {2140#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2140#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:44,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {2140#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {2140#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:44,407 INFO L273 TraceCheckUtils]: 31: Hoare triple {2140#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2141#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:44,408 INFO L273 TraceCheckUtils]: 32: Hoare triple {2141#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2141#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:44,409 INFO L273 TraceCheckUtils]: 33: Hoare triple {2141#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {2141#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:44,410 INFO L273 TraceCheckUtils]: 34: Hoare triple {2141#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:44,411 INFO L273 TraceCheckUtils]: 35: Hoare triple {2142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:44,411 INFO L273 TraceCheckUtils]: 36: Hoare triple {2142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {2142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:44,412 INFO L273 TraceCheckUtils]: 37: Hoare triple {2142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2143#(and (<= main_~x~0 11) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:17:44,413 INFO L273 TraceCheckUtils]: 38: Hoare triple {2143#(and (<= main_~x~0 11) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2143#(and (<= main_~x~0 11) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:17:44,414 INFO L273 TraceCheckUtils]: 39: Hoare triple {2143#(and (<= main_~x~0 11) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {2131#false} is VALID [2018-11-23 13:17:44,414 INFO L273 TraceCheckUtils]: 40: Hoare triple {2131#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2131#false} is VALID [2018-11-23 13:17:44,415 INFO L273 TraceCheckUtils]: 41: Hoare triple {2131#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2131#false} is VALID [2018-11-23 13:17:44,415 INFO L256 TraceCheckUtils]: 42: Hoare triple {2131#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {2131#false} is VALID [2018-11-23 13:17:44,415 INFO L273 TraceCheckUtils]: 43: Hoare triple {2131#false} ~cond := #in~cond; {2131#false} is VALID [2018-11-23 13:17:44,415 INFO L273 TraceCheckUtils]: 44: Hoare triple {2131#false} assume 0 == ~cond; {2131#false} is VALID [2018-11-23 13:17:44,416 INFO L273 TraceCheckUtils]: 45: Hoare triple {2131#false} assume !false; {2131#false} is VALID [2018-11-23 13:17:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 23 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:17:44,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:17:44,420 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-23 13:17:44,428 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:17:44,463 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:17:44,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:17:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:44,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:17:44,685 INFO L256 TraceCheckUtils]: 0: Hoare triple {2130#true} call ULTIMATE.init(); {2130#true} is VALID [2018-11-23 13:17:44,685 INFO L273 TraceCheckUtils]: 1: Hoare triple {2130#true} assume true; {2130#true} is VALID [2018-11-23 13:17:44,685 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2130#true} {2130#true} #39#return; {2130#true} is VALID [2018-11-23 13:17:44,685 INFO L256 TraceCheckUtils]: 3: Hoare triple {2130#true} call #t~ret2 := main(); {2130#true} is VALID [2018-11-23 13:17:44,686 INFO L273 TraceCheckUtils]: 4: Hoare triple {2130#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,687 INFO L273 TraceCheckUtils]: 6: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,688 INFO L273 TraceCheckUtils]: 7: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,689 INFO L273 TraceCheckUtils]: 8: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,690 INFO L273 TraceCheckUtils]: 9: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,690 INFO L273 TraceCheckUtils]: 10: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,691 INFO L273 TraceCheckUtils]: 11: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,692 INFO L273 TraceCheckUtils]: 12: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,693 INFO L273 TraceCheckUtils]: 13: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,693 INFO L273 TraceCheckUtils]: 14: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,694 INFO L273 TraceCheckUtils]: 15: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,695 INFO L273 TraceCheckUtils]: 16: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,695 INFO L273 TraceCheckUtils]: 17: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,696 INFO L273 TraceCheckUtils]: 18: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,697 INFO L273 TraceCheckUtils]: 19: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,698 INFO L273 TraceCheckUtils]: 20: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,698 INFO L273 TraceCheckUtils]: 21: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,699 INFO L273 TraceCheckUtils]: 22: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,700 INFO L273 TraceCheckUtils]: 23: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,701 INFO L273 TraceCheckUtils]: 24: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,701 INFO L273 TraceCheckUtils]: 25: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,702 INFO L273 TraceCheckUtils]: 26: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,703 INFO L273 TraceCheckUtils]: 27: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,704 INFO L273 TraceCheckUtils]: 28: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,704 INFO L273 TraceCheckUtils]: 29: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,705 INFO L273 TraceCheckUtils]: 30: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,706 INFO L273 TraceCheckUtils]: 31: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,706 INFO L273 TraceCheckUtils]: 32: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,707 INFO L273 TraceCheckUtils]: 33: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,708 INFO L273 TraceCheckUtils]: 34: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,709 INFO L273 TraceCheckUtils]: 35: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:44,709 INFO L273 TraceCheckUtils]: 36: Hoare triple {2159#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {2256#(and (= main_~z~0 5000001) (= 10000000 main_~y~0))} is VALID [2018-11-23 13:17:44,710 INFO L273 TraceCheckUtils]: 37: Hoare triple {2256#(and (= main_~z~0 5000001) (= 10000000 main_~y~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2256#(and (= main_~z~0 5000001) (= 10000000 main_~y~0))} is VALID [2018-11-23 13:17:44,711 INFO L273 TraceCheckUtils]: 38: Hoare triple {2256#(and (= main_~z~0 5000001) (= 10000000 main_~y~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2256#(and (= main_~z~0 5000001) (= 10000000 main_~y~0))} is VALID [2018-11-23 13:17:44,712 INFO L273 TraceCheckUtils]: 39: Hoare triple {2256#(and (= main_~z~0 5000001) (= 10000000 main_~y~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {2266#(and (= 10000000 main_~y~0) (= main_~z~0 5000002))} is VALID [2018-11-23 13:17:44,712 INFO L273 TraceCheckUtils]: 40: Hoare triple {2266#(and (= 10000000 main_~y~0) (= main_~z~0 5000002))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2266#(and (= 10000000 main_~y~0) (= main_~z~0 5000002))} is VALID [2018-11-23 13:17:44,713 INFO L273 TraceCheckUtils]: 41: Hoare triple {2266#(and (= 10000000 main_~y~0) (= main_~z~0 5000002))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2273#(and (<= 10000000 (mod main_~x~0 4294967296)) (= main_~z~0 5000002))} is VALID [2018-11-23 13:17:44,714 INFO L256 TraceCheckUtils]: 42: Hoare triple {2273#(and (<= 10000000 (mod main_~x~0 4294967296)) (= main_~z~0 5000002))} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {2277#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:17:44,715 INFO L273 TraceCheckUtils]: 43: Hoare triple {2277#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2281#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:17:44,716 INFO L273 TraceCheckUtils]: 44: Hoare triple {2281#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2131#false} is VALID [2018-11-23 13:17:44,716 INFO L273 TraceCheckUtils]: 45: Hoare triple {2131#false} assume !false; {2131#false} is VALID [2018-11-23 13:17:44,719 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-23 13:17:44,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:17:44,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2018-11-23 13:17:44,739 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2018-11-23 13:17:44,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:17:44,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:17:44,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:44,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:17:44,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:17:44,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:17:44,801 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 20 states. [2018-11-23 13:17:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:47,191 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-11-23 13:17:47,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:17:47,191 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2018-11-23 13:17:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:17:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:17:47,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2018-11-23 13:17:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:17:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2018-11-23 13:17:47,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 77 transitions. [2018-11-23 13:17:47,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:47,282 INFO L225 Difference]: With dead ends: 72 [2018-11-23 13:17:47,282 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 13:17:47,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:17:47,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 13:17:47,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-23 13:17:47,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:17:47,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 57 states. [2018-11-23 13:17:47,323 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 57 states. [2018-11-23 13:17:47,323 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 57 states. [2018-11-23 13:17:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:47,325 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-23 13:17:47,325 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-23 13:17:47,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:47,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:47,326 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 58 states. [2018-11-23 13:17:47,326 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 58 states. [2018-11-23 13:17:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:47,327 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-23 13:17:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-23 13:17:47,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:47,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:47,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:17:47,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:17:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:17:47,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-11-23 13:17:47,329 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 46 [2018-11-23 13:17:47,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:17:47,329 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-11-23 13:17:47,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:17:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-11-23 13:17:47,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 13:17:47,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:17:47,331 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:17:47,331 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:17:47,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:17:47,331 INFO L82 PathProgramCache]: Analyzing trace with hash -271959499, now seen corresponding path program 7 times [2018-11-23 13:17:47,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:17:47,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:17:47,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:47,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:17:47,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:47,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {2610#true} call ULTIMATE.init(); {2610#true} is VALID [2018-11-23 13:17:47,731 INFO L273 TraceCheckUtils]: 1: Hoare triple {2610#true} assume true; {2610#true} is VALID [2018-11-23 13:17:47,731 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2610#true} {2610#true} #39#return; {2610#true} is VALID [2018-11-23 13:17:47,732 INFO L256 TraceCheckUtils]: 3: Hoare triple {2610#true} call #t~ret2 := main(); {2610#true} is VALID [2018-11-23 13:17:47,732 INFO L273 TraceCheckUtils]: 4: Hoare triple {2610#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2612#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:47,733 INFO L273 TraceCheckUtils]: 5: Hoare triple {2612#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2612#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:47,734 INFO L273 TraceCheckUtils]: 6: Hoare triple {2612#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2612#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:47,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {2612#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2613#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:47,735 INFO L273 TraceCheckUtils]: 8: Hoare triple {2613#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2613#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:47,736 INFO L273 TraceCheckUtils]: 9: Hoare triple {2613#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2613#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:47,737 INFO L273 TraceCheckUtils]: 10: Hoare triple {2613#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2614#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:47,738 INFO L273 TraceCheckUtils]: 11: Hoare triple {2614#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2614#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:47,738 INFO L273 TraceCheckUtils]: 12: Hoare triple {2614#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {2614#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:47,739 INFO L273 TraceCheckUtils]: 13: Hoare triple {2614#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2615#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:47,740 INFO L273 TraceCheckUtils]: 14: Hoare triple {2615#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2615#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:47,741 INFO L273 TraceCheckUtils]: 15: Hoare triple {2615#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2615#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:47,741 INFO L273 TraceCheckUtils]: 16: Hoare triple {2615#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2616#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:47,742 INFO L273 TraceCheckUtils]: 17: Hoare triple {2616#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2616#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:47,743 INFO L273 TraceCheckUtils]: 18: Hoare triple {2616#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {2616#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:47,744 INFO L273 TraceCheckUtils]: 19: Hoare triple {2616#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2617#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:47,744 INFO L273 TraceCheckUtils]: 20: Hoare triple {2617#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2617#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:47,745 INFO L273 TraceCheckUtils]: 21: Hoare triple {2617#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {2617#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:47,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {2617#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2618#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:47,747 INFO L273 TraceCheckUtils]: 23: Hoare triple {2618#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2618#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:47,747 INFO L273 TraceCheckUtils]: 24: Hoare triple {2618#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2618#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:47,748 INFO L273 TraceCheckUtils]: 25: Hoare triple {2618#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2619#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:47,749 INFO L273 TraceCheckUtils]: 26: Hoare triple {2619#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2619#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:47,750 INFO L273 TraceCheckUtils]: 27: Hoare triple {2619#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2619#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:47,751 INFO L273 TraceCheckUtils]: 28: Hoare triple {2619#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2620#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:47,751 INFO L273 TraceCheckUtils]: 29: Hoare triple {2620#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2620#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:47,752 INFO L273 TraceCheckUtils]: 30: Hoare triple {2620#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {2620#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:47,767 INFO L273 TraceCheckUtils]: 31: Hoare triple {2620#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2621#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:47,767 INFO L273 TraceCheckUtils]: 32: Hoare triple {2621#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2621#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:47,768 INFO L273 TraceCheckUtils]: 33: Hoare triple {2621#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {2621#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:47,768 INFO L273 TraceCheckUtils]: 34: Hoare triple {2621#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2622#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:47,769 INFO L273 TraceCheckUtils]: 35: Hoare triple {2622#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2622#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:47,770 INFO L273 TraceCheckUtils]: 36: Hoare triple {2622#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2622#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:47,771 INFO L273 TraceCheckUtils]: 37: Hoare triple {2622#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2623#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:47,771 INFO L273 TraceCheckUtils]: 38: Hoare triple {2623#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2623#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:47,771 INFO L273 TraceCheckUtils]: 39: Hoare triple {2623#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !(~x~0 % 4294967296 >= 5000000); {2623#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:47,772 INFO L273 TraceCheckUtils]: 40: Hoare triple {2623#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2624#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:47,773 INFO L273 TraceCheckUtils]: 41: Hoare triple {2624#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2624#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:47,773 INFO L273 TraceCheckUtils]: 42: Hoare triple {2624#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {2624#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:47,774 INFO L273 TraceCheckUtils]: 43: Hoare triple {2624#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2625#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:47,775 INFO L273 TraceCheckUtils]: 44: Hoare triple {2625#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2625#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:47,776 INFO L273 TraceCheckUtils]: 45: Hoare triple {2625#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {2625#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:47,777 INFO L273 TraceCheckUtils]: 46: Hoare triple {2625#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2626#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:17:47,778 INFO L273 TraceCheckUtils]: 47: Hoare triple {2626#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2626#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:17:47,779 INFO L273 TraceCheckUtils]: 48: Hoare triple {2626#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {2611#false} is VALID [2018-11-23 13:17:47,779 INFO L273 TraceCheckUtils]: 49: Hoare triple {2611#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2611#false} is VALID [2018-11-23 13:17:47,779 INFO L273 TraceCheckUtils]: 50: Hoare triple {2611#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2611#false} is VALID [2018-11-23 13:17:47,779 INFO L256 TraceCheckUtils]: 51: Hoare triple {2611#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {2611#false} is VALID [2018-11-23 13:17:47,779 INFO L273 TraceCheckUtils]: 52: Hoare triple {2611#false} ~cond := #in~cond; {2611#false} is VALID [2018-11-23 13:17:47,780 INFO L273 TraceCheckUtils]: 53: Hoare triple {2611#false} assume 0 == ~cond; {2611#false} is VALID [2018-11-23 13:17:47,780 INFO L273 TraceCheckUtils]: 54: Hoare triple {2611#false} assume !false; {2611#false} is VALID [2018-11-23 13:17:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:17:47,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:17:47,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:17:47,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:17:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:47,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:17:48,123 INFO L256 TraceCheckUtils]: 0: Hoare triple {2610#true} call ULTIMATE.init(); {2610#true} is VALID [2018-11-23 13:17:48,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {2610#true} assume true; {2610#true} is VALID [2018-11-23 13:17:48,124 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2610#true} {2610#true} #39#return; {2610#true} is VALID [2018-11-23 13:17:48,124 INFO L256 TraceCheckUtils]: 3: Hoare triple {2610#true} call #t~ret2 := main(); {2610#true} is VALID [2018-11-23 13:17:48,125 INFO L273 TraceCheckUtils]: 4: Hoare triple {2610#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2612#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:48,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {2612#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2612#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:48,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {2612#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2612#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:48,126 INFO L273 TraceCheckUtils]: 7: Hoare triple {2612#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2613#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:48,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {2613#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2613#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:48,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {2613#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2613#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:48,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {2613#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2614#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:48,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {2614#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2614#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:48,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {2614#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {2614#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:48,130 INFO L273 TraceCheckUtils]: 13: Hoare triple {2614#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2615#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:48,131 INFO L273 TraceCheckUtils]: 14: Hoare triple {2615#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2615#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:48,131 INFO L273 TraceCheckUtils]: 15: Hoare triple {2615#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2615#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:48,132 INFO L273 TraceCheckUtils]: 16: Hoare triple {2615#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2616#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:48,133 INFO L273 TraceCheckUtils]: 17: Hoare triple {2616#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2616#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:48,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {2616#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {2616#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:48,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {2616#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2617#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:48,135 INFO L273 TraceCheckUtils]: 20: Hoare triple {2617#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2617#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:48,136 INFO L273 TraceCheckUtils]: 21: Hoare triple {2617#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {2617#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:48,137 INFO L273 TraceCheckUtils]: 22: Hoare triple {2617#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2618#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:48,138 INFO L273 TraceCheckUtils]: 23: Hoare triple {2618#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2618#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:48,138 INFO L273 TraceCheckUtils]: 24: Hoare triple {2618#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2618#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:48,139 INFO L273 TraceCheckUtils]: 25: Hoare triple {2618#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2619#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:48,140 INFO L273 TraceCheckUtils]: 26: Hoare triple {2619#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2619#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:48,140 INFO L273 TraceCheckUtils]: 27: Hoare triple {2619#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2619#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:48,141 INFO L273 TraceCheckUtils]: 28: Hoare triple {2619#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2620#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:48,142 INFO L273 TraceCheckUtils]: 29: Hoare triple {2620#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2620#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:48,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {2620#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {2620#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:48,144 INFO L273 TraceCheckUtils]: 31: Hoare triple {2620#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2621#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:48,144 INFO L273 TraceCheckUtils]: 32: Hoare triple {2621#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2621#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:48,145 INFO L273 TraceCheckUtils]: 33: Hoare triple {2621#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {2621#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:48,146 INFO L273 TraceCheckUtils]: 34: Hoare triple {2621#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2622#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:48,147 INFO L273 TraceCheckUtils]: 35: Hoare triple {2622#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2622#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:48,147 INFO L273 TraceCheckUtils]: 36: Hoare triple {2622#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2622#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:48,148 INFO L273 TraceCheckUtils]: 37: Hoare triple {2622#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2623#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:48,149 INFO L273 TraceCheckUtils]: 38: Hoare triple {2623#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2623#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:48,149 INFO L273 TraceCheckUtils]: 39: Hoare triple {2623#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !(~x~0 % 4294967296 >= 5000000); {2623#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:48,150 INFO L273 TraceCheckUtils]: 40: Hoare triple {2623#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2624#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:48,151 INFO L273 TraceCheckUtils]: 41: Hoare triple {2624#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2624#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:48,152 INFO L273 TraceCheckUtils]: 42: Hoare triple {2624#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {2611#false} is VALID [2018-11-23 13:17:48,152 INFO L273 TraceCheckUtils]: 43: Hoare triple {2611#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2611#false} is VALID [2018-11-23 13:17:48,153 INFO L273 TraceCheckUtils]: 44: Hoare triple {2611#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2611#false} is VALID [2018-11-23 13:17:48,153 INFO L273 TraceCheckUtils]: 45: Hoare triple {2611#false} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {2611#false} is VALID [2018-11-23 13:17:48,153 INFO L273 TraceCheckUtils]: 46: Hoare triple {2611#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2611#false} is VALID [2018-11-23 13:17:48,153 INFO L273 TraceCheckUtils]: 47: Hoare triple {2611#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2611#false} is VALID [2018-11-23 13:17:48,153 INFO L273 TraceCheckUtils]: 48: Hoare triple {2611#false} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {2611#false} is VALID [2018-11-23 13:17:48,154 INFO L273 TraceCheckUtils]: 49: Hoare triple {2611#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2611#false} is VALID [2018-11-23 13:17:48,154 INFO L273 TraceCheckUtils]: 50: Hoare triple {2611#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2611#false} is VALID [2018-11-23 13:17:48,154 INFO L256 TraceCheckUtils]: 51: Hoare triple {2611#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {2611#false} is VALID [2018-11-23 13:17:48,154 INFO L273 TraceCheckUtils]: 52: Hoare triple {2611#false} ~cond := #in~cond; {2611#false} is VALID [2018-11-23 13:17:48,154 INFO L273 TraceCheckUtils]: 53: Hoare triple {2611#false} assume 0 == ~cond; {2611#false} is VALID [2018-11-23 13:17:48,155 INFO L273 TraceCheckUtils]: 54: Hoare triple {2611#false} assume !false; {2611#false} is VALID [2018-11-23 13:17:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 101 proven. 222 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 13:17:48,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:17:48,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 17 [2018-11-23 13:17:48,178 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-11-23 13:17:48,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:17:48,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:17:48,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:48,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:17:48,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:17:48,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:17:48,240 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 17 states. [2018-11-23 13:17:49,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:49,765 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-11-23 13:17:49,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:17:49,765 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-11-23 13:17:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:17:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:17:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 71 transitions. [2018-11-23 13:17:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:17:49,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 71 transitions. [2018-11-23 13:17:49,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 71 transitions. [2018-11-23 13:17:49,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:49,842 INFO L225 Difference]: With dead ends: 81 [2018-11-23 13:17:49,842 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:17:49,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:17:49,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:17:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-23 13:17:49,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:17:49,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 66 states. [2018-11-23 13:17:49,904 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 66 states. [2018-11-23 13:17:49,904 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 66 states. [2018-11-23 13:17:49,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:49,906 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-23 13:17:49,906 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 13:17:49,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:49,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:49,906 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 67 states. [2018-11-23 13:17:49,906 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 67 states. [2018-11-23 13:17:49,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:49,908 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-23 13:17:49,908 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-23 13:17:49,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:49,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:49,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:17:49,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:17:49,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 13:17:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-23 13:17:49,910 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 55 [2018-11-23 13:17:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:17:49,910 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-23 13:17:49,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:17:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-23 13:17:49,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:17:49,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:17:49,911 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:17:49,911 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:17:49,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:17:49,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1335161044, now seen corresponding path program 8 times [2018-11-23 13:17:49,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:17:49,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:17:49,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:49,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:17:49,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:50,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {3127#true} call ULTIMATE.init(); {3127#true} is VALID [2018-11-23 13:17:50,485 INFO L273 TraceCheckUtils]: 1: Hoare triple {3127#true} assume true; {3127#true} is VALID [2018-11-23 13:17:50,485 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3127#true} {3127#true} #39#return; {3127#true} is VALID [2018-11-23 13:17:50,485 INFO L256 TraceCheckUtils]: 3: Hoare triple {3127#true} call #t~ret2 := main(); {3127#true} is VALID [2018-11-23 13:17:50,486 INFO L273 TraceCheckUtils]: 4: Hoare triple {3127#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3129#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:50,487 INFO L273 TraceCheckUtils]: 5: Hoare triple {3129#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3129#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:50,487 INFO L273 TraceCheckUtils]: 6: Hoare triple {3129#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3129#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:50,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {3129#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3130#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:50,488 INFO L273 TraceCheckUtils]: 8: Hoare triple {3130#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3130#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:50,489 INFO L273 TraceCheckUtils]: 9: Hoare triple {3130#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3130#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:50,489 INFO L273 TraceCheckUtils]: 10: Hoare triple {3130#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:50,490 INFO L273 TraceCheckUtils]: 11: Hoare triple {3131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:50,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {3131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {3131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:50,491 INFO L273 TraceCheckUtils]: 13: Hoare triple {3131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:50,492 INFO L273 TraceCheckUtils]: 14: Hoare triple {3132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:50,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {3132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:50,494 INFO L273 TraceCheckUtils]: 16: Hoare triple {3132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3133#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:50,494 INFO L273 TraceCheckUtils]: 17: Hoare triple {3133#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3133#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:50,495 INFO L273 TraceCheckUtils]: 18: Hoare triple {3133#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {3133#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:50,496 INFO L273 TraceCheckUtils]: 19: Hoare triple {3133#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:50,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {3134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:50,497 INFO L273 TraceCheckUtils]: 21: Hoare triple {3134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {3134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:50,498 INFO L273 TraceCheckUtils]: 22: Hoare triple {3134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3135#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:50,499 INFO L273 TraceCheckUtils]: 23: Hoare triple {3135#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3135#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:50,500 INFO L273 TraceCheckUtils]: 24: Hoare triple {3135#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3135#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:50,500 INFO L273 TraceCheckUtils]: 25: Hoare triple {3135#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:50,501 INFO L273 TraceCheckUtils]: 26: Hoare triple {3136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:50,502 INFO L273 TraceCheckUtils]: 27: Hoare triple {3136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:50,503 INFO L273 TraceCheckUtils]: 28: Hoare triple {3136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3137#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:50,503 INFO L273 TraceCheckUtils]: 29: Hoare triple {3137#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3137#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:50,504 INFO L273 TraceCheckUtils]: 30: Hoare triple {3137#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {3137#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:50,505 INFO L273 TraceCheckUtils]: 31: Hoare triple {3137#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3138#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:50,506 INFO L273 TraceCheckUtils]: 32: Hoare triple {3138#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3138#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:50,506 INFO L273 TraceCheckUtils]: 33: Hoare triple {3138#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {3138#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:50,507 INFO L273 TraceCheckUtils]: 34: Hoare triple {3138#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:50,508 INFO L273 TraceCheckUtils]: 35: Hoare triple {3139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:50,509 INFO L273 TraceCheckUtils]: 36: Hoare triple {3139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:50,509 INFO L273 TraceCheckUtils]: 37: Hoare triple {3139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3140#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:50,510 INFO L273 TraceCheckUtils]: 38: Hoare triple {3140#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3140#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:50,511 INFO L273 TraceCheckUtils]: 39: Hoare triple {3140#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !(~x~0 % 4294967296 >= 5000000); {3140#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:50,512 INFO L273 TraceCheckUtils]: 40: Hoare triple {3140#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:50,512 INFO L273 TraceCheckUtils]: 41: Hoare triple {3141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:50,513 INFO L273 TraceCheckUtils]: 42: Hoare triple {3141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:50,514 INFO L273 TraceCheckUtils]: 43: Hoare triple {3141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:50,515 INFO L273 TraceCheckUtils]: 44: Hoare triple {3142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:50,515 INFO L273 TraceCheckUtils]: 45: Hoare triple {3142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:50,516 INFO L273 TraceCheckUtils]: 46: Hoare triple {3142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3143#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:50,517 INFO L273 TraceCheckUtils]: 47: Hoare triple {3143#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3143#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:50,518 INFO L273 TraceCheckUtils]: 48: Hoare triple {3143#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3143#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:50,518 INFO L273 TraceCheckUtils]: 49: Hoare triple {3143#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:50,519 INFO L273 TraceCheckUtils]: 50: Hoare triple {3144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:50,520 INFO L273 TraceCheckUtils]: 51: Hoare triple {3144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {3144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:50,521 INFO L273 TraceCheckUtils]: 52: Hoare triple {3144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:50,522 INFO L273 TraceCheckUtils]: 53: Hoare triple {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:50,522 INFO L273 TraceCheckUtils]: 54: Hoare triple {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:50,523 INFO L273 TraceCheckUtils]: 55: Hoare triple {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3146#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:17:50,524 INFO L273 TraceCheckUtils]: 56: Hoare triple {3146#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3146#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:17:50,525 INFO L273 TraceCheckUtils]: 57: Hoare triple {3146#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {3128#false} is VALID [2018-11-23 13:17:50,525 INFO L273 TraceCheckUtils]: 58: Hoare triple {3128#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3128#false} is VALID [2018-11-23 13:17:50,526 INFO L273 TraceCheckUtils]: 59: Hoare triple {3128#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {3128#false} is VALID [2018-11-23 13:17:50,526 INFO L256 TraceCheckUtils]: 60: Hoare triple {3128#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {3128#false} is VALID [2018-11-23 13:17:50,526 INFO L273 TraceCheckUtils]: 61: Hoare triple {3128#false} ~cond := #in~cond; {3128#false} is VALID [2018-11-23 13:17:50,526 INFO L273 TraceCheckUtils]: 62: Hoare triple {3128#false} assume 0 == ~cond; {3128#false} is VALID [2018-11-23 13:17:50,526 INFO L273 TraceCheckUtils]: 63: Hoare triple {3128#false} assume !false; {3128#false} is VALID [2018-11-23 13:17:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 35 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:17:50,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:17:50,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:17:50,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:17:50,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:17:50,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:17:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:50,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:17:50,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {3127#true} call ULTIMATE.init(); {3127#true} is VALID [2018-11-23 13:17:50,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {3127#true} assume true; {3127#true} is VALID [2018-11-23 13:17:50,713 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3127#true} {3127#true} #39#return; {3127#true} is VALID [2018-11-23 13:17:50,713 INFO L256 TraceCheckUtils]: 3: Hoare triple {3127#true} call #t~ret2 := main(); {3127#true} is VALID [2018-11-23 13:17:50,714 INFO L273 TraceCheckUtils]: 4: Hoare triple {3127#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3129#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:50,714 INFO L273 TraceCheckUtils]: 5: Hoare triple {3129#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3129#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:50,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {3129#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3129#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:50,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {3129#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3130#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:50,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {3130#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3130#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:50,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {3130#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3130#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:50,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {3130#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:50,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {3131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:50,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {3131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {3131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:50,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {3131#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:50,741 INFO L273 TraceCheckUtils]: 14: Hoare triple {3132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:50,741 INFO L273 TraceCheckUtils]: 15: Hoare triple {3132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:50,742 INFO L273 TraceCheckUtils]: 16: Hoare triple {3132#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3133#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:50,742 INFO L273 TraceCheckUtils]: 17: Hoare triple {3133#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3133#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:50,743 INFO L273 TraceCheckUtils]: 18: Hoare triple {3133#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {3133#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:50,744 INFO L273 TraceCheckUtils]: 19: Hoare triple {3133#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:50,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {3134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:50,745 INFO L273 TraceCheckUtils]: 21: Hoare triple {3134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {3134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:50,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {3134#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3135#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:50,747 INFO L273 TraceCheckUtils]: 23: Hoare triple {3135#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3135#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:50,748 INFO L273 TraceCheckUtils]: 24: Hoare triple {3135#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3135#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:50,748 INFO L273 TraceCheckUtils]: 25: Hoare triple {3135#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:50,749 INFO L273 TraceCheckUtils]: 26: Hoare triple {3136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:50,750 INFO L273 TraceCheckUtils]: 27: Hoare triple {3136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:50,751 INFO L273 TraceCheckUtils]: 28: Hoare triple {3136#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3137#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:50,751 INFO L273 TraceCheckUtils]: 29: Hoare triple {3137#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3137#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:50,752 INFO L273 TraceCheckUtils]: 30: Hoare triple {3137#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {3137#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:50,753 INFO L273 TraceCheckUtils]: 31: Hoare triple {3137#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3138#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:50,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {3138#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3138#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:50,754 INFO L273 TraceCheckUtils]: 33: Hoare triple {3138#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {3138#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:50,755 INFO L273 TraceCheckUtils]: 34: Hoare triple {3138#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:50,756 INFO L273 TraceCheckUtils]: 35: Hoare triple {3139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:50,757 INFO L273 TraceCheckUtils]: 36: Hoare triple {3139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:50,757 INFO L273 TraceCheckUtils]: 37: Hoare triple {3139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3140#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:50,758 INFO L273 TraceCheckUtils]: 38: Hoare triple {3140#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3140#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:50,759 INFO L273 TraceCheckUtils]: 39: Hoare triple {3140#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !(~x~0 % 4294967296 >= 5000000); {3140#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:50,760 INFO L273 TraceCheckUtils]: 40: Hoare triple {3140#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:50,760 INFO L273 TraceCheckUtils]: 41: Hoare triple {3141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:50,761 INFO L273 TraceCheckUtils]: 42: Hoare triple {3141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:50,762 INFO L273 TraceCheckUtils]: 43: Hoare triple {3141#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:50,763 INFO L273 TraceCheckUtils]: 44: Hoare triple {3142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:50,763 INFO L273 TraceCheckUtils]: 45: Hoare triple {3142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:50,764 INFO L273 TraceCheckUtils]: 46: Hoare triple {3142#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3143#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:50,765 INFO L273 TraceCheckUtils]: 47: Hoare triple {3143#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3143#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:50,766 INFO L273 TraceCheckUtils]: 48: Hoare triple {3143#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3143#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:50,766 INFO L273 TraceCheckUtils]: 49: Hoare triple {3143#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:50,767 INFO L273 TraceCheckUtils]: 50: Hoare triple {3144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:50,768 INFO L273 TraceCheckUtils]: 51: Hoare triple {3144#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {3128#false} is VALID [2018-11-23 13:17:50,768 INFO L273 TraceCheckUtils]: 52: Hoare triple {3128#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3128#false} is VALID [2018-11-23 13:17:50,769 INFO L273 TraceCheckUtils]: 53: Hoare triple {3128#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3128#false} is VALID [2018-11-23 13:17:50,769 INFO L273 TraceCheckUtils]: 54: Hoare triple {3128#false} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {3128#false} is VALID [2018-11-23 13:17:50,769 INFO L273 TraceCheckUtils]: 55: Hoare triple {3128#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3128#false} is VALID [2018-11-23 13:17:50,769 INFO L273 TraceCheckUtils]: 56: Hoare triple {3128#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3128#false} is VALID [2018-11-23 13:17:50,769 INFO L273 TraceCheckUtils]: 57: Hoare triple {3128#false} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {3128#false} is VALID [2018-11-23 13:17:50,770 INFO L273 TraceCheckUtils]: 58: Hoare triple {3128#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3128#false} is VALID [2018-11-23 13:17:50,770 INFO L273 TraceCheckUtils]: 59: Hoare triple {3128#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {3128#false} is VALID [2018-11-23 13:17:50,770 INFO L256 TraceCheckUtils]: 60: Hoare triple {3128#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {3128#false} is VALID [2018-11-23 13:17:50,770 INFO L273 TraceCheckUtils]: 61: Hoare triple {3128#false} ~cond := #in~cond; {3128#false} is VALID [2018-11-23 13:17:50,770 INFO L273 TraceCheckUtils]: 62: Hoare triple {3128#false} assume 0 == ~cond; {3128#false} is VALID [2018-11-23 13:17:50,771 INFO L273 TraceCheckUtils]: 63: Hoare triple {3128#false} assume !false; {3128#false} is VALID [2018-11-23 13:17:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 125 proven. 345 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 13:17:50,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:17:50,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 20 [2018-11-23 13:17:50,797 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-11-23 13:17:50,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:17:50,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:17:50,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:50,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:17:50,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:17:50,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:17:50,869 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 20 states. [2018-11-23 13:17:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:53,601 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-11-23 13:17:53,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:17:53,601 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-11-23 13:17:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:17:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:17:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 80 transitions. [2018-11-23 13:17:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:17:53,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 80 transitions. [2018-11-23 13:17:53,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 80 transitions. [2018-11-23 13:17:53,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:53,738 INFO L225 Difference]: With dead ends: 90 [2018-11-23 13:17:53,738 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 13:17:53,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:17:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 13:17:53,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-11-23 13:17:53,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:17:53,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 75 states. [2018-11-23 13:17:53,907 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 75 states. [2018-11-23 13:17:53,908 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 75 states. [2018-11-23 13:17:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:53,909 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-23 13:17:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-23 13:17:53,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:53,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:53,910 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 76 states. [2018-11-23 13:17:53,910 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 76 states. [2018-11-23 13:17:53,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:53,912 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-23 13:17:53,912 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-23 13:17:53,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:53,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:53,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:17:53,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:17:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 13:17:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-23 13:17:53,915 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 64 [2018-11-23 13:17:53,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:17:53,915 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-23 13:17:53,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:17:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-11-23 13:17:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 13:17:53,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:17:53,916 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:17:53,917 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:17:53,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:17:53,917 INFO L82 PathProgramCache]: Analyzing trace with hash 51658005, now seen corresponding path program 9 times [2018-11-23 13:17:53,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:17:53,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:17:53,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:53,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:17:53,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:54,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {3716#true} call ULTIMATE.init(); {3716#true} is VALID [2018-11-23 13:17:54,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {3716#true} assume true; {3716#true} is VALID [2018-11-23 13:17:54,561 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3716#true} {3716#true} #39#return; {3716#true} is VALID [2018-11-23 13:17:54,562 INFO L256 TraceCheckUtils]: 3: Hoare triple {3716#true} call #t~ret2 := main(); {3716#true} is VALID [2018-11-23 13:17:54,563 INFO L273 TraceCheckUtils]: 4: Hoare triple {3716#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3718#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:54,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {3718#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3718#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:54,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {3718#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3718#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:54,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {3718#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3719#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:54,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {3719#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3719#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:54,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {3719#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3719#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:54,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {3719#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3720#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:54,566 INFO L273 TraceCheckUtils]: 11: Hoare triple {3720#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3720#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:54,566 INFO L273 TraceCheckUtils]: 12: Hoare triple {3720#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {3720#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:54,567 INFO L273 TraceCheckUtils]: 13: Hoare triple {3720#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3721#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:54,568 INFO L273 TraceCheckUtils]: 14: Hoare triple {3721#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3721#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:54,569 INFO L273 TraceCheckUtils]: 15: Hoare triple {3721#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3721#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:54,570 INFO L273 TraceCheckUtils]: 16: Hoare triple {3721#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3722#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:54,570 INFO L273 TraceCheckUtils]: 17: Hoare triple {3722#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3722#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:54,571 INFO L273 TraceCheckUtils]: 18: Hoare triple {3722#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {3722#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:54,572 INFO L273 TraceCheckUtils]: 19: Hoare triple {3722#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3723#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:54,573 INFO L273 TraceCheckUtils]: 20: Hoare triple {3723#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3723#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:54,573 INFO L273 TraceCheckUtils]: 21: Hoare triple {3723#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {3723#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:54,574 INFO L273 TraceCheckUtils]: 22: Hoare triple {3723#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3724#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:54,575 INFO L273 TraceCheckUtils]: 23: Hoare triple {3724#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3724#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:54,575 INFO L273 TraceCheckUtils]: 24: Hoare triple {3724#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3724#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:54,576 INFO L273 TraceCheckUtils]: 25: Hoare triple {3724#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3725#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:54,577 INFO L273 TraceCheckUtils]: 26: Hoare triple {3725#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3725#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:54,578 INFO L273 TraceCheckUtils]: 27: Hoare triple {3725#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3725#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:54,579 INFO L273 TraceCheckUtils]: 28: Hoare triple {3725#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3726#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:54,579 INFO L273 TraceCheckUtils]: 29: Hoare triple {3726#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3726#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:54,580 INFO L273 TraceCheckUtils]: 30: Hoare triple {3726#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {3726#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:54,581 INFO L273 TraceCheckUtils]: 31: Hoare triple {3726#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3727#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:54,581 INFO L273 TraceCheckUtils]: 32: Hoare triple {3727#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3727#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:54,582 INFO L273 TraceCheckUtils]: 33: Hoare triple {3727#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {3727#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:54,583 INFO L273 TraceCheckUtils]: 34: Hoare triple {3727#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3728#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:54,584 INFO L273 TraceCheckUtils]: 35: Hoare triple {3728#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3728#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:54,584 INFO L273 TraceCheckUtils]: 36: Hoare triple {3728#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3728#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:54,585 INFO L273 TraceCheckUtils]: 37: Hoare triple {3728#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3729#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:54,586 INFO L273 TraceCheckUtils]: 38: Hoare triple {3729#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3729#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:54,587 INFO L273 TraceCheckUtils]: 39: Hoare triple {3729#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !(~x~0 % 4294967296 >= 5000000); {3729#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:54,587 INFO L273 TraceCheckUtils]: 40: Hoare triple {3729#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3730#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:54,588 INFO L273 TraceCheckUtils]: 41: Hoare triple {3730#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3730#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:54,589 INFO L273 TraceCheckUtils]: 42: Hoare triple {3730#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3730#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:54,590 INFO L273 TraceCheckUtils]: 43: Hoare triple {3730#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3731#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:54,590 INFO L273 TraceCheckUtils]: 44: Hoare triple {3731#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3731#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:54,591 INFO L273 TraceCheckUtils]: 45: Hoare triple {3731#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3731#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:54,592 INFO L273 TraceCheckUtils]: 46: Hoare triple {3731#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3732#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:54,593 INFO L273 TraceCheckUtils]: 47: Hoare triple {3732#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3732#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:54,593 INFO L273 TraceCheckUtils]: 48: Hoare triple {3732#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3732#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:54,594 INFO L273 TraceCheckUtils]: 49: Hoare triple {3732#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3733#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:54,595 INFO L273 TraceCheckUtils]: 50: Hoare triple {3733#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3733#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:54,596 INFO L273 TraceCheckUtils]: 51: Hoare triple {3733#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 >= 5000000); {3733#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:54,596 INFO L273 TraceCheckUtils]: 52: Hoare triple {3733#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3734#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:54,597 INFO L273 TraceCheckUtils]: 53: Hoare triple {3734#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3734#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:54,598 INFO L273 TraceCheckUtils]: 54: Hoare triple {3734#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3734#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:54,599 INFO L273 TraceCheckUtils]: 55: Hoare triple {3734#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3735#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:17:54,599 INFO L273 TraceCheckUtils]: 56: Hoare triple {3735#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3735#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:17:54,600 INFO L273 TraceCheckUtils]: 57: Hoare triple {3735#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3735#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:17:54,620 INFO L273 TraceCheckUtils]: 58: Hoare triple {3735#(and (<= main_~x~0 17) (<= 17 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3736#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:17:54,635 INFO L273 TraceCheckUtils]: 59: Hoare triple {3736#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3736#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:17:54,644 INFO L273 TraceCheckUtils]: 60: Hoare triple {3736#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {3736#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:17:54,659 INFO L273 TraceCheckUtils]: 61: Hoare triple {3736#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3737#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:17:54,668 INFO L273 TraceCheckUtils]: 62: Hoare triple {3737#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3737#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:17:54,671 INFO L273 TraceCheckUtils]: 63: Hoare triple {3737#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {3737#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:17:54,671 INFO L273 TraceCheckUtils]: 64: Hoare triple {3737#(and (<= main_~x~0 19) (<= 19 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3738#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} is VALID [2018-11-23 13:17:54,688 INFO L273 TraceCheckUtils]: 65: Hoare triple {3738#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3738#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} is VALID [2018-11-23 13:17:54,697 INFO L273 TraceCheckUtils]: 66: Hoare triple {3738#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {3717#false} is VALID [2018-11-23 13:17:54,697 INFO L273 TraceCheckUtils]: 67: Hoare triple {3717#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3717#false} is VALID [2018-11-23 13:17:54,697 INFO L273 TraceCheckUtils]: 68: Hoare triple {3717#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {3717#false} is VALID [2018-11-23 13:17:54,698 INFO L256 TraceCheckUtils]: 69: Hoare triple {3717#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {3717#false} is VALID [2018-11-23 13:17:54,698 INFO L273 TraceCheckUtils]: 70: Hoare triple {3717#false} ~cond := #in~cond; {3717#false} is VALID [2018-11-23 13:17:54,698 INFO L273 TraceCheckUtils]: 71: Hoare triple {3717#false} assume 0 == ~cond; {3717#false} is VALID [2018-11-23 13:17:54,698 INFO L273 TraceCheckUtils]: 72: Hoare triple {3717#false} assume !false; {3717#false} is VALID [2018-11-23 13:17:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:17:54,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:17:54,708 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:17:54,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:17:54,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 13:17:54,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:17:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:54,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:17:55,083 INFO L256 TraceCheckUtils]: 0: Hoare triple {3716#true} call ULTIMATE.init(); {3716#true} is VALID [2018-11-23 13:17:55,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {3716#true} assume true; {3716#true} is VALID [2018-11-23 13:17:55,084 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3716#true} {3716#true} #39#return; {3716#true} is VALID [2018-11-23 13:17:55,084 INFO L256 TraceCheckUtils]: 3: Hoare triple {3716#true} call #t~ret2 := main(); {3716#true} is VALID [2018-11-23 13:17:55,085 INFO L273 TraceCheckUtils]: 4: Hoare triple {3716#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,086 INFO L273 TraceCheckUtils]: 5: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,087 INFO L273 TraceCheckUtils]: 8: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,088 INFO L273 TraceCheckUtils]: 10: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,089 INFO L273 TraceCheckUtils]: 11: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,090 INFO L273 TraceCheckUtils]: 13: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,091 INFO L273 TraceCheckUtils]: 14: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,091 INFO L273 TraceCheckUtils]: 15: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,092 INFO L273 TraceCheckUtils]: 16: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,093 INFO L273 TraceCheckUtils]: 17: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,093 INFO L273 TraceCheckUtils]: 18: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,094 INFO L273 TraceCheckUtils]: 19: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,095 INFO L273 TraceCheckUtils]: 20: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,096 INFO L273 TraceCheckUtils]: 21: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,096 INFO L273 TraceCheckUtils]: 22: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,097 INFO L273 TraceCheckUtils]: 23: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,098 INFO L273 TraceCheckUtils]: 24: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,098 INFO L273 TraceCheckUtils]: 25: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,119 INFO L273 TraceCheckUtils]: 26: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,134 INFO L273 TraceCheckUtils]: 27: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,143 INFO L273 TraceCheckUtils]: 28: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,156 INFO L273 TraceCheckUtils]: 29: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,165 INFO L273 TraceCheckUtils]: 30: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,177 INFO L273 TraceCheckUtils]: 31: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,186 INFO L273 TraceCheckUtils]: 32: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,199 INFO L273 TraceCheckUtils]: 33: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,207 INFO L273 TraceCheckUtils]: 34: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,221 INFO L273 TraceCheckUtils]: 35: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,234 INFO L273 TraceCheckUtils]: 36: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,242 INFO L273 TraceCheckUtils]: 37: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,246 INFO L273 TraceCheckUtils]: 38: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,255 INFO L273 TraceCheckUtils]: 39: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,268 INFO L273 TraceCheckUtils]: 40: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,281 INFO L273 TraceCheckUtils]: 41: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,290 INFO L273 TraceCheckUtils]: 42: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,302 INFO L273 TraceCheckUtils]: 43: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,311 INFO L273 TraceCheckUtils]: 44: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,323 INFO L273 TraceCheckUtils]: 45: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,336 INFO L273 TraceCheckUtils]: 46: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,348 INFO L273 TraceCheckUtils]: 47: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,361 INFO L273 TraceCheckUtils]: 48: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,373 INFO L273 TraceCheckUtils]: 49: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,386 INFO L273 TraceCheckUtils]: 50: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,400 INFO L273 TraceCheckUtils]: 51: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,408 INFO L273 TraceCheckUtils]: 52: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,424 INFO L273 TraceCheckUtils]: 53: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,433 INFO L273 TraceCheckUtils]: 54: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,445 INFO L273 TraceCheckUtils]: 55: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,458 INFO L273 TraceCheckUtils]: 56: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,463 INFO L273 TraceCheckUtils]: 57: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !(~x~0 % 4294967296 >= 5000000); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,471 INFO L273 TraceCheckUtils]: 58: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,484 INFO L273 TraceCheckUtils]: 59: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} is VALID [2018-11-23 13:17:55,498 INFO L273 TraceCheckUtils]: 60: Hoare triple {3754#(and (= 10000000 main_~y~0) (= main_~z~0 5000000))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {3923#(and (= main_~z~0 5000001) (= 10000000 main_~y~0))} is VALID [2018-11-23 13:17:55,507 INFO L273 TraceCheckUtils]: 61: Hoare triple {3923#(and (= main_~z~0 5000001) (= 10000000 main_~y~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3923#(and (= main_~z~0 5000001) (= 10000000 main_~y~0))} is VALID [2018-11-23 13:17:55,519 INFO L273 TraceCheckUtils]: 62: Hoare triple {3923#(and (= main_~z~0 5000001) (= 10000000 main_~y~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3923#(and (= main_~z~0 5000001) (= 10000000 main_~y~0))} is VALID [2018-11-23 13:17:55,532 INFO L273 TraceCheckUtils]: 63: Hoare triple {3923#(and (= main_~z~0 5000001) (= 10000000 main_~y~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {3933#(and (= 10000000 main_~y~0) (= main_~z~0 5000002))} is VALID [2018-11-23 13:17:55,543 INFO L273 TraceCheckUtils]: 64: Hoare triple {3933#(and (= 10000000 main_~y~0) (= main_~z~0 5000002))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3933#(and (= 10000000 main_~y~0) (= main_~z~0 5000002))} is VALID [2018-11-23 13:17:55,544 INFO L273 TraceCheckUtils]: 65: Hoare triple {3933#(and (= 10000000 main_~y~0) (= main_~z~0 5000002))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3933#(and (= 10000000 main_~y~0) (= main_~z~0 5000002))} is VALID [2018-11-23 13:17:55,544 INFO L273 TraceCheckUtils]: 66: Hoare triple {3933#(and (= 10000000 main_~y~0) (= main_~z~0 5000002))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {3943#(and (= 10000000 main_~y~0) (= main_~z~0 5000003))} is VALID [2018-11-23 13:17:55,544 INFO L273 TraceCheckUtils]: 67: Hoare triple {3943#(and (= 10000000 main_~y~0) (= main_~z~0 5000003))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3943#(and (= 10000000 main_~y~0) (= main_~z~0 5000003))} is VALID [2018-11-23 13:17:55,545 INFO L273 TraceCheckUtils]: 68: Hoare triple {3943#(and (= 10000000 main_~y~0) (= main_~z~0 5000003))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {3950#(and (<= 10000000 (mod main_~x~0 4294967296)) (= main_~z~0 5000003))} is VALID [2018-11-23 13:17:55,546 INFO L256 TraceCheckUtils]: 69: Hoare triple {3950#(and (<= 10000000 (mod main_~x~0 4294967296)) (= main_~z~0 5000003))} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {3954#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:17:55,546 INFO L273 TraceCheckUtils]: 70: Hoare triple {3954#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3958#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:17:55,546 INFO L273 TraceCheckUtils]: 71: Hoare triple {3958#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3717#false} is VALID [2018-11-23 13:17:55,547 INFO L273 TraceCheckUtils]: 72: Hoare triple {3717#false} assume !false; {3717#false} is VALID [2018-11-23 13:17:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-23 13:17:55,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:17:55,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 9] total 30 [2018-11-23 13:17:55,576 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 73 [2018-11-23 13:17:55,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:17:55,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 13:17:55,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:55,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 13:17:55,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 13:17:55,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:17:55,679 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 30 states. [2018-11-23 13:18:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:02,008 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-11-23 13:18:02,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 13:18:02,008 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 73 [2018-11-23 13:18:02,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:18:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 13:18:02,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:18:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2018-11-23 13:18:02,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 109 transitions. [2018-11-23 13:18:02,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:18:02,150 INFO L225 Difference]: With dead ends: 105 [2018-11-23 13:18:02,150 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 13:18:02,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=209, Invalid=2547, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 13:18:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 13:18:02,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-11-23 13:18:02,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:18:02,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 87 states. [2018-11-23 13:18:02,219 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 87 states. [2018-11-23 13:18:02,219 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 87 states. [2018-11-23 13:18:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:02,222 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-11-23 13:18:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-11-23 13:18:02,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:02,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:02,223 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 88 states. [2018-11-23 13:18:02,223 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 88 states. [2018-11-23 13:18:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:02,225 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-11-23 13:18:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-11-23 13:18:02,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:02,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:02,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:18:02,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:18:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 13:18:02,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-11-23 13:18:02,228 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 73 [2018-11-23 13:18:02,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:02,228 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-11-23 13:18:02,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 13:18:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-11-23 13:18:02,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 13:18:02,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:02,229 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 21, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:02,230 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:18:02,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:02,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1781940073, now seen corresponding path program 10 times [2018-11-23 13:18:02,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:02,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:02,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:02,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:18:02,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:03,331 INFO L256 TraceCheckUtils]: 0: Hoare triple {4449#true} call ULTIMATE.init(); {4449#true} is VALID [2018-11-23 13:18:03,331 INFO L273 TraceCheckUtils]: 1: Hoare triple {4449#true} assume true; {4449#true} is VALID [2018-11-23 13:18:03,331 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4449#true} {4449#true} #39#return; {4449#true} is VALID [2018-11-23 13:18:03,332 INFO L256 TraceCheckUtils]: 3: Hoare triple {4449#true} call #t~ret2 := main(); {4449#true} is VALID [2018-11-23 13:18:03,332 INFO L273 TraceCheckUtils]: 4: Hoare triple {4449#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {4451#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:03,333 INFO L273 TraceCheckUtils]: 5: Hoare triple {4451#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4451#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:03,333 INFO L273 TraceCheckUtils]: 6: Hoare triple {4451#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4451#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:03,334 INFO L273 TraceCheckUtils]: 7: Hoare triple {4451#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4452#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:03,334 INFO L273 TraceCheckUtils]: 8: Hoare triple {4452#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4452#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:03,335 INFO L273 TraceCheckUtils]: 9: Hoare triple {4452#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4452#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:03,335 INFO L273 TraceCheckUtils]: 10: Hoare triple {4452#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4453#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:03,336 INFO L273 TraceCheckUtils]: 11: Hoare triple {4453#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4453#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:03,337 INFO L273 TraceCheckUtils]: 12: Hoare triple {4453#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {4453#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:03,337 INFO L273 TraceCheckUtils]: 13: Hoare triple {4453#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4454#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:03,338 INFO L273 TraceCheckUtils]: 14: Hoare triple {4454#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4454#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:03,339 INFO L273 TraceCheckUtils]: 15: Hoare triple {4454#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4454#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:03,340 INFO L273 TraceCheckUtils]: 16: Hoare triple {4454#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4455#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:03,340 INFO L273 TraceCheckUtils]: 17: Hoare triple {4455#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4455#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:03,341 INFO L273 TraceCheckUtils]: 18: Hoare triple {4455#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {4455#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:03,342 INFO L273 TraceCheckUtils]: 19: Hoare triple {4455#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4456#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:03,343 INFO L273 TraceCheckUtils]: 20: Hoare triple {4456#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4456#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:03,343 INFO L273 TraceCheckUtils]: 21: Hoare triple {4456#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {4456#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:03,344 INFO L273 TraceCheckUtils]: 22: Hoare triple {4456#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4457#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:03,345 INFO L273 TraceCheckUtils]: 23: Hoare triple {4457#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4457#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:03,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {4457#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4457#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:03,346 INFO L273 TraceCheckUtils]: 25: Hoare triple {4457#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4458#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:03,347 INFO L273 TraceCheckUtils]: 26: Hoare triple {4458#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4458#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:03,348 INFO L273 TraceCheckUtils]: 27: Hoare triple {4458#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4458#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:03,348 INFO L273 TraceCheckUtils]: 28: Hoare triple {4458#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:03,349 INFO L273 TraceCheckUtils]: 29: Hoare triple {4459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:03,350 INFO L273 TraceCheckUtils]: 30: Hoare triple {4459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {4459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:03,351 INFO L273 TraceCheckUtils]: 31: Hoare triple {4459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4460#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:03,351 INFO L273 TraceCheckUtils]: 32: Hoare triple {4460#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4460#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:03,352 INFO L273 TraceCheckUtils]: 33: Hoare triple {4460#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {4460#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:03,353 INFO L273 TraceCheckUtils]: 34: Hoare triple {4460#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4461#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:03,353 INFO L273 TraceCheckUtils]: 35: Hoare triple {4461#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4461#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:03,354 INFO L273 TraceCheckUtils]: 36: Hoare triple {4461#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4461#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:03,355 INFO L273 TraceCheckUtils]: 37: Hoare triple {4461#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4462#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:03,356 INFO L273 TraceCheckUtils]: 38: Hoare triple {4462#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4462#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:03,356 INFO L273 TraceCheckUtils]: 39: Hoare triple {4462#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !(~x~0 % 4294967296 >= 5000000); {4462#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:03,357 INFO L273 TraceCheckUtils]: 40: Hoare triple {4462#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4463#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:03,358 INFO L273 TraceCheckUtils]: 41: Hoare triple {4463#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4463#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:03,359 INFO L273 TraceCheckUtils]: 42: Hoare triple {4463#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4463#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:03,359 INFO L273 TraceCheckUtils]: 43: Hoare triple {4463#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4464#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:03,360 INFO L273 TraceCheckUtils]: 44: Hoare triple {4464#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4464#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:03,361 INFO L273 TraceCheckUtils]: 45: Hoare triple {4464#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4464#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:03,377 INFO L273 TraceCheckUtils]: 46: Hoare triple {4464#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4465#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:03,377 INFO L273 TraceCheckUtils]: 47: Hoare triple {4465#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4465#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:03,378 INFO L273 TraceCheckUtils]: 48: Hoare triple {4465#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4465#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:03,378 INFO L273 TraceCheckUtils]: 49: Hoare triple {4465#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4466#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:03,378 INFO L273 TraceCheckUtils]: 50: Hoare triple {4466#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4466#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:03,379 INFO L273 TraceCheckUtils]: 51: Hoare triple {4466#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 >= 5000000); {4466#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:03,379 INFO L273 TraceCheckUtils]: 52: Hoare triple {4466#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4467#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:03,380 INFO L273 TraceCheckUtils]: 53: Hoare triple {4467#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4467#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:03,381 INFO L273 TraceCheckUtils]: 54: Hoare triple {4467#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4467#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:03,382 INFO L273 TraceCheckUtils]: 55: Hoare triple {4467#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4468#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:03,382 INFO L273 TraceCheckUtils]: 56: Hoare triple {4468#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4468#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:03,383 INFO L273 TraceCheckUtils]: 57: Hoare triple {4468#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4468#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:03,384 INFO L273 TraceCheckUtils]: 58: Hoare triple {4468#(and (<= main_~x~0 17) (<= 17 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4469#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:03,385 INFO L273 TraceCheckUtils]: 59: Hoare triple {4469#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4469#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:03,385 INFO L273 TraceCheckUtils]: 60: Hoare triple {4469#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4469#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:03,386 INFO L273 TraceCheckUtils]: 61: Hoare triple {4469#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4470#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:03,387 INFO L273 TraceCheckUtils]: 62: Hoare triple {4470#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4470#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:03,387 INFO L273 TraceCheckUtils]: 63: Hoare triple {4470#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4470#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:03,388 INFO L273 TraceCheckUtils]: 64: Hoare triple {4470#(and (<= main_~x~0 19) (<= 19 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4471#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:03,389 INFO L273 TraceCheckUtils]: 65: Hoare triple {4471#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4471#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:03,390 INFO L273 TraceCheckUtils]: 66: Hoare triple {4471#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 >= 5000000); {4471#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:03,390 INFO L273 TraceCheckUtils]: 67: Hoare triple {4471#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4472#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:03,391 INFO L273 TraceCheckUtils]: 68: Hoare triple {4472#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4472#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:03,392 INFO L273 TraceCheckUtils]: 69: Hoare triple {4472#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {4472#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:03,393 INFO L273 TraceCheckUtils]: 70: Hoare triple {4472#(and (<= 21 main_~x~0) (<= main_~x~0 21))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4473#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:03,393 INFO L273 TraceCheckUtils]: 71: Hoare triple {4473#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4473#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:03,394 INFO L273 TraceCheckUtils]: 72: Hoare triple {4473#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {4473#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:03,395 INFO L273 TraceCheckUtils]: 73: Hoare triple {4473#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4474#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-23 13:18:03,396 INFO L273 TraceCheckUtils]: 74: Hoare triple {4474#(and (<= main_~x~0 23) (<= 23 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4474#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-23 13:18:03,396 INFO L273 TraceCheckUtils]: 75: Hoare triple {4474#(and (<= main_~x~0 23) (<= 23 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {4474#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-23 13:18:03,397 INFO L273 TraceCheckUtils]: 76: Hoare triple {4474#(and (<= main_~x~0 23) (<= 23 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4475#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:18:03,398 INFO L273 TraceCheckUtils]: 77: Hoare triple {4475#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4475#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:18:03,399 INFO L273 TraceCheckUtils]: 78: Hoare triple {4475#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {4450#false} is VALID [2018-11-23 13:18:03,399 INFO L273 TraceCheckUtils]: 79: Hoare triple {4450#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4450#false} is VALID [2018-11-23 13:18:03,399 INFO L273 TraceCheckUtils]: 80: Hoare triple {4450#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {4450#false} is VALID [2018-11-23 13:18:03,400 INFO L256 TraceCheckUtils]: 81: Hoare triple {4450#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {4450#false} is VALID [2018-11-23 13:18:03,400 INFO L273 TraceCheckUtils]: 82: Hoare triple {4450#false} ~cond := #in~cond; {4450#false} is VALID [2018-11-23 13:18:03,400 INFO L273 TraceCheckUtils]: 83: Hoare triple {4450#false} assume 0 == ~cond; {4450#false} is VALID [2018-11-23 13:18:03,401 INFO L273 TraceCheckUtils]: 84: Hoare triple {4450#false} assume !false; {4450#false} is VALID [2018-11-23 13:18:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 49 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:18:03,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:18:03,412 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:18:03,423 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:18:03,444 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:18:03,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:18:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:03,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:18:03,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {4449#true} call ULTIMATE.init(); {4449#true} is VALID [2018-11-23 13:18:03,658 INFO L273 TraceCheckUtils]: 1: Hoare triple {4449#true} assume true; {4449#true} is VALID [2018-11-23 13:18:03,658 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4449#true} {4449#true} #39#return; {4449#true} is VALID [2018-11-23 13:18:03,658 INFO L256 TraceCheckUtils]: 3: Hoare triple {4449#true} call #t~ret2 := main(); {4449#true} is VALID [2018-11-23 13:18:03,659 INFO L273 TraceCheckUtils]: 4: Hoare triple {4449#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {4451#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:03,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {4451#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4451#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:03,660 INFO L273 TraceCheckUtils]: 6: Hoare triple {4451#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4451#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:03,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {4451#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4452#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:03,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {4452#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4452#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:03,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {4452#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4452#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:03,662 INFO L273 TraceCheckUtils]: 10: Hoare triple {4452#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4453#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:03,662 INFO L273 TraceCheckUtils]: 11: Hoare triple {4453#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4453#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:03,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {4453#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {4453#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:03,664 INFO L273 TraceCheckUtils]: 13: Hoare triple {4453#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4454#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:03,665 INFO L273 TraceCheckUtils]: 14: Hoare triple {4454#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4454#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:03,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {4454#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4454#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:03,666 INFO L273 TraceCheckUtils]: 16: Hoare triple {4454#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4455#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:03,667 INFO L273 TraceCheckUtils]: 17: Hoare triple {4455#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4455#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:03,668 INFO L273 TraceCheckUtils]: 18: Hoare triple {4455#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {4455#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:03,668 INFO L273 TraceCheckUtils]: 19: Hoare triple {4455#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4456#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:03,669 INFO L273 TraceCheckUtils]: 20: Hoare triple {4456#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4456#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:03,670 INFO L273 TraceCheckUtils]: 21: Hoare triple {4456#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {4456#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:03,671 INFO L273 TraceCheckUtils]: 22: Hoare triple {4456#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4457#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:03,671 INFO L273 TraceCheckUtils]: 23: Hoare triple {4457#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4457#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:03,672 INFO L273 TraceCheckUtils]: 24: Hoare triple {4457#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4457#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:03,673 INFO L273 TraceCheckUtils]: 25: Hoare triple {4457#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4458#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:03,673 INFO L273 TraceCheckUtils]: 26: Hoare triple {4458#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4458#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:03,674 INFO L273 TraceCheckUtils]: 27: Hoare triple {4458#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4458#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:03,675 INFO L273 TraceCheckUtils]: 28: Hoare triple {4458#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:03,676 INFO L273 TraceCheckUtils]: 29: Hoare triple {4459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:03,676 INFO L273 TraceCheckUtils]: 30: Hoare triple {4459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {4459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:03,677 INFO L273 TraceCheckUtils]: 31: Hoare triple {4459#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4460#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:03,678 INFO L273 TraceCheckUtils]: 32: Hoare triple {4460#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4460#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:03,678 INFO L273 TraceCheckUtils]: 33: Hoare triple {4460#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {4460#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:03,679 INFO L273 TraceCheckUtils]: 34: Hoare triple {4460#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4461#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:03,680 INFO L273 TraceCheckUtils]: 35: Hoare triple {4461#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4461#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:03,681 INFO L273 TraceCheckUtils]: 36: Hoare triple {4461#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4461#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:03,681 INFO L273 TraceCheckUtils]: 37: Hoare triple {4461#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4462#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:03,682 INFO L273 TraceCheckUtils]: 38: Hoare triple {4462#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4462#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:03,683 INFO L273 TraceCheckUtils]: 39: Hoare triple {4462#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !(~x~0 % 4294967296 >= 5000000); {4462#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:03,684 INFO L273 TraceCheckUtils]: 40: Hoare triple {4462#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4463#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:03,684 INFO L273 TraceCheckUtils]: 41: Hoare triple {4463#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4463#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:03,685 INFO L273 TraceCheckUtils]: 42: Hoare triple {4463#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4463#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:03,686 INFO L273 TraceCheckUtils]: 43: Hoare triple {4463#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4464#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:03,687 INFO L273 TraceCheckUtils]: 44: Hoare triple {4464#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4464#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:03,687 INFO L273 TraceCheckUtils]: 45: Hoare triple {4464#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4464#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:03,688 INFO L273 TraceCheckUtils]: 46: Hoare triple {4464#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4465#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:03,689 INFO L273 TraceCheckUtils]: 47: Hoare triple {4465#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4465#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:03,689 INFO L273 TraceCheckUtils]: 48: Hoare triple {4465#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4465#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:03,690 INFO L273 TraceCheckUtils]: 49: Hoare triple {4465#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4466#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:03,691 INFO L273 TraceCheckUtils]: 50: Hoare triple {4466#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4466#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:03,692 INFO L273 TraceCheckUtils]: 51: Hoare triple {4466#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 >= 5000000); {4466#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:03,692 INFO L273 TraceCheckUtils]: 52: Hoare triple {4466#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4467#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:03,693 INFO L273 TraceCheckUtils]: 53: Hoare triple {4467#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4467#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:03,694 INFO L273 TraceCheckUtils]: 54: Hoare triple {4467#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4467#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:03,695 INFO L273 TraceCheckUtils]: 55: Hoare triple {4467#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4468#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:03,695 INFO L273 TraceCheckUtils]: 56: Hoare triple {4468#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4468#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:03,696 INFO L273 TraceCheckUtils]: 57: Hoare triple {4468#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4468#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:03,697 INFO L273 TraceCheckUtils]: 58: Hoare triple {4468#(and (<= main_~x~0 17) (<= 17 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4469#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:03,697 INFO L273 TraceCheckUtils]: 59: Hoare triple {4469#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4469#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:03,698 INFO L273 TraceCheckUtils]: 60: Hoare triple {4469#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4469#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:03,699 INFO L273 TraceCheckUtils]: 61: Hoare triple {4469#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4470#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:03,700 INFO L273 TraceCheckUtils]: 62: Hoare triple {4470#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4470#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:03,700 INFO L273 TraceCheckUtils]: 63: Hoare triple {4470#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4470#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:03,701 INFO L273 TraceCheckUtils]: 64: Hoare triple {4470#(and (<= main_~x~0 19) (<= 19 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4471#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:03,702 INFO L273 TraceCheckUtils]: 65: Hoare triple {4471#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4471#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:03,703 INFO L273 TraceCheckUtils]: 66: Hoare triple {4471#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 >= 5000000); {4471#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:03,703 INFO L273 TraceCheckUtils]: 67: Hoare triple {4471#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4472#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:03,704 INFO L273 TraceCheckUtils]: 68: Hoare triple {4472#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4472#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:03,705 INFO L273 TraceCheckUtils]: 69: Hoare triple {4472#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {4450#false} is VALID [2018-11-23 13:18:03,705 INFO L273 TraceCheckUtils]: 70: Hoare triple {4450#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4450#false} is VALID [2018-11-23 13:18:03,705 INFO L273 TraceCheckUtils]: 71: Hoare triple {4450#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4450#false} is VALID [2018-11-23 13:18:03,706 INFO L273 TraceCheckUtils]: 72: Hoare triple {4450#false} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {4450#false} is VALID [2018-11-23 13:18:03,706 INFO L273 TraceCheckUtils]: 73: Hoare triple {4450#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4450#false} is VALID [2018-11-23 13:18:03,706 INFO L273 TraceCheckUtils]: 74: Hoare triple {4450#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4450#false} is VALID [2018-11-23 13:18:03,706 INFO L273 TraceCheckUtils]: 75: Hoare triple {4450#false} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {4450#false} is VALID [2018-11-23 13:18:03,707 INFO L273 TraceCheckUtils]: 76: Hoare triple {4450#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4450#false} is VALID [2018-11-23 13:18:03,707 INFO L273 TraceCheckUtils]: 77: Hoare triple {4450#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4450#false} is VALID [2018-11-23 13:18:03,707 INFO L273 TraceCheckUtils]: 78: Hoare triple {4450#false} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {4450#false} is VALID [2018-11-23 13:18:03,707 INFO L273 TraceCheckUtils]: 79: Hoare triple {4450#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4450#false} is VALID [2018-11-23 13:18:03,707 INFO L273 TraceCheckUtils]: 80: Hoare triple {4450#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {4450#false} is VALID [2018-11-23 13:18:03,708 INFO L256 TraceCheckUtils]: 81: Hoare triple {4450#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {4450#false} is VALID [2018-11-23 13:18:03,708 INFO L273 TraceCheckUtils]: 82: Hoare triple {4450#false} ~cond := #in~cond; {4450#false} is VALID [2018-11-23 13:18:03,708 INFO L273 TraceCheckUtils]: 83: Hoare triple {4450#false} assume 0 == ~cond; {4450#false} is VALID [2018-11-23 13:18:03,708 INFO L273 TraceCheckUtils]: 84: Hoare triple {4450#false} assume !false; {4450#false} is VALID [2018-11-23 13:18:03,717 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 238 proven. 672 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 13:18:03,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:18:03,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 27 [2018-11-23 13:18:03,736 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2018-11-23 13:18:03,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:18:03,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 13:18:03,832 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-23 13:18:03,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 13:18:03,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 13:18:03,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:18:03,833 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 27 states. [2018-11-23 13:18:08,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:08,096 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2018-11-23 13:18:08,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 13:18:08,096 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2018-11-23 13:18:08,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:18:08,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 102 transitions. [2018-11-23 13:18:08,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:18:08,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 102 transitions. [2018-11-23 13:18:08,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 102 transitions. [2018-11-23 13:18:08,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:18:08,263 INFO L225 Difference]: With dead ends: 117 [2018-11-23 13:18:08,263 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 13:18:08,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:18:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 13:18:08,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-11-23 13:18:08,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:18:08,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 99 states. [2018-11-23 13:18:08,353 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 99 states. [2018-11-23 13:18:08,353 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 99 states. [2018-11-23 13:18:08,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:08,356 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-11-23 13:18:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-11-23 13:18:08,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:08,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:08,357 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 100 states. [2018-11-23 13:18:08,357 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 100 states. [2018-11-23 13:18:08,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:08,359 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-11-23 13:18:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-11-23 13:18:08,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:08,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:08,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:18:08,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:18:08,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 13:18:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2018-11-23 13:18:08,362 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 85 [2018-11-23 13:18:08,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:08,362 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2018-11-23 13:18:08,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 13:18:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2018-11-23 13:18:08,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 13:18:08,364 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:08,364 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 25, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:08,364 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:18:08,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:08,364 INFO L82 PathProgramCache]: Analyzing trace with hash -847372329, now seen corresponding path program 11 times [2018-11-23 13:18:08,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:08,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:08,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:08,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:18:08,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:09,759 INFO L256 TraceCheckUtils]: 0: Hoare triple {5224#true} call ULTIMATE.init(); {5224#true} is VALID [2018-11-23 13:18:09,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {5224#true} assume true; {5224#true} is VALID [2018-11-23 13:18:09,760 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5224#true} {5224#true} #39#return; {5224#true} is VALID [2018-11-23 13:18:09,760 INFO L256 TraceCheckUtils]: 3: Hoare triple {5224#true} call #t~ret2 := main(); {5224#true} is VALID [2018-11-23 13:18:09,760 INFO L273 TraceCheckUtils]: 4: Hoare triple {5224#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {5226#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:09,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {5226#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5226#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:09,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {5226#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5226#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:09,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {5226#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5227#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:09,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {5227#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5227#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:09,763 INFO L273 TraceCheckUtils]: 9: Hoare triple {5227#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5227#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:09,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {5227#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5228#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:09,764 INFO L273 TraceCheckUtils]: 11: Hoare triple {5228#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5228#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:09,765 INFO L273 TraceCheckUtils]: 12: Hoare triple {5228#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {5228#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:09,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {5228#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5229#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:09,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {5229#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5229#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:09,767 INFO L273 TraceCheckUtils]: 15: Hoare triple {5229#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5229#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:09,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {5229#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5230#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:09,769 INFO L273 TraceCheckUtils]: 17: Hoare triple {5230#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5230#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:09,769 INFO L273 TraceCheckUtils]: 18: Hoare triple {5230#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {5230#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:09,770 INFO L273 TraceCheckUtils]: 19: Hoare triple {5230#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5231#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:09,771 INFO L273 TraceCheckUtils]: 20: Hoare triple {5231#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5231#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:09,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {5231#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {5231#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:09,772 INFO L273 TraceCheckUtils]: 22: Hoare triple {5231#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5232#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:09,773 INFO L273 TraceCheckUtils]: 23: Hoare triple {5232#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5232#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:09,774 INFO L273 TraceCheckUtils]: 24: Hoare triple {5232#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5232#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:09,775 INFO L273 TraceCheckUtils]: 25: Hoare triple {5232#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5233#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:09,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {5233#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5233#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:09,776 INFO L273 TraceCheckUtils]: 27: Hoare triple {5233#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5233#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:09,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {5233#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5234#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:09,778 INFO L273 TraceCheckUtils]: 29: Hoare triple {5234#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5234#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:09,778 INFO L273 TraceCheckUtils]: 30: Hoare triple {5234#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {5234#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:09,779 INFO L273 TraceCheckUtils]: 31: Hoare triple {5234#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5235#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:09,780 INFO L273 TraceCheckUtils]: 32: Hoare triple {5235#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5235#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:09,780 INFO L273 TraceCheckUtils]: 33: Hoare triple {5235#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 >= 5000000); {5235#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:09,781 INFO L273 TraceCheckUtils]: 34: Hoare triple {5235#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5236#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:09,782 INFO L273 TraceCheckUtils]: 35: Hoare triple {5236#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5236#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:09,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {5236#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5236#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:09,783 INFO L273 TraceCheckUtils]: 37: Hoare triple {5236#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5237#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:09,784 INFO L273 TraceCheckUtils]: 38: Hoare triple {5237#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5237#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:09,785 INFO L273 TraceCheckUtils]: 39: Hoare triple {5237#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !(~x~0 % 4294967296 >= 5000000); {5237#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:09,786 INFO L273 TraceCheckUtils]: 40: Hoare triple {5237#(and (<= 11 main_~x~0) (<= main_~x~0 11))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5238#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:09,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {5238#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5238#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:09,787 INFO L273 TraceCheckUtils]: 42: Hoare triple {5238#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5238#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:09,788 INFO L273 TraceCheckUtils]: 43: Hoare triple {5238#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5239#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:09,789 INFO L273 TraceCheckUtils]: 44: Hoare triple {5239#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5239#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:09,789 INFO L273 TraceCheckUtils]: 45: Hoare triple {5239#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5239#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:09,790 INFO L273 TraceCheckUtils]: 46: Hoare triple {5239#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5240#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:09,791 INFO L273 TraceCheckUtils]: 47: Hoare triple {5240#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5240#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:09,791 INFO L273 TraceCheckUtils]: 48: Hoare triple {5240#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5240#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:09,792 INFO L273 TraceCheckUtils]: 49: Hoare triple {5240#(and (<= main_~x~0 14) (<= 14 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5241#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:09,793 INFO L273 TraceCheckUtils]: 50: Hoare triple {5241#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5241#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:09,794 INFO L273 TraceCheckUtils]: 51: Hoare triple {5241#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 >= 5000000); {5241#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:09,794 INFO L273 TraceCheckUtils]: 52: Hoare triple {5241#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5242#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:09,795 INFO L273 TraceCheckUtils]: 53: Hoare triple {5242#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5242#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:09,796 INFO L273 TraceCheckUtils]: 54: Hoare triple {5242#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5242#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:09,797 INFO L273 TraceCheckUtils]: 55: Hoare triple {5242#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5243#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:09,797 INFO L273 TraceCheckUtils]: 56: Hoare triple {5243#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5243#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:09,798 INFO L273 TraceCheckUtils]: 57: Hoare triple {5243#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5243#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:09,799 INFO L273 TraceCheckUtils]: 58: Hoare triple {5243#(and (<= main_~x~0 17) (<= 17 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5244#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:09,799 INFO L273 TraceCheckUtils]: 59: Hoare triple {5244#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5244#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:09,800 INFO L273 TraceCheckUtils]: 60: Hoare triple {5244#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5244#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:09,801 INFO L273 TraceCheckUtils]: 61: Hoare triple {5244#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5245#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:09,802 INFO L273 TraceCheckUtils]: 62: Hoare triple {5245#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5245#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:09,802 INFO L273 TraceCheckUtils]: 63: Hoare triple {5245#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5245#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:09,803 INFO L273 TraceCheckUtils]: 64: Hoare triple {5245#(and (<= main_~x~0 19) (<= 19 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5246#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:09,804 INFO L273 TraceCheckUtils]: 65: Hoare triple {5246#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5246#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:09,805 INFO L273 TraceCheckUtils]: 66: Hoare triple {5246#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 >= 5000000); {5246#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:09,805 INFO L273 TraceCheckUtils]: 67: Hoare triple {5246#(and (<= 20 main_~x~0) (<= main_~x~0 20))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5247#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:09,806 INFO L273 TraceCheckUtils]: 68: Hoare triple {5247#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5247#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:09,807 INFO L273 TraceCheckUtils]: 69: Hoare triple {5247#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !(~x~0 % 4294967296 >= 5000000); {5247#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:09,808 INFO L273 TraceCheckUtils]: 70: Hoare triple {5247#(and (<= 21 main_~x~0) (<= main_~x~0 21))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:09,808 INFO L273 TraceCheckUtils]: 71: Hoare triple {5248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:09,809 INFO L273 TraceCheckUtils]: 72: Hoare triple {5248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:09,810 INFO L273 TraceCheckUtils]: 73: Hoare triple {5248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5249#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-23 13:18:09,810 INFO L273 TraceCheckUtils]: 74: Hoare triple {5249#(and (<= main_~x~0 23) (<= 23 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5249#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-23 13:18:09,811 INFO L273 TraceCheckUtils]: 75: Hoare triple {5249#(and (<= main_~x~0 23) (<= 23 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5249#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-23 13:18:09,812 INFO L273 TraceCheckUtils]: 76: Hoare triple {5249#(and (<= main_~x~0 23) (<= 23 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5250#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:18:09,813 INFO L273 TraceCheckUtils]: 77: Hoare triple {5250#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5250#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:18:09,813 INFO L273 TraceCheckUtils]: 78: Hoare triple {5250#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5250#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:18:09,814 INFO L273 TraceCheckUtils]: 79: Hoare triple {5250#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5251#(and (<= 25 main_~x~0) (<= main_~x~0 25))} is VALID [2018-11-23 13:18:09,815 INFO L273 TraceCheckUtils]: 80: Hoare triple {5251#(and (<= 25 main_~x~0) (<= main_~x~0 25))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5251#(and (<= 25 main_~x~0) (<= main_~x~0 25))} is VALID [2018-11-23 13:18:09,816 INFO L273 TraceCheckUtils]: 81: Hoare triple {5251#(and (<= 25 main_~x~0) (<= main_~x~0 25))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {5251#(and (<= 25 main_~x~0) (<= main_~x~0 25))} is VALID [2018-11-23 13:18:09,816 INFO L273 TraceCheckUtils]: 82: Hoare triple {5251#(and (<= 25 main_~x~0) (<= main_~x~0 25))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5252#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:18:09,817 INFO L273 TraceCheckUtils]: 83: Hoare triple {5252#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5252#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:18:09,818 INFO L273 TraceCheckUtils]: 84: Hoare triple {5252#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {5252#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:18:09,819 INFO L273 TraceCheckUtils]: 85: Hoare triple {5252#(and (<= main_~x~0 26) (<= 26 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5253#(and (<= main_~x~0 27) (<= 27 main_~x~0))} is VALID [2018-11-23 13:18:09,819 INFO L273 TraceCheckUtils]: 86: Hoare triple {5253#(and (<= main_~x~0 27) (<= 27 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5253#(and (<= main_~x~0 27) (<= 27 main_~x~0))} is VALID [2018-11-23 13:18:09,820 INFO L273 TraceCheckUtils]: 87: Hoare triple {5253#(and (<= main_~x~0 27) (<= 27 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {5253#(and (<= main_~x~0 27) (<= 27 main_~x~0))} is VALID [2018-11-23 13:18:09,821 INFO L273 TraceCheckUtils]: 88: Hoare triple {5253#(and (<= main_~x~0 27) (<= 27 main_~x~0))} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5254#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:18:09,822 INFO L273 TraceCheckUtils]: 89: Hoare triple {5254#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5254#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:18:09,823 INFO L273 TraceCheckUtils]: 90: Hoare triple {5254#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume ~x~0 % 4294967296 >= 5000000;#t~post0 := ~z~0;~z~0 := 1 + #t~post0;havoc #t~post0; {5225#false} is VALID [2018-11-23 13:18:09,823 INFO L273 TraceCheckUtils]: 91: Hoare triple {5225#false} #t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5225#false} is VALID [2018-11-23 13:18:09,823 INFO L273 TraceCheckUtils]: 92: Hoare triple {5225#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {5225#false} is VALID [2018-11-23 13:18:09,823 INFO L256 TraceCheckUtils]: 93: Hoare triple {5225#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {5225#false} is VALID [2018-11-23 13:18:09,824 INFO L273 TraceCheckUtils]: 94: Hoare triple {5225#false} ~cond := #in~cond; {5225#false} is VALID [2018-11-23 13:18:09,824 INFO L273 TraceCheckUtils]: 95: Hoare triple {5225#false} assume 0 == ~cond; {5225#false} is VALID [2018-11-23 13:18:09,824 INFO L273 TraceCheckUtils]: 96: Hoare triple {5225#false} assume !false; {5225#false} is VALID [2018-11-23 13:18:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 57 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:18:09,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:18:09,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:18:09,848 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1