java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum03_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:29:51,621 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:29:51,623 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:29:51,635 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:29:51,636 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:29:51,639 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:29:51,640 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:29:51,644 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:29:51,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:29:51,647 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:29:51,648 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:29:51,648 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:29:51,649 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:29:51,650 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:29:51,651 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:29:51,652 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:29:51,653 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:29:51,655 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:29:51,657 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:29:51,658 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:29:51,660 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:29:51,661 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:29:51,664 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:29:51,664 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:29:51,664 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:29:51,665 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:29:51,666 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:29:51,667 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:29:51,668 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:29:51,669 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:29:51,670 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:29:51,670 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:29:51,671 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:29:51,673 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:29:51,674 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:29:51,675 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:29:51,675 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:29:51,708 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:29:51,708 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:29:51,712 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:29:51,712 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:29:51,713 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:29:51,713 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:29:51,713 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:29:51,714 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:29:51,714 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:29:51,714 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:29:51,714 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:29:51,714 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:29:51,715 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:29:51,715 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:29:51,715 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:29:51,715 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:29:51,715 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:29:51,715 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:29:51,716 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:29:51,716 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:29:51,716 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:29:51,716 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:29:51,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:29:51,718 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:29:51,718 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:29:51,719 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:29:51,719 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:29:51,719 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:29:51,719 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:29:51,719 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:29:51,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:29:51,794 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:29:51,798 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:29:51,799 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:29:51,800 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:29:51,801 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum03_false-unreach-call_true-termination.i [2018-11-14 17:29:51,854 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8d1a86d/a680bb5b81dd4fc588b8a199430803ae/FLAG9748c161e [2018-11-14 17:29:52,335 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:29:52,336 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum03_false-unreach-call_true-termination.i [2018-11-14 17:29:52,343 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8d1a86d/a680bb5b81dd4fc588b8a199430803ae/FLAG9748c161e [2018-11-14 17:29:52,359 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c8d1a86d/a680bb5b81dd4fc588b8a199430803ae [2018-11-14 17:29:52,370 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:29:52,372 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:29:52,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:29:52,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:29:52,377 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:29:52,378 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:29:52" (1/1) ... [2018-11-14 17:29:52,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1747d2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:52, skipping insertion in model container [2018-11-14 17:29:52,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:29:52" (1/1) ... [2018-11-14 17:29:52,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:29:52,416 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:29:52,648 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:29:52,654 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:29:52,677 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:29:52,695 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:29:52,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:52 WrapperNode [2018-11-14 17:29:52,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:29:52,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:29:52,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:29:52,697 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:29:52,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:52" (1/1) ... [2018-11-14 17:29:52,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:52" (1/1) ... [2018-11-14 17:29:52,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:52" (1/1) ... [2018-11-14 17:29:52,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:52" (1/1) ... [2018-11-14 17:29:52,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:52" (1/1) ... [2018-11-14 17:29:52,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:52" (1/1) ... [2018-11-14 17:29:52,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:52" (1/1) ... [2018-11-14 17:29:52,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:29:52,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:29:52,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:29:52,736 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:29:52,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:29:52,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:29:52,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:29:52,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:29:52,870 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:29:52,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:29:52,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:29:52,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-14 17:29:52,871 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:29:52,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:29:52,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:29:53,279 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:29:53,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:29:53 BoogieIcfgContainer [2018-11-14 17:29:53,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:29:53,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:29:53,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:29:53,285 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:29:53,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:29:52" (1/3) ... [2018-11-14 17:29:53,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504159f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:29:53, skipping insertion in model container [2018-11-14 17:29:53,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:29:52" (2/3) ... [2018-11-14 17:29:53,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504159f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:29:53, skipping insertion in model container [2018-11-14 17:29:53,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:29:53" (3/3) ... [2018-11-14 17:29:53,289 INFO L112 eAbstractionObserver]: Analyzing ICFG sum03_false-unreach-call_true-termination.i [2018-11-14 17:29:53,300 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:29:53,309 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:29:53,328 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:29:53,363 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:29:53,364 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:29:53,364 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:29:53,364 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:29:53,364 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:29:53,364 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:29:53,364 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:29:53,365 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:29:53,365 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:29:53,385 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-14 17:29:53,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 17:29:53,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:53,397 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:29:53,400 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:53,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:53,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1231955355, now seen corresponding path program 1 times [2018-11-14 17:29:53,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:53,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:53,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:53,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:54,303 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-14 17:29:54,308 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-14 17:29:54,308 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #39#return; {23#true} is VALID [2018-11-14 17:29:54,309 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2018-11-14 17:29:54,310 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {25#(and (<= (* 2 main_~x~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~x~0)))} is VALID [2018-11-14 17:29:54,312 INFO L273 TraceCheckUtils]: 5: Hoare triple {25#(and (<= (* 2 main_~x~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~x~0)))} assume true; {25#(and (<= (* 2 main_~x~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~x~0)))} is VALID [2018-11-14 17:29:54,315 INFO L273 TraceCheckUtils]: 6: Hoare triple {25#(and (<= (* 2 main_~x~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~x~0)))} assume !false; {25#(and (<= (* 2 main_~x~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~x~0)))} is VALID [2018-11-14 17:29:54,317 INFO L273 TraceCheckUtils]: 7: Hoare triple {25#(and (<= (* 2 main_~x~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~x~0)))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {26#(and (<= (+ (* 2 main_~x~0) 2) main_~sn~0) (<= main_~sn~0 (+ (* 2 main_~x~0) 2)))} is VALID [2018-11-14 17:29:54,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {26#(and (<= (+ (* 2 main_~x~0) 2) main_~sn~0) (<= main_~sn~0 (+ (* 2 main_~x~0) 2)))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {25#(and (<= (* 2 main_~x~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~x~0)))} is VALID [2018-11-14 17:29:54,329 INFO L256 TraceCheckUtils]: 9: Hoare triple {25#(and (<= (* 2 main_~x~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~x~0)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {27#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:29:54,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {28#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:29:54,334 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {24#false} is VALID [2018-11-14 17:29:54,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-14 17:29:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:29:54,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:29:54,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 17:29:54,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-14 17:29:54,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:54,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:29:54,499 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-14 17:29:54,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:29:54,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:29:54,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:29:54,514 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 6 states. [2018-11-14 17:29:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:55,067 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2018-11-14 17:29:55,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:29:55,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-14 17:29:55,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:29:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:29:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-14 17:29:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:29:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2018-11-14 17:29:55,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 54 transitions. [2018-11-14 17:29:55,357 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-14 17:29:55,370 INFO L225 Difference]: With dead ends: 41 [2018-11-14 17:29:55,371 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 17:29:55,374 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:29:55,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 17:29:55,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-14 17:29:55,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:29:55,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-14 17:29:55,584 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-14 17:29:55,584 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-14 17:29:55,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:55,588 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-14 17:29:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-14 17:29:55,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:55,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:55,590 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-14 17:29:55,590 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-14 17:29:55,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:55,594 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-14 17:29:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-14 17:29:55,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:55,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:55,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:29:55,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:29:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:29:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-14 17:29:55,600 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2018-11-14 17:29:55,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:29:55,601 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-14 17:29:55,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:29:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 17:29:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 17:29:55,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:55,603 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:29:55,603 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:55,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:55,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1174697053, now seen corresponding path program 1 times [2018-11-14 17:29:55,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:55,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:55,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:55,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:55,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:55,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {174#true} is VALID [2018-11-14 17:29:55,717 INFO L273 TraceCheckUtils]: 1: Hoare triple {174#true} assume true; {174#true} is VALID [2018-11-14 17:29:55,717 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {174#true} {174#true} #39#return; {174#true} is VALID [2018-11-14 17:29:55,717 INFO L256 TraceCheckUtils]: 3: Hoare triple {174#true} call #t~ret3 := main(); {174#true} is VALID [2018-11-14 17:29:55,719 INFO L273 TraceCheckUtils]: 4: Hoare triple {174#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {176#(= main_~sn~0 0)} is VALID [2018-11-14 17:29:55,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {176#(= main_~sn~0 0)} assume true; {176#(= main_~sn~0 0)} is VALID [2018-11-14 17:29:55,724 INFO L273 TraceCheckUtils]: 6: Hoare triple {176#(= main_~sn~0 0)} assume !false; {176#(= main_~sn~0 0)} is VALID [2018-11-14 17:29:55,726 INFO L273 TraceCheckUtils]: 7: Hoare triple {176#(= main_~sn~0 0)} assume !(~x~0 % 4294967296 < 10); {176#(= main_~sn~0 0)} is VALID [2018-11-14 17:29:55,727 INFO L273 TraceCheckUtils]: 8: Hoare triple {176#(= main_~sn~0 0)} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {176#(= main_~sn~0 0)} is VALID [2018-11-14 17:29:55,728 INFO L256 TraceCheckUtils]: 9: Hoare triple {176#(= main_~sn~0 0)} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {177#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:29:55,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {177#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {178#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-14 17:29:55,736 INFO L273 TraceCheckUtils]: 11: Hoare triple {178#(= __VERIFIER_assert_~cond 1)} assume ~cond == 0; {175#false} is VALID [2018-11-14 17:29:55,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {175#false} assume !false; {175#false} is VALID [2018-11-14 17:29:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:29:55,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:29:55,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:29:55,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 17:29:55,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:55,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:29:55,756 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-14 17:29:55,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:29:55,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:29:55,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:29:55,758 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-11-14 17:29:55,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:55,949 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 17:29:55,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:29:55,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 17:29:55,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:29:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:29:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-14 17:29:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:29:55,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-14 17:29:55,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2018-11-14 17:29:56,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:56,013 INFO L225 Difference]: With dead ends: 39 [2018-11-14 17:29:56,013 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 17:29:56,014 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:29:56,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 17:29:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-14 17:29:56,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:29:56,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-14 17:29:56,049 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 17:29:56,049 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 17:29:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:56,053 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-14 17:29:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 17:29:56,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:56,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:56,055 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 17:29:56,055 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 17:29:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:56,058 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-14 17:29:56,059 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 17:29:56,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:56,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:56,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:29:56,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:29:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:29:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-14 17:29:56,063 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 13 [2018-11-14 17:29:56,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:29:56,064 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-14 17:29:56,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:29:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-14 17:29:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 17:29:56,065 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:56,065 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:29:56,065 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:56,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:56,066 INFO L82 PathProgramCache]: Analyzing trace with hash -494238111, now seen corresponding path program 1 times [2018-11-14 17:29:56,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:56,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:56,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:56,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:56,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:56,267 INFO L256 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {361#true} is VALID [2018-11-14 17:29:56,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {361#true} assume true; {361#true} is VALID [2018-11-14 17:29:56,267 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {361#true} {361#true} #39#return; {361#true} is VALID [2018-11-14 17:29:56,268 INFO L256 TraceCheckUtils]: 3: Hoare triple {361#true} call #t~ret3 := main(); {361#true} is VALID [2018-11-14 17:29:56,268 INFO L273 TraceCheckUtils]: 4: Hoare triple {361#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {363#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:56,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {363#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {363#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:56,270 INFO L273 TraceCheckUtils]: 6: Hoare triple {363#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {363#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:56,272 INFO L273 TraceCheckUtils]: 7: Hoare triple {363#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {363#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:56,273 INFO L273 TraceCheckUtils]: 8: Hoare triple {363#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {364#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:29:56,274 INFO L256 TraceCheckUtils]: 9: Hoare triple {364#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {361#true} is VALID [2018-11-14 17:29:56,274 INFO L273 TraceCheckUtils]: 10: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2018-11-14 17:29:56,274 INFO L273 TraceCheckUtils]: 11: Hoare triple {361#true} assume !(~cond == 0); {361#true} is VALID [2018-11-14 17:29:56,274 INFO L273 TraceCheckUtils]: 12: Hoare triple {361#true} assume true; {361#true} is VALID [2018-11-14 17:29:56,276 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {361#true} {364#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} #43#return; {364#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:29:56,276 INFO L273 TraceCheckUtils]: 14: Hoare triple {364#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {364#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:29:56,277 INFO L273 TraceCheckUtils]: 15: Hoare triple {364#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !false; {364#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:29:56,278 INFO L273 TraceCheckUtils]: 16: Hoare triple {364#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10); {362#false} is VALID [2018-11-14 17:29:56,278 INFO L273 TraceCheckUtils]: 17: Hoare triple {362#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {362#false} is VALID [2018-11-14 17:29:56,279 INFO L256 TraceCheckUtils]: 18: Hoare triple {362#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {362#false} is VALID [2018-11-14 17:29:56,279 INFO L273 TraceCheckUtils]: 19: Hoare triple {362#false} ~cond := #in~cond; {362#false} is VALID [2018-11-14 17:29:56,279 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#false} assume ~cond == 0; {362#false} is VALID [2018-11-14 17:29:56,280 INFO L273 TraceCheckUtils]: 21: Hoare triple {362#false} assume !false; {362#false} is VALID [2018-11-14 17:29:56,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:29:56,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:29:56,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:29:56,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:56,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:29:56,573 INFO L256 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {361#true} is VALID [2018-11-14 17:29:56,573 INFO L273 TraceCheckUtils]: 1: Hoare triple {361#true} assume true; {361#true} is VALID [2018-11-14 17:29:56,574 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {361#true} {361#true} #39#return; {361#true} is VALID [2018-11-14 17:29:56,574 INFO L256 TraceCheckUtils]: 3: Hoare triple {361#true} call #t~ret3 := main(); {361#true} is VALID [2018-11-14 17:29:56,577 INFO L273 TraceCheckUtils]: 4: Hoare triple {361#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {363#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:56,578 INFO L273 TraceCheckUtils]: 5: Hoare triple {363#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {363#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:56,579 INFO L273 TraceCheckUtils]: 6: Hoare triple {363#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {363#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:56,580 INFO L273 TraceCheckUtils]: 7: Hoare triple {363#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {363#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:56,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {363#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {392#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:56,581 INFO L256 TraceCheckUtils]: 9: Hoare triple {392#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {361#true} is VALID [2018-11-14 17:29:56,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {361#true} ~cond := #in~cond; {361#true} is VALID [2018-11-14 17:29:56,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {361#true} assume !(~cond == 0); {361#true} is VALID [2018-11-14 17:29:56,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {361#true} assume true; {361#true} is VALID [2018-11-14 17:29:56,583 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {361#true} {392#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {392#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:56,585 INFO L273 TraceCheckUtils]: 14: Hoare triple {392#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {392#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:56,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {392#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {392#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:56,588 INFO L273 TraceCheckUtils]: 16: Hoare triple {392#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 < 10); {362#false} is VALID [2018-11-14 17:29:56,588 INFO L273 TraceCheckUtils]: 17: Hoare triple {362#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {362#false} is VALID [2018-11-14 17:29:56,588 INFO L256 TraceCheckUtils]: 18: Hoare triple {362#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {362#false} is VALID [2018-11-14 17:29:56,588 INFO L273 TraceCheckUtils]: 19: Hoare triple {362#false} ~cond := #in~cond; {362#false} is VALID [2018-11-14 17:29:56,589 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#false} assume ~cond == 0; {362#false} is VALID [2018-11-14 17:29:56,589 INFO L273 TraceCheckUtils]: 21: Hoare triple {362#false} assume !false; {362#false} is VALID [2018-11-14 17:29:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:29:56,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:29:56,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 17:29:56,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 17:29:56,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:56,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:29:56,696 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-14 17:29:56,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:29:56,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:29:56,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:29:56,697 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-11-14 17:29:56,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:56,939 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-14 17:29:56,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:29:56,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-14 17:29:56,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:29:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:29:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-14 17:29:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:29:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-14 17:29:56,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2018-11-14 17:29:57,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:57,043 INFO L225 Difference]: With dead ends: 54 [2018-11-14 17:29:57,043 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 17:29:57,043 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:29:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 17:29:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-14 17:29:57,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:29:57,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-14 17:29:57,086 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-14 17:29:57,086 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-14 17:29:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:57,092 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 17:29:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 17:29:57,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:57,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:57,093 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-14 17:29:57,093 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-14 17:29:57,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:57,098 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 17:29:57,098 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 17:29:57,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:57,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:57,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:29:57,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:29:57,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:29:57,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-14 17:29:57,102 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 22 [2018-11-14 17:29:57,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:29:57,102 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-14 17:29:57,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:29:57,103 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 17:29:57,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:29:57,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:57,104 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:29:57,104 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:57,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:57,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2135506589, now seen corresponding path program 2 times [2018-11-14 17:29:57,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:57,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:57,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:57,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:29:57,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:57,356 INFO L256 TraceCheckUtils]: 0: Hoare triple {618#true} call ULTIMATE.init(); {618#true} is VALID [2018-11-14 17:29:57,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {618#true} assume true; {618#true} is VALID [2018-11-14 17:29:57,357 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {618#true} {618#true} #39#return; {618#true} is VALID [2018-11-14 17:29:57,357 INFO L256 TraceCheckUtils]: 3: Hoare triple {618#true} call #t~ret3 := main(); {618#true} is VALID [2018-11-14 17:29:57,358 INFO L273 TraceCheckUtils]: 4: Hoare triple {618#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {620#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:57,359 INFO L273 TraceCheckUtils]: 5: Hoare triple {620#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {620#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:57,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {620#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {620#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:57,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {620#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {620#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:57,361 INFO L273 TraceCheckUtils]: 8: Hoare triple {620#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:57,361 INFO L256 TraceCheckUtils]: 9: Hoare triple {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {618#true} is VALID [2018-11-14 17:29:57,361 INFO L273 TraceCheckUtils]: 10: Hoare triple {618#true} ~cond := #in~cond; {618#true} is VALID [2018-11-14 17:29:57,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {618#true} assume !(~cond == 0); {618#true} is VALID [2018-11-14 17:29:57,362 INFO L273 TraceCheckUtils]: 12: Hoare triple {618#true} assume true; {618#true} is VALID [2018-11-14 17:29:57,363 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {618#true} {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:57,364 INFO L273 TraceCheckUtils]: 14: Hoare triple {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:57,367 INFO L273 TraceCheckUtils]: 15: Hoare triple {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:57,368 INFO L273 TraceCheckUtils]: 16: Hoare triple {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:57,369 INFO L273 TraceCheckUtils]: 17: Hoare triple {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {622#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:29:57,370 INFO L256 TraceCheckUtils]: 18: Hoare triple {622#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {618#true} is VALID [2018-11-14 17:29:57,370 INFO L273 TraceCheckUtils]: 19: Hoare triple {618#true} ~cond := #in~cond; {618#true} is VALID [2018-11-14 17:29:57,370 INFO L273 TraceCheckUtils]: 20: Hoare triple {618#true} assume !(~cond == 0); {618#true} is VALID [2018-11-14 17:29:57,371 INFO L273 TraceCheckUtils]: 21: Hoare triple {618#true} assume true; {618#true} is VALID [2018-11-14 17:29:57,371 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {618#true} {622#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} #43#return; {622#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:29:57,372 INFO L273 TraceCheckUtils]: 23: Hoare triple {622#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {622#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:29:57,374 INFO L273 TraceCheckUtils]: 24: Hoare triple {622#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !false; {622#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:29:57,375 INFO L273 TraceCheckUtils]: 25: Hoare triple {622#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10); {619#false} is VALID [2018-11-14 17:29:57,375 INFO L273 TraceCheckUtils]: 26: Hoare triple {619#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {619#false} is VALID [2018-11-14 17:29:57,376 INFO L256 TraceCheckUtils]: 27: Hoare triple {619#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {619#false} is VALID [2018-11-14 17:29:57,376 INFO L273 TraceCheckUtils]: 28: Hoare triple {619#false} ~cond := #in~cond; {619#false} is VALID [2018-11-14 17:29:57,377 INFO L273 TraceCheckUtils]: 29: Hoare triple {619#false} assume ~cond == 0; {619#false} is VALID [2018-11-14 17:29:57,377 INFO L273 TraceCheckUtils]: 30: Hoare triple {619#false} assume !false; {619#false} is VALID [2018-11-14 17:29:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:29:57,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:29:57,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:29:57,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:29:57,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:29:57,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:29:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:57,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:29:57,649 INFO L256 TraceCheckUtils]: 0: Hoare triple {618#true} call ULTIMATE.init(); {618#true} is VALID [2018-11-14 17:29:57,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {618#true} assume true; {618#true} is VALID [2018-11-14 17:29:57,650 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {618#true} {618#true} #39#return; {618#true} is VALID [2018-11-14 17:29:57,650 INFO L256 TraceCheckUtils]: 3: Hoare triple {618#true} call #t~ret3 := main(); {618#true} is VALID [2018-11-14 17:29:57,655 INFO L273 TraceCheckUtils]: 4: Hoare triple {618#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {620#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:57,656 INFO L273 TraceCheckUtils]: 5: Hoare triple {620#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {620#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:57,656 INFO L273 TraceCheckUtils]: 6: Hoare triple {620#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {620#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:57,658 INFO L273 TraceCheckUtils]: 7: Hoare triple {620#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {620#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:57,659 INFO L273 TraceCheckUtils]: 8: Hoare triple {620#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:57,659 INFO L256 TraceCheckUtils]: 9: Hoare triple {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {618#true} is VALID [2018-11-14 17:29:57,659 INFO L273 TraceCheckUtils]: 10: Hoare triple {618#true} ~cond := #in~cond; {618#true} is VALID [2018-11-14 17:29:57,660 INFO L273 TraceCheckUtils]: 11: Hoare triple {618#true} assume !(~cond == 0); {618#true} is VALID [2018-11-14 17:29:57,660 INFO L273 TraceCheckUtils]: 12: Hoare triple {618#true} assume true; {618#true} is VALID [2018-11-14 17:29:57,662 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {618#true} {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:57,666 INFO L273 TraceCheckUtils]: 14: Hoare triple {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:57,666 INFO L273 TraceCheckUtils]: 15: Hoare triple {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:57,667 INFO L273 TraceCheckUtils]: 16: Hoare triple {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:57,668 INFO L273 TraceCheckUtils]: 17: Hoare triple {621#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:29:57,668 INFO L256 TraceCheckUtils]: 18: Hoare triple {677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {618#true} is VALID [2018-11-14 17:29:57,668 INFO L273 TraceCheckUtils]: 19: Hoare triple {618#true} ~cond := #in~cond; {618#true} is VALID [2018-11-14 17:29:57,668 INFO L273 TraceCheckUtils]: 20: Hoare triple {618#true} assume !(~cond == 0); {618#true} is VALID [2018-11-14 17:29:57,669 INFO L273 TraceCheckUtils]: 21: Hoare triple {618#true} assume true; {618#true} is VALID [2018-11-14 17:29:57,683 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {618#true} {677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #43#return; {677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:29:57,684 INFO L273 TraceCheckUtils]: 23: Hoare triple {677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:29:57,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:29:57,688 INFO L273 TraceCheckUtils]: 25: Hoare triple {677#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 10); {619#false} is VALID [2018-11-14 17:29:57,688 INFO L273 TraceCheckUtils]: 26: Hoare triple {619#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {619#false} is VALID [2018-11-14 17:29:57,688 INFO L256 TraceCheckUtils]: 27: Hoare triple {619#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {619#false} is VALID [2018-11-14 17:29:57,689 INFO L273 TraceCheckUtils]: 28: Hoare triple {619#false} ~cond := #in~cond; {619#false} is VALID [2018-11-14 17:29:57,689 INFO L273 TraceCheckUtils]: 29: Hoare triple {619#false} assume ~cond == 0; {619#false} is VALID [2018-11-14 17:29:57,689 INFO L273 TraceCheckUtils]: 30: Hoare triple {619#false} assume !false; {619#false} is VALID [2018-11-14 17:29:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:29:57,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:29:57,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 17:29:57,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-14 17:29:57,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:57,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:29:57,795 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:57,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:29:57,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:29:57,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:29:57,796 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 6 states. [2018-11-14 17:29:58,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:58,125 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-14 17:29:58,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:29:58,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-14 17:29:58,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:29:58,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:29:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-14 17:29:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:29:58,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-14 17:29:58,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2018-11-14 17:29:58,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:58,218 INFO L225 Difference]: With dead ends: 50 [2018-11-14 17:29:58,218 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 17:29:58,219 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:29:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 17:29:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-14 17:29:58,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:29:58,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-14 17:29:58,257 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-14 17:29:58,258 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-14 17:29:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:58,262 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 17:29:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 17:29:58,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:58,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:58,263 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-14 17:29:58,264 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-14 17:29:58,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:58,267 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 17:29:58,268 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 17:29:58,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:58,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:58,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:29:58,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:29:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:29:58,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-14 17:29:58,271 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 31 [2018-11-14 17:29:58,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:29:58,272 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-14 17:29:58,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:29:58,272 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 17:29:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 17:29:58,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:58,274 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:29:58,274 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:58,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:58,275 INFO L82 PathProgramCache]: Analyzing trace with hash -374355807, now seen corresponding path program 3 times [2018-11-14 17:29:58,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:58,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:58,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:58,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:29:58,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:58,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {915#true} call ULTIMATE.init(); {915#true} is VALID [2018-11-14 17:29:58,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {915#true} assume true; {915#true} is VALID [2018-11-14 17:29:58,578 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {915#true} {915#true} #39#return; {915#true} is VALID [2018-11-14 17:29:58,578 INFO L256 TraceCheckUtils]: 3: Hoare triple {915#true} call #t~ret3 := main(); {915#true} is VALID [2018-11-14 17:29:58,579 INFO L273 TraceCheckUtils]: 4: Hoare triple {915#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {917#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:58,580 INFO L273 TraceCheckUtils]: 5: Hoare triple {917#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {917#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:58,580 INFO L273 TraceCheckUtils]: 6: Hoare triple {917#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {917#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:58,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {917#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {917#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:58,582 INFO L273 TraceCheckUtils]: 8: Hoare triple {917#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:58,583 INFO L256 TraceCheckUtils]: 9: Hoare triple {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {915#true} is VALID [2018-11-14 17:29:58,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {915#true} ~cond := #in~cond; {915#true} is VALID [2018-11-14 17:29:58,583 INFO L273 TraceCheckUtils]: 11: Hoare triple {915#true} assume !(~cond == 0); {915#true} is VALID [2018-11-14 17:29:58,584 INFO L273 TraceCheckUtils]: 12: Hoare triple {915#true} assume true; {915#true} is VALID [2018-11-14 17:29:58,585 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {915#true} {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:58,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:58,588 INFO L273 TraceCheckUtils]: 15: Hoare triple {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:58,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:58,604 INFO L273 TraceCheckUtils]: 17: Hoare triple {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:29:58,604 INFO L256 TraceCheckUtils]: 18: Hoare triple {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {915#true} is VALID [2018-11-14 17:29:58,604 INFO L273 TraceCheckUtils]: 19: Hoare triple {915#true} ~cond := #in~cond; {915#true} is VALID [2018-11-14 17:29:58,604 INFO L273 TraceCheckUtils]: 20: Hoare triple {915#true} assume !(~cond == 0); {915#true} is VALID [2018-11-14 17:29:58,604 INFO L273 TraceCheckUtils]: 21: Hoare triple {915#true} assume true; {915#true} is VALID [2018-11-14 17:29:58,606 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {915#true} {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #43#return; {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:29:58,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:29:58,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:29:58,608 INFO L273 TraceCheckUtils]: 25: Hoare triple {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:29:58,612 INFO L273 TraceCheckUtils]: 26: Hoare triple {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {920#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:29:58,612 INFO L256 TraceCheckUtils]: 27: Hoare triple {920#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {915#true} is VALID [2018-11-14 17:29:58,612 INFO L273 TraceCheckUtils]: 28: Hoare triple {915#true} ~cond := #in~cond; {915#true} is VALID [2018-11-14 17:29:58,613 INFO L273 TraceCheckUtils]: 29: Hoare triple {915#true} assume !(~cond == 0); {915#true} is VALID [2018-11-14 17:29:58,613 INFO L273 TraceCheckUtils]: 30: Hoare triple {915#true} assume true; {915#true} is VALID [2018-11-14 17:29:58,614 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {915#true} {920#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} #43#return; {920#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:29:58,614 INFO L273 TraceCheckUtils]: 32: Hoare triple {920#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {920#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:29:58,615 INFO L273 TraceCheckUtils]: 33: Hoare triple {920#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !false; {920#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:29:58,615 INFO L273 TraceCheckUtils]: 34: Hoare triple {920#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10); {916#false} is VALID [2018-11-14 17:29:58,616 INFO L273 TraceCheckUtils]: 35: Hoare triple {916#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {916#false} is VALID [2018-11-14 17:29:58,616 INFO L256 TraceCheckUtils]: 36: Hoare triple {916#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {916#false} is VALID [2018-11-14 17:29:58,616 INFO L273 TraceCheckUtils]: 37: Hoare triple {916#false} ~cond := #in~cond; {916#false} is VALID [2018-11-14 17:29:58,616 INFO L273 TraceCheckUtils]: 38: Hoare triple {916#false} assume ~cond == 0; {916#false} is VALID [2018-11-14 17:29:58,617 INFO L273 TraceCheckUtils]: 39: Hoare triple {916#false} assume !false; {916#false} is VALID [2018-11-14 17:29:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 17:29:58,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:29:58,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:29:58,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:29:58,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 17:29:58,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:29:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:29:58,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:29:59,195 INFO L256 TraceCheckUtils]: 0: Hoare triple {915#true} call ULTIMATE.init(); {915#true} is VALID [2018-11-14 17:29:59,195 INFO L273 TraceCheckUtils]: 1: Hoare triple {915#true} assume true; {915#true} is VALID [2018-11-14 17:29:59,196 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {915#true} {915#true} #39#return; {915#true} is VALID [2018-11-14 17:29:59,196 INFO L256 TraceCheckUtils]: 3: Hoare triple {915#true} call #t~ret3 := main(); {915#true} is VALID [2018-11-14 17:29:59,196 INFO L273 TraceCheckUtils]: 4: Hoare triple {915#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {917#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:59,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {917#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {917#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:59,197 INFO L273 TraceCheckUtils]: 6: Hoare triple {917#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {917#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:59,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {917#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {917#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:29:59,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {917#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:59,199 INFO L256 TraceCheckUtils]: 9: Hoare triple {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {915#true} is VALID [2018-11-14 17:29:59,199 INFO L273 TraceCheckUtils]: 10: Hoare triple {915#true} ~cond := #in~cond; {915#true} is VALID [2018-11-14 17:29:59,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {915#true} assume !(~cond == 0); {915#true} is VALID [2018-11-14 17:29:59,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {915#true} assume true; {915#true} is VALID [2018-11-14 17:29:59,201 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {915#true} {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:59,202 INFO L273 TraceCheckUtils]: 14: Hoare triple {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:59,203 INFO L273 TraceCheckUtils]: 15: Hoare triple {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:59,203 INFO L273 TraceCheckUtils]: 16: Hoare triple {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:29:59,204 INFO L273 TraceCheckUtils]: 17: Hoare triple {918#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:29:59,204 INFO L256 TraceCheckUtils]: 18: Hoare triple {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {915#true} is VALID [2018-11-14 17:29:59,204 INFO L273 TraceCheckUtils]: 19: Hoare triple {915#true} ~cond := #in~cond; {915#true} is VALID [2018-11-14 17:29:59,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {915#true} assume !(~cond == 0); {915#true} is VALID [2018-11-14 17:29:59,205 INFO L273 TraceCheckUtils]: 21: Hoare triple {915#true} assume true; {915#true} is VALID [2018-11-14 17:29:59,215 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {915#true} {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #43#return; {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:29:59,216 INFO L273 TraceCheckUtils]: 23: Hoare triple {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:29:59,216 INFO L273 TraceCheckUtils]: 24: Hoare triple {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:29:59,217 INFO L273 TraceCheckUtils]: 25: Hoare triple {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:29:59,217 INFO L273 TraceCheckUtils]: 26: Hoare triple {919#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1002#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:29:59,218 INFO L256 TraceCheckUtils]: 27: Hoare triple {1002#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {915#true} is VALID [2018-11-14 17:29:59,218 INFO L273 TraceCheckUtils]: 28: Hoare triple {915#true} ~cond := #in~cond; {915#true} is VALID [2018-11-14 17:29:59,219 INFO L273 TraceCheckUtils]: 29: Hoare triple {915#true} assume !(~cond == 0); {915#true} is VALID [2018-11-14 17:29:59,219 INFO L273 TraceCheckUtils]: 30: Hoare triple {915#true} assume true; {915#true} is VALID [2018-11-14 17:29:59,225 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {915#true} {1002#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #43#return; {1002#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:29:59,226 INFO L273 TraceCheckUtils]: 32: Hoare triple {1002#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1002#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:29:59,231 INFO L273 TraceCheckUtils]: 33: Hoare triple {1002#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {1002#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:29:59,234 INFO L273 TraceCheckUtils]: 34: Hoare triple {1002#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 10); {916#false} is VALID [2018-11-14 17:29:59,234 INFO L273 TraceCheckUtils]: 35: Hoare triple {916#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {916#false} is VALID [2018-11-14 17:29:59,234 INFO L256 TraceCheckUtils]: 36: Hoare triple {916#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {916#false} is VALID [2018-11-14 17:29:59,235 INFO L273 TraceCheckUtils]: 37: Hoare triple {916#false} ~cond := #in~cond; {916#false} is VALID [2018-11-14 17:29:59,235 INFO L273 TraceCheckUtils]: 38: Hoare triple {916#false} assume ~cond == 0; {916#false} is VALID [2018-11-14 17:29:59,235 INFO L273 TraceCheckUtils]: 39: Hoare triple {916#false} assume !false; {916#false} is VALID [2018-11-14 17:29:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 17:29:59,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:29:59,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 17:29:59,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-11-14 17:29:59,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:29:59,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:29:59,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:59,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:29:59,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:29:59,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:29:59,350 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 7 states. [2018-11-14 17:29:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:59,692 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-14 17:29:59,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:29:59,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-11-14 17:29:59,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:29:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:29:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-14 17:29:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:29:59,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-14 17:29:59,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2018-11-14 17:29:59,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:29:59,766 INFO L225 Difference]: With dead ends: 55 [2018-11-14 17:29:59,766 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 17:29:59,767 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:29:59,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 17:29:59,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-14 17:29:59,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:29:59,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-14 17:29:59,855 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-14 17:29:59,856 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-14 17:29:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:59,858 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-14 17:29:59,858 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-14 17:29:59,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:59,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:59,860 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-14 17:29:59,860 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-14 17:29:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:29:59,863 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-14 17:29:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-14 17:29:59,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:29:59,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:29:59,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:29:59,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:29:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-14 17:29:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-14 17:29:59,868 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2018-11-14 17:29:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:29:59,868 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-14 17:29:59,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:29:59,868 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-14 17:29:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 17:29:59,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:29:59,870 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:29:59,870 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:29:59,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:29:59,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1263007965, now seen corresponding path program 4 times [2018-11-14 17:29:59,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:29:59,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:29:59,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:59,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:29:59,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:29:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:00,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {1264#true} call ULTIMATE.init(); {1264#true} is VALID [2018-11-14 17:30:00,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {1264#true} assume true; {1264#true} is VALID [2018-11-14 17:30:00,849 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1264#true} {1264#true} #39#return; {1264#true} is VALID [2018-11-14 17:30:00,849 INFO L256 TraceCheckUtils]: 3: Hoare triple {1264#true} call #t~ret3 := main(); {1264#true} is VALID [2018-11-14 17:30:00,849 INFO L273 TraceCheckUtils]: 4: Hoare triple {1264#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {1266#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:00,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {1266#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1266#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:00,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {1266#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {1266#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:00,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {1266#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1266#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:00,853 INFO L273 TraceCheckUtils]: 8: Hoare triple {1266#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:00,854 INFO L256 TraceCheckUtils]: 9: Hoare triple {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1264#true} is VALID [2018-11-14 17:30:00,854 INFO L273 TraceCheckUtils]: 10: Hoare triple {1264#true} ~cond := #in~cond; {1264#true} is VALID [2018-11-14 17:30:00,855 INFO L273 TraceCheckUtils]: 11: Hoare triple {1264#true} assume !(~cond == 0); {1264#true} is VALID [2018-11-14 17:30:00,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {1264#true} assume true; {1264#true} is VALID [2018-11-14 17:30:00,856 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1264#true} {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:00,857 INFO L273 TraceCheckUtils]: 14: Hoare triple {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:00,858 INFO L273 TraceCheckUtils]: 15: Hoare triple {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:00,858 INFO L273 TraceCheckUtils]: 16: Hoare triple {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:00,859 INFO L273 TraceCheckUtils]: 17: Hoare triple {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:00,859 INFO L256 TraceCheckUtils]: 18: Hoare triple {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1264#true} is VALID [2018-11-14 17:30:00,859 INFO L273 TraceCheckUtils]: 19: Hoare triple {1264#true} ~cond := #in~cond; {1264#true} is VALID [2018-11-14 17:30:00,860 INFO L273 TraceCheckUtils]: 20: Hoare triple {1264#true} assume !(~cond == 0); {1264#true} is VALID [2018-11-14 17:30:00,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {1264#true} assume true; {1264#true} is VALID [2018-11-14 17:30:00,862 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1264#true} {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #43#return; {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:00,863 INFO L273 TraceCheckUtils]: 23: Hoare triple {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:00,863 INFO L273 TraceCheckUtils]: 24: Hoare triple {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:00,864 INFO L273 TraceCheckUtils]: 25: Hoare triple {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:00,864 INFO L273 TraceCheckUtils]: 26: Hoare triple {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:00,865 INFO L256 TraceCheckUtils]: 27: Hoare triple {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1264#true} is VALID [2018-11-14 17:30:00,865 INFO L273 TraceCheckUtils]: 28: Hoare triple {1264#true} ~cond := #in~cond; {1264#true} is VALID [2018-11-14 17:30:00,865 INFO L273 TraceCheckUtils]: 29: Hoare triple {1264#true} assume !(~cond == 0); {1264#true} is VALID [2018-11-14 17:30:00,865 INFO L273 TraceCheckUtils]: 30: Hoare triple {1264#true} assume true; {1264#true} is VALID [2018-11-14 17:30:00,866 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1264#true} {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #43#return; {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:00,866 INFO L273 TraceCheckUtils]: 32: Hoare triple {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:00,867 INFO L273 TraceCheckUtils]: 33: Hoare triple {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:00,868 INFO L273 TraceCheckUtils]: 34: Hoare triple {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:00,869 INFO L273 TraceCheckUtils]: 35: Hoare triple {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1270#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:00,870 INFO L256 TraceCheckUtils]: 36: Hoare triple {1270#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1264#true} is VALID [2018-11-14 17:30:00,870 INFO L273 TraceCheckUtils]: 37: Hoare triple {1264#true} ~cond := #in~cond; {1264#true} is VALID [2018-11-14 17:30:00,871 INFO L273 TraceCheckUtils]: 38: Hoare triple {1264#true} assume !(~cond == 0); {1264#true} is VALID [2018-11-14 17:30:00,871 INFO L273 TraceCheckUtils]: 39: Hoare triple {1264#true} assume true; {1264#true} is VALID [2018-11-14 17:30:00,873 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1264#true} {1270#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} #43#return; {1270#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:00,875 INFO L273 TraceCheckUtils]: 41: Hoare triple {1270#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1270#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:00,877 INFO L273 TraceCheckUtils]: 42: Hoare triple {1270#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !false; {1270#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:00,882 INFO L273 TraceCheckUtils]: 43: Hoare triple {1270#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10); {1265#false} is VALID [2018-11-14 17:30:00,882 INFO L273 TraceCheckUtils]: 44: Hoare triple {1265#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1265#false} is VALID [2018-11-14 17:30:00,883 INFO L256 TraceCheckUtils]: 45: Hoare triple {1265#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1265#false} is VALID [2018-11-14 17:30:00,883 INFO L273 TraceCheckUtils]: 46: Hoare triple {1265#false} ~cond := #in~cond; {1265#false} is VALID [2018-11-14 17:30:00,883 INFO L273 TraceCheckUtils]: 47: Hoare triple {1265#false} assume ~cond == 0; {1265#false} is VALID [2018-11-14 17:30:00,884 INFO L273 TraceCheckUtils]: 48: Hoare triple {1265#false} assume !false; {1265#false} is VALID [2018-11-14 17:30:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-14 17:30:00,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:30:00,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:30:00,897 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:30:00,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:30:00,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:30:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:00,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:30:01,127 INFO L256 TraceCheckUtils]: 0: Hoare triple {1264#true} call ULTIMATE.init(); {1264#true} is VALID [2018-11-14 17:30:01,128 INFO L273 TraceCheckUtils]: 1: Hoare triple {1264#true} assume true; {1264#true} is VALID [2018-11-14 17:30:01,128 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1264#true} {1264#true} #39#return; {1264#true} is VALID [2018-11-14 17:30:01,128 INFO L256 TraceCheckUtils]: 3: Hoare triple {1264#true} call #t~ret3 := main(); {1264#true} is VALID [2018-11-14 17:30:01,129 INFO L273 TraceCheckUtils]: 4: Hoare triple {1264#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {1266#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:01,129 INFO L273 TraceCheckUtils]: 5: Hoare triple {1266#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1266#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:01,130 INFO L273 TraceCheckUtils]: 6: Hoare triple {1266#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {1266#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:01,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {1266#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1266#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:01,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {1266#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:01,132 INFO L256 TraceCheckUtils]: 9: Hoare triple {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1264#true} is VALID [2018-11-14 17:30:01,132 INFO L273 TraceCheckUtils]: 10: Hoare triple {1264#true} ~cond := #in~cond; {1264#true} is VALID [2018-11-14 17:30:01,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {1264#true} assume !(~cond == 0); {1264#true} is VALID [2018-11-14 17:30:01,133 INFO L273 TraceCheckUtils]: 12: Hoare triple {1264#true} assume true; {1264#true} is VALID [2018-11-14 17:30:01,134 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1264#true} {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:01,134 INFO L273 TraceCheckUtils]: 14: Hoare triple {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:01,135 INFO L273 TraceCheckUtils]: 15: Hoare triple {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:01,136 INFO L273 TraceCheckUtils]: 16: Hoare triple {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:01,137 INFO L273 TraceCheckUtils]: 17: Hoare triple {1267#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:01,137 INFO L256 TraceCheckUtils]: 18: Hoare triple {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1264#true} is VALID [2018-11-14 17:30:01,137 INFO L273 TraceCheckUtils]: 19: Hoare triple {1264#true} ~cond := #in~cond; {1264#true} is VALID [2018-11-14 17:30:01,137 INFO L273 TraceCheckUtils]: 20: Hoare triple {1264#true} assume !(~cond == 0); {1264#true} is VALID [2018-11-14 17:30:01,138 INFO L273 TraceCheckUtils]: 21: Hoare triple {1264#true} assume true; {1264#true} is VALID [2018-11-14 17:30:01,139 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1264#true} {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #43#return; {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:01,139 INFO L273 TraceCheckUtils]: 23: Hoare triple {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:01,141 INFO L273 TraceCheckUtils]: 24: Hoare triple {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:01,142 INFO L273 TraceCheckUtils]: 25: Hoare triple {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:01,142 INFO L273 TraceCheckUtils]: 26: Hoare triple {1268#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:01,142 INFO L256 TraceCheckUtils]: 27: Hoare triple {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1264#true} is VALID [2018-11-14 17:30:01,143 INFO L273 TraceCheckUtils]: 28: Hoare triple {1264#true} ~cond := #in~cond; {1264#true} is VALID [2018-11-14 17:30:01,143 INFO L273 TraceCheckUtils]: 29: Hoare triple {1264#true} assume !(~cond == 0); {1264#true} is VALID [2018-11-14 17:30:01,143 INFO L273 TraceCheckUtils]: 30: Hoare triple {1264#true} assume true; {1264#true} is VALID [2018-11-14 17:30:01,144 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1264#true} {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #43#return; {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:01,144 INFO L273 TraceCheckUtils]: 32: Hoare triple {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:01,145 INFO L273 TraceCheckUtils]: 33: Hoare triple {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:01,145 INFO L273 TraceCheckUtils]: 34: Hoare triple {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:01,146 INFO L273 TraceCheckUtils]: 35: Hoare triple {1269#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1379#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:01,146 INFO L256 TraceCheckUtils]: 36: Hoare triple {1379#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1264#true} is VALID [2018-11-14 17:30:01,146 INFO L273 TraceCheckUtils]: 37: Hoare triple {1264#true} ~cond := #in~cond; {1264#true} is VALID [2018-11-14 17:30:01,146 INFO L273 TraceCheckUtils]: 38: Hoare triple {1264#true} assume !(~cond == 0); {1264#true} is VALID [2018-11-14 17:30:01,147 INFO L273 TraceCheckUtils]: 39: Hoare triple {1264#true} assume true; {1264#true} is VALID [2018-11-14 17:30:01,147 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1264#true} {1379#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #43#return; {1379#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:01,148 INFO L273 TraceCheckUtils]: 41: Hoare triple {1379#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1379#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:01,148 INFO L273 TraceCheckUtils]: 42: Hoare triple {1379#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {1379#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:01,149 INFO L273 TraceCheckUtils]: 43: Hoare triple {1379#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 10); {1265#false} is VALID [2018-11-14 17:30:01,150 INFO L273 TraceCheckUtils]: 44: Hoare triple {1265#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1265#false} is VALID [2018-11-14 17:30:01,150 INFO L256 TraceCheckUtils]: 45: Hoare triple {1265#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1265#false} is VALID [2018-11-14 17:30:01,150 INFO L273 TraceCheckUtils]: 46: Hoare triple {1265#false} ~cond := #in~cond; {1265#false} is VALID [2018-11-14 17:30:01,150 INFO L273 TraceCheckUtils]: 47: Hoare triple {1265#false} assume ~cond == 0; {1265#false} is VALID [2018-11-14 17:30:01,151 INFO L273 TraceCheckUtils]: 48: Hoare triple {1265#false} assume !false; {1265#false} is VALID [2018-11-14 17:30:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-14 17:30:01,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:30:01,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 17:30:01,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-14 17:30:01,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:30:01,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:30:01,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:30:01,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:30:01,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:30:01,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:30:01,264 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 8 states. [2018-11-14 17:30:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:02,035 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-14 17:30:02,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:30:02,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-11-14 17:30:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:30:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:30:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-11-14 17:30:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:30:02,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2018-11-14 17:30:02,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2018-11-14 17:30:02,115 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-14 17:30:02,116 INFO L225 Difference]: With dead ends: 60 [2018-11-14 17:30:02,117 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 17:30:02,117 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:30:02,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 17:30:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-14 17:30:02,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:30:02,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 48 states. [2018-11-14 17:30:02,187 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 48 states. [2018-11-14 17:30:02,187 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 48 states. [2018-11-14 17:30:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:02,190 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-14 17:30:02,190 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-14 17:30:02,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:02,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:02,191 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 49 states. [2018-11-14 17:30:02,191 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 49 states. [2018-11-14 17:30:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:02,195 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-14 17:30:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-14 17:30:02,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:02,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:02,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:30:02,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:30:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:30:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-14 17:30:02,199 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 49 [2018-11-14 17:30:02,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:30:02,199 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-14 17:30:02,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:30:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-14 17:30:02,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 17:30:02,201 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:30:02,201 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:30:02,202 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:30:02,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:30:02,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1453262111, now seen corresponding path program 5 times [2018-11-14 17:30:02,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:30:02,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:30:02,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:02,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:30:02,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:02,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {1665#true} call ULTIMATE.init(); {1665#true} is VALID [2018-11-14 17:30:02,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {1665#true} assume true; {1665#true} is VALID [2018-11-14 17:30:02,800 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1665#true} #39#return; {1665#true} is VALID [2018-11-14 17:30:02,800 INFO L256 TraceCheckUtils]: 3: Hoare triple {1665#true} call #t~ret3 := main(); {1665#true} is VALID [2018-11-14 17:30:02,800 INFO L273 TraceCheckUtils]: 4: Hoare triple {1665#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {1667#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:02,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {1667#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1667#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:02,801 INFO L273 TraceCheckUtils]: 6: Hoare triple {1667#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {1667#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:02,802 INFO L273 TraceCheckUtils]: 7: Hoare triple {1667#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1667#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:02,803 INFO L273 TraceCheckUtils]: 8: Hoare triple {1667#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:02,804 INFO L256 TraceCheckUtils]: 9: Hoare triple {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1665#true} is VALID [2018-11-14 17:30:02,804 INFO L273 TraceCheckUtils]: 10: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2018-11-14 17:30:02,804 INFO L273 TraceCheckUtils]: 11: Hoare triple {1665#true} assume !(~cond == 0); {1665#true} is VALID [2018-11-14 17:30:02,805 INFO L273 TraceCheckUtils]: 12: Hoare triple {1665#true} assume true; {1665#true} is VALID [2018-11-14 17:30:02,806 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1665#true} {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:02,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:02,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:02,809 INFO L273 TraceCheckUtils]: 16: Hoare triple {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:02,810 INFO L273 TraceCheckUtils]: 17: Hoare triple {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:02,810 INFO L256 TraceCheckUtils]: 18: Hoare triple {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1665#true} is VALID [2018-11-14 17:30:02,810 INFO L273 TraceCheckUtils]: 19: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2018-11-14 17:30:02,811 INFO L273 TraceCheckUtils]: 20: Hoare triple {1665#true} assume !(~cond == 0); {1665#true} is VALID [2018-11-14 17:30:02,811 INFO L273 TraceCheckUtils]: 21: Hoare triple {1665#true} assume true; {1665#true} is VALID [2018-11-14 17:30:02,812 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1665#true} {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #43#return; {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:02,813 INFO L273 TraceCheckUtils]: 23: Hoare triple {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:02,813 INFO L273 TraceCheckUtils]: 24: Hoare triple {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:02,814 INFO L273 TraceCheckUtils]: 25: Hoare triple {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:02,815 INFO L273 TraceCheckUtils]: 26: Hoare triple {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:02,815 INFO L256 TraceCheckUtils]: 27: Hoare triple {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1665#true} is VALID [2018-11-14 17:30:02,815 INFO L273 TraceCheckUtils]: 28: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2018-11-14 17:30:02,816 INFO L273 TraceCheckUtils]: 29: Hoare triple {1665#true} assume !(~cond == 0); {1665#true} is VALID [2018-11-14 17:30:02,816 INFO L273 TraceCheckUtils]: 30: Hoare triple {1665#true} assume true; {1665#true} is VALID [2018-11-14 17:30:02,817 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1665#true} {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #43#return; {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:02,818 INFO L273 TraceCheckUtils]: 32: Hoare triple {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:02,818 INFO L273 TraceCheckUtils]: 33: Hoare triple {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:02,819 INFO L273 TraceCheckUtils]: 34: Hoare triple {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:02,821 INFO L273 TraceCheckUtils]: 35: Hoare triple {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:02,821 INFO L256 TraceCheckUtils]: 36: Hoare triple {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1665#true} is VALID [2018-11-14 17:30:02,822 INFO L273 TraceCheckUtils]: 37: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2018-11-14 17:30:02,822 INFO L273 TraceCheckUtils]: 38: Hoare triple {1665#true} assume !(~cond == 0); {1665#true} is VALID [2018-11-14 17:30:02,822 INFO L273 TraceCheckUtils]: 39: Hoare triple {1665#true} assume true; {1665#true} is VALID [2018-11-14 17:30:02,829 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1665#true} {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #43#return; {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:02,829 INFO L273 TraceCheckUtils]: 41: Hoare triple {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:02,830 INFO L273 TraceCheckUtils]: 42: Hoare triple {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:02,830 INFO L273 TraceCheckUtils]: 43: Hoare triple {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:02,831 INFO L273 TraceCheckUtils]: 44: Hoare triple {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1672#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:02,832 INFO L256 TraceCheckUtils]: 45: Hoare triple {1672#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1665#true} is VALID [2018-11-14 17:30:02,832 INFO L273 TraceCheckUtils]: 46: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2018-11-14 17:30:02,832 INFO L273 TraceCheckUtils]: 47: Hoare triple {1665#true} assume !(~cond == 0); {1665#true} is VALID [2018-11-14 17:30:02,833 INFO L273 TraceCheckUtils]: 48: Hoare triple {1665#true} assume true; {1665#true} is VALID [2018-11-14 17:30:02,843 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {1665#true} {1672#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} #43#return; {1672#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:02,844 INFO L273 TraceCheckUtils]: 50: Hoare triple {1672#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume true; {1672#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:02,845 INFO L273 TraceCheckUtils]: 51: Hoare triple {1672#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume !false; {1672#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:02,847 INFO L273 TraceCheckUtils]: 52: Hoare triple {1672#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10); {1666#false} is VALID [2018-11-14 17:30:02,848 INFO L273 TraceCheckUtils]: 53: Hoare triple {1666#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1666#false} is VALID [2018-11-14 17:30:02,848 INFO L256 TraceCheckUtils]: 54: Hoare triple {1666#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1666#false} is VALID [2018-11-14 17:30:02,848 INFO L273 TraceCheckUtils]: 55: Hoare triple {1666#false} ~cond := #in~cond; {1666#false} is VALID [2018-11-14 17:30:02,848 INFO L273 TraceCheckUtils]: 56: Hoare triple {1666#false} assume ~cond == 0; {1666#false} is VALID [2018-11-14 17:30:02,848 INFO L273 TraceCheckUtils]: 57: Hoare triple {1666#false} assume !false; {1666#false} is VALID [2018-11-14 17:30:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-14 17:30:02,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:30:02,874 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:30:02,886 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:30:03,191 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 17:30:03,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:30:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:03,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:30:03,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {1665#true} call ULTIMATE.init(); {1665#true} is VALID [2018-11-14 17:30:03,379 INFO L273 TraceCheckUtils]: 1: Hoare triple {1665#true} assume true; {1665#true} is VALID [2018-11-14 17:30:03,379 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1665#true} {1665#true} #39#return; {1665#true} is VALID [2018-11-14 17:30:03,379 INFO L256 TraceCheckUtils]: 3: Hoare triple {1665#true} call #t~ret3 := main(); {1665#true} is VALID [2018-11-14 17:30:03,380 INFO L273 TraceCheckUtils]: 4: Hoare triple {1665#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {1667#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:03,380 INFO L273 TraceCheckUtils]: 5: Hoare triple {1667#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1667#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:03,380 INFO L273 TraceCheckUtils]: 6: Hoare triple {1667#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {1667#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:03,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {1667#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1667#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:03,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {1667#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:03,382 INFO L256 TraceCheckUtils]: 9: Hoare triple {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1665#true} is VALID [2018-11-14 17:30:03,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2018-11-14 17:30:03,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {1665#true} assume !(~cond == 0); {1665#true} is VALID [2018-11-14 17:30:03,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {1665#true} assume true; {1665#true} is VALID [2018-11-14 17:30:03,385 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1665#true} {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:03,386 INFO L273 TraceCheckUtils]: 14: Hoare triple {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:03,387 INFO L273 TraceCheckUtils]: 15: Hoare triple {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:03,391 INFO L273 TraceCheckUtils]: 16: Hoare triple {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:03,392 INFO L273 TraceCheckUtils]: 17: Hoare triple {1668#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:03,392 INFO L256 TraceCheckUtils]: 18: Hoare triple {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1665#true} is VALID [2018-11-14 17:30:03,392 INFO L273 TraceCheckUtils]: 19: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2018-11-14 17:30:03,392 INFO L273 TraceCheckUtils]: 20: Hoare triple {1665#true} assume !(~cond == 0); {1665#true} is VALID [2018-11-14 17:30:03,392 INFO L273 TraceCheckUtils]: 21: Hoare triple {1665#true} assume true; {1665#true} is VALID [2018-11-14 17:30:03,394 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1665#true} {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #43#return; {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:03,394 INFO L273 TraceCheckUtils]: 23: Hoare triple {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:03,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:03,402 INFO L273 TraceCheckUtils]: 25: Hoare triple {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:03,403 INFO L273 TraceCheckUtils]: 26: Hoare triple {1669#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:03,403 INFO L256 TraceCheckUtils]: 27: Hoare triple {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1665#true} is VALID [2018-11-14 17:30:03,403 INFO L273 TraceCheckUtils]: 28: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2018-11-14 17:30:03,403 INFO L273 TraceCheckUtils]: 29: Hoare triple {1665#true} assume !(~cond == 0); {1665#true} is VALID [2018-11-14 17:30:03,404 INFO L273 TraceCheckUtils]: 30: Hoare triple {1665#true} assume true; {1665#true} is VALID [2018-11-14 17:30:03,404 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1665#true} {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #43#return; {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:03,404 INFO L273 TraceCheckUtils]: 32: Hoare triple {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:03,405 INFO L273 TraceCheckUtils]: 33: Hoare triple {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:03,405 INFO L273 TraceCheckUtils]: 34: Hoare triple {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:03,406 INFO L273 TraceCheckUtils]: 35: Hoare triple {1670#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:03,406 INFO L256 TraceCheckUtils]: 36: Hoare triple {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1665#true} is VALID [2018-11-14 17:30:03,406 INFO L273 TraceCheckUtils]: 37: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2018-11-14 17:30:03,406 INFO L273 TraceCheckUtils]: 38: Hoare triple {1665#true} assume !(~cond == 0); {1665#true} is VALID [2018-11-14 17:30:03,406 INFO L273 TraceCheckUtils]: 39: Hoare triple {1665#true} assume true; {1665#true} is VALID [2018-11-14 17:30:03,407 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {1665#true} {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #43#return; {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:03,407 INFO L273 TraceCheckUtils]: 41: Hoare triple {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:03,408 INFO L273 TraceCheckUtils]: 42: Hoare triple {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:03,409 INFO L273 TraceCheckUtils]: 43: Hoare triple {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:03,409 INFO L273 TraceCheckUtils]: 44: Hoare triple {1671#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1808#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:03,410 INFO L256 TraceCheckUtils]: 45: Hoare triple {1808#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1665#true} is VALID [2018-11-14 17:30:03,410 INFO L273 TraceCheckUtils]: 46: Hoare triple {1665#true} ~cond := #in~cond; {1665#true} is VALID [2018-11-14 17:30:03,410 INFO L273 TraceCheckUtils]: 47: Hoare triple {1665#true} assume !(~cond == 0); {1665#true} is VALID [2018-11-14 17:30:03,410 INFO L273 TraceCheckUtils]: 48: Hoare triple {1665#true} assume true; {1665#true} is VALID [2018-11-14 17:30:03,411 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {1665#true} {1808#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #43#return; {1808#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:03,414 INFO L273 TraceCheckUtils]: 50: Hoare triple {1808#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {1808#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:03,414 INFO L273 TraceCheckUtils]: 51: Hoare triple {1808#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {1808#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:03,415 INFO L273 TraceCheckUtils]: 52: Hoare triple {1808#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10); {1666#false} is VALID [2018-11-14 17:30:03,415 INFO L273 TraceCheckUtils]: 53: Hoare triple {1666#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {1666#false} is VALID [2018-11-14 17:30:03,415 INFO L256 TraceCheckUtils]: 54: Hoare triple {1666#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {1666#false} is VALID [2018-11-14 17:30:03,416 INFO L273 TraceCheckUtils]: 55: Hoare triple {1666#false} ~cond := #in~cond; {1666#false} is VALID [2018-11-14 17:30:03,416 INFO L273 TraceCheckUtils]: 56: Hoare triple {1666#false} assume ~cond == 0; {1666#false} is VALID [2018-11-14 17:30:03,416 INFO L273 TraceCheckUtils]: 57: Hoare triple {1666#false} assume !false; {1666#false} is VALID [2018-11-14 17:30:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-14 17:30:03,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:30:03,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 17:30:03,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-14 17:30:03,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:30:03,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:30:03,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:30:03,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:30:03,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:30:03,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:30:03,511 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 9 states. [2018-11-14 17:30:04,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:04,117 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-14 17:30:04,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:30:04,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-14 17:30:04,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:30:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:30:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2018-11-14 17:30:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:30:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2018-11-14 17:30:04,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 64 transitions. [2018-11-14 17:30:04,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:30:04,294 INFO L225 Difference]: With dead ends: 65 [2018-11-14 17:30:04,294 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 17:30:04,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:30:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 17:30:04,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-14 17:30:04,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:30:04,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-14 17:30:04,337 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-14 17:30:04,337 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-14 17:30:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:04,340 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-14 17:30:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-14 17:30:04,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:04,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:04,341 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-14 17:30:04,341 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-14 17:30:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:04,343 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-14 17:30:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-14 17:30:04,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:04,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:04,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:30:04,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:30:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 17:30:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-11-14 17:30:04,347 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 58 [2018-11-14 17:30:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:30:04,347 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-11-14 17:30:04,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:30:04,348 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-11-14 17:30:04,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-14 17:30:04,349 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:30:04,349 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:30:04,349 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:30:04,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:30:04,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1989893347, now seen corresponding path program 6 times [2018-11-14 17:30:04,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:30:04,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:30:04,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:04,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:30:04,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:04,661 INFO L256 TraceCheckUtils]: 0: Hoare triple {2118#true} call ULTIMATE.init(); {2118#true} is VALID [2018-11-14 17:30:04,661 INFO L273 TraceCheckUtils]: 1: Hoare triple {2118#true} assume true; {2118#true} is VALID [2018-11-14 17:30:04,661 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2118#true} {2118#true} #39#return; {2118#true} is VALID [2018-11-14 17:30:04,661 INFO L256 TraceCheckUtils]: 3: Hoare triple {2118#true} call #t~ret3 := main(); {2118#true} is VALID [2018-11-14 17:30:04,662 INFO L273 TraceCheckUtils]: 4: Hoare triple {2118#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {2120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:04,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {2120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:04,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {2120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {2120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:04,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {2120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:04,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {2120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2121#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:04,665 INFO L256 TraceCheckUtils]: 9: Hoare triple {2121#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2118#true} is VALID [2018-11-14 17:30:04,665 INFO L273 TraceCheckUtils]: 10: Hoare triple {2118#true} ~cond := #in~cond; {2118#true} is VALID [2018-11-14 17:30:04,665 INFO L273 TraceCheckUtils]: 11: Hoare triple {2118#true} assume !(~cond == 0); {2118#true} is VALID [2018-11-14 17:30:04,665 INFO L273 TraceCheckUtils]: 12: Hoare triple {2118#true} assume true; {2118#true} is VALID [2018-11-14 17:30:04,666 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2118#true} {2121#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {2121#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:04,667 INFO L273 TraceCheckUtils]: 14: Hoare triple {2121#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2121#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:04,668 INFO L273 TraceCheckUtils]: 15: Hoare triple {2121#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {2121#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:04,668 INFO L273 TraceCheckUtils]: 16: Hoare triple {2121#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2121#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:04,669 INFO L273 TraceCheckUtils]: 17: Hoare triple {2121#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2122#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:04,670 INFO L256 TraceCheckUtils]: 18: Hoare triple {2122#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2118#true} is VALID [2018-11-14 17:30:04,670 INFO L273 TraceCheckUtils]: 19: Hoare triple {2118#true} ~cond := #in~cond; {2118#true} is VALID [2018-11-14 17:30:04,670 INFO L273 TraceCheckUtils]: 20: Hoare triple {2118#true} assume !(~cond == 0); {2118#true} is VALID [2018-11-14 17:30:04,670 INFO L273 TraceCheckUtils]: 21: Hoare triple {2118#true} assume true; {2118#true} is VALID [2018-11-14 17:30:04,671 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2118#true} {2122#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #43#return; {2122#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:04,672 INFO L273 TraceCheckUtils]: 23: Hoare triple {2122#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2122#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:04,672 INFO L273 TraceCheckUtils]: 24: Hoare triple {2122#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {2122#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:04,673 INFO L273 TraceCheckUtils]: 25: Hoare triple {2122#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2122#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:04,674 INFO L273 TraceCheckUtils]: 26: Hoare triple {2122#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2123#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:04,675 INFO L256 TraceCheckUtils]: 27: Hoare triple {2123#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2118#true} is VALID [2018-11-14 17:30:04,675 INFO L273 TraceCheckUtils]: 28: Hoare triple {2118#true} ~cond := #in~cond; {2118#true} is VALID [2018-11-14 17:30:04,675 INFO L273 TraceCheckUtils]: 29: Hoare triple {2118#true} assume !(~cond == 0); {2118#true} is VALID [2018-11-14 17:30:04,676 INFO L273 TraceCheckUtils]: 30: Hoare triple {2118#true} assume true; {2118#true} is VALID [2018-11-14 17:30:04,696 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2118#true} {2123#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #43#return; {2123#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:04,709 INFO L273 TraceCheckUtils]: 32: Hoare triple {2123#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2123#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:04,718 INFO L273 TraceCheckUtils]: 33: Hoare triple {2123#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {2123#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:04,733 INFO L273 TraceCheckUtils]: 34: Hoare triple {2123#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2123#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:04,742 INFO L273 TraceCheckUtils]: 35: Hoare triple {2123#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2124#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:04,742 INFO L256 TraceCheckUtils]: 36: Hoare triple {2124#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2118#true} is VALID [2018-11-14 17:30:04,742 INFO L273 TraceCheckUtils]: 37: Hoare triple {2118#true} ~cond := #in~cond; {2118#true} is VALID [2018-11-14 17:30:04,743 INFO L273 TraceCheckUtils]: 38: Hoare triple {2118#true} assume !(~cond == 0); {2118#true} is VALID [2018-11-14 17:30:04,743 INFO L273 TraceCheckUtils]: 39: Hoare triple {2118#true} assume true; {2118#true} is VALID [2018-11-14 17:30:04,748 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2118#true} {2124#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #43#return; {2124#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:04,750 INFO L273 TraceCheckUtils]: 41: Hoare triple {2124#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2124#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:04,750 INFO L273 TraceCheckUtils]: 42: Hoare triple {2124#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {2124#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:04,753 INFO L273 TraceCheckUtils]: 43: Hoare triple {2124#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2124#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:04,753 INFO L273 TraceCheckUtils]: 44: Hoare triple {2124#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2125#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:04,753 INFO L256 TraceCheckUtils]: 45: Hoare triple {2125#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2118#true} is VALID [2018-11-14 17:30:04,754 INFO L273 TraceCheckUtils]: 46: Hoare triple {2118#true} ~cond := #in~cond; {2118#true} is VALID [2018-11-14 17:30:04,754 INFO L273 TraceCheckUtils]: 47: Hoare triple {2118#true} assume !(~cond == 0); {2118#true} is VALID [2018-11-14 17:30:04,754 INFO L273 TraceCheckUtils]: 48: Hoare triple {2118#true} assume true; {2118#true} is VALID [2018-11-14 17:30:04,754 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2118#true} {2125#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #43#return; {2125#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:04,759 INFO L273 TraceCheckUtils]: 50: Hoare triple {2125#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2125#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:04,759 INFO L273 TraceCheckUtils]: 51: Hoare triple {2125#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {2125#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:04,760 INFO L273 TraceCheckUtils]: 52: Hoare triple {2125#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2125#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:04,761 INFO L273 TraceCheckUtils]: 53: Hoare triple {2125#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2126#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:04,761 INFO L256 TraceCheckUtils]: 54: Hoare triple {2126#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2118#true} is VALID [2018-11-14 17:30:04,761 INFO L273 TraceCheckUtils]: 55: Hoare triple {2118#true} ~cond := #in~cond; {2118#true} is VALID [2018-11-14 17:30:04,761 INFO L273 TraceCheckUtils]: 56: Hoare triple {2118#true} assume !(~cond == 0); {2118#true} is VALID [2018-11-14 17:30:04,761 INFO L273 TraceCheckUtils]: 57: Hoare triple {2118#true} assume true; {2118#true} is VALID [2018-11-14 17:30:04,762 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {2118#true} {2126#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} #43#return; {2126#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:04,762 INFO L273 TraceCheckUtils]: 59: Hoare triple {2126#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {2126#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:04,763 INFO L273 TraceCheckUtils]: 60: Hoare triple {2126#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !false; {2126#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:04,764 INFO L273 TraceCheckUtils]: 61: Hoare triple {2126#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10); {2119#false} is VALID [2018-11-14 17:30:04,764 INFO L273 TraceCheckUtils]: 62: Hoare triple {2119#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2119#false} is VALID [2018-11-14 17:30:04,765 INFO L256 TraceCheckUtils]: 63: Hoare triple {2119#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2119#false} is VALID [2018-11-14 17:30:04,765 INFO L273 TraceCheckUtils]: 64: Hoare triple {2119#false} ~cond := #in~cond; {2119#false} is VALID [2018-11-14 17:30:04,765 INFO L273 TraceCheckUtils]: 65: Hoare triple {2119#false} assume ~cond == 0; {2119#false} is VALID [2018-11-14 17:30:04,765 INFO L273 TraceCheckUtils]: 66: Hoare triple {2119#false} assume !false; {2119#false} is VALID [2018-11-14 17:30:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 24 proven. 93 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-14 17:30:04,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:30:04,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:30:04,780 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:30:06,946 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-11-14 17:30:06,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:30:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:06,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:30:09,291 WARN L179 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-14 17:30:09,517 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 15 [2018-11-14 17:30:12,795 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-11-14 17:30:12,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {2118#true} call ULTIMATE.init(); {2118#true} is VALID [2018-11-14 17:30:12,974 INFO L273 TraceCheckUtils]: 1: Hoare triple {2118#true} assume true; {2118#true} is VALID [2018-11-14 17:30:12,974 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2118#true} {2118#true} #39#return; {2118#true} is VALID [2018-11-14 17:30:12,974 INFO L256 TraceCheckUtils]: 3: Hoare triple {2118#true} call #t~ret3 := main(); {2118#true} is VALID [2018-11-14 17:30:12,975 INFO L273 TraceCheckUtils]: 4: Hoare triple {2118#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {2120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:12,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {2120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:12,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {2120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {2120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:13,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {2120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:13,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {2120#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2121#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:13,005 INFO L256 TraceCheckUtils]: 9: Hoare triple {2121#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2118#true} is VALID [2018-11-14 17:30:13,009 INFO L273 TraceCheckUtils]: 10: Hoare triple {2118#true} ~cond := #in~cond; {2160#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:30:13,010 INFO L273 TraceCheckUtils]: 11: Hoare triple {2160#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(~cond == 0); {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:30:13,010 INFO L273 TraceCheckUtils]: 12: Hoare triple {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:30:13,012 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} {2121#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {2171#(and (<= main_~x~0 1) (<= 1 main_~x~0) (or (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (= 0 main_~sn~0)))} is VALID [2018-11-14 17:30:13,012 INFO L273 TraceCheckUtils]: 14: Hoare triple {2171#(and (<= main_~x~0 1) (<= 1 main_~x~0) (or (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (= 0 main_~sn~0)))} assume true; {2171#(and (<= main_~x~0 1) (<= 1 main_~x~0) (or (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (= 0 main_~sn~0)))} is VALID [2018-11-14 17:30:13,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {2171#(and (<= main_~x~0 1) (<= 1 main_~x~0) (or (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (= 0 main_~sn~0)))} assume !false; {2171#(and (<= main_~x~0 1) (<= 1 main_~x~0) (or (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (= 0 main_~sn~0)))} is VALID [2018-11-14 17:30:13,021 INFO L273 TraceCheckUtils]: 16: Hoare triple {2171#(and (<= main_~x~0 1) (<= 1 main_~x~0) (or (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (= 0 main_~sn~0)))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2181#(and (<= main_~x~0 1) (<= 1 main_~x~0) (or (= (mod (* 2 main_~x~0) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296)) (= 2 main_~sn~0)))} is VALID [2018-11-14 17:30:13,028 INFO L273 TraceCheckUtils]: 17: Hoare triple {2181#(and (<= main_~x~0 1) (<= 1 main_~x~0) (or (= (mod (* 2 main_~x~0) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296)) (= 2 main_~sn~0)))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2185#(and (or (= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296)) (= 2 main_~sn~0)) (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:13,029 INFO L256 TraceCheckUtils]: 18: Hoare triple {2185#(and (or (= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296)) (= 2 main_~sn~0)) (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2118#true} is VALID [2018-11-14 17:30:13,038 INFO L273 TraceCheckUtils]: 19: Hoare triple {2118#true} ~cond := #in~cond; {2160#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:30:13,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {2160#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(~cond == 0); {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:30:13,044 INFO L273 TraceCheckUtils]: 21: Hoare triple {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:30:13,045 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} {2185#(and (or (= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296)) (= 2 main_~sn~0)) (<= 2 main_~x~0) (<= main_~x~0 2))} #43#return; {2201#(and (or (= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296)) (= 2 main_~sn~0)) (<= 2 main_~x~0) (<= main_~x~0 2) (or (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (= 0 main_~sn~0)))} is VALID [2018-11-14 17:30:13,046 INFO L273 TraceCheckUtils]: 23: Hoare triple {2201#(and (or (= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296)) (= 2 main_~sn~0)) (<= 2 main_~x~0) (<= main_~x~0 2) (or (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (= 0 main_~sn~0)))} assume true; {2201#(and (or (= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296)) (= 2 main_~sn~0)) (<= 2 main_~x~0) (<= main_~x~0 2) (or (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (= 0 main_~sn~0)))} is VALID [2018-11-14 17:30:13,047 INFO L273 TraceCheckUtils]: 24: Hoare triple {2201#(and (or (= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296)) (= 2 main_~sn~0)) (<= 2 main_~x~0) (<= main_~x~0 2) (or (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (= 0 main_~sn~0)))} assume !false; {2201#(and (or (= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296)) (= 2 main_~sn~0)) (<= 2 main_~x~0) (<= main_~x~0 2) (or (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (= 0 main_~sn~0)))} is VALID [2018-11-14 17:30:13,049 INFO L273 TraceCheckUtils]: 25: Hoare triple {2201#(and (or (= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296)) (= 2 main_~sn~0)) (<= 2 main_~x~0) (<= main_~x~0 2) (or (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (= 0 main_~sn~0)))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2211#(and (= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) (mod (+ main_~sn~0 4294967292) 4294967296)) (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:13,051 INFO L273 TraceCheckUtils]: 26: Hoare triple {2211#(and (= (mod (+ (* 2 main_~x~0) 4294967294) 4294967296) (mod (+ main_~sn~0 4294967292) 4294967296)) (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2215#(and (<= main_~x~0 3) (<= 3 main_~x~0) (= (mod (+ (* 2 main_~x~0) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967292) 4294967296)))} is VALID [2018-11-14 17:30:13,051 INFO L256 TraceCheckUtils]: 27: Hoare triple {2215#(and (<= main_~x~0 3) (<= 3 main_~x~0) (= (mod (+ (* 2 main_~x~0) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967292) 4294967296)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2118#true} is VALID [2018-11-14 17:30:13,051 INFO L273 TraceCheckUtils]: 28: Hoare triple {2118#true} ~cond := #in~cond; {2160#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:30:13,052 INFO L273 TraceCheckUtils]: 29: Hoare triple {2160#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(~cond == 0); {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:30:13,052 INFO L273 TraceCheckUtils]: 30: Hoare triple {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:30:13,055 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} {2215#(and (<= main_~x~0 3) (<= 3 main_~x~0) (= (mod (+ (* 2 main_~x~0) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967292) 4294967296)))} #43#return; {2231#(exists ((v_prenex_1 Int)) (and (= (mod (* 2 v_prenex_1) 4294967296) (mod main_~sn~0 4294967296)) (<= v_prenex_1 3) (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967292) 4294967296)) (<= 3 v_prenex_1)))} is VALID [2018-11-14 17:30:13,055 INFO L273 TraceCheckUtils]: 32: Hoare triple {2231#(exists ((v_prenex_1 Int)) (and (= (mod (* 2 v_prenex_1) 4294967296) (mod main_~sn~0 4294967296)) (<= v_prenex_1 3) (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967292) 4294967296)) (<= 3 v_prenex_1)))} assume true; {2231#(exists ((v_prenex_1 Int)) (and (= (mod (* 2 v_prenex_1) 4294967296) (mod main_~sn~0 4294967296)) (<= v_prenex_1 3) (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967292) 4294967296)) (<= 3 v_prenex_1)))} is VALID [2018-11-14 17:30:13,056 INFO L273 TraceCheckUtils]: 33: Hoare triple {2231#(exists ((v_prenex_1 Int)) (and (= (mod (* 2 v_prenex_1) 4294967296) (mod main_~sn~0 4294967296)) (<= v_prenex_1 3) (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967292) 4294967296)) (<= 3 v_prenex_1)))} assume !false; {2231#(exists ((v_prenex_1 Int)) (and (= (mod (* 2 v_prenex_1) 4294967296) (mod main_~sn~0 4294967296)) (<= v_prenex_1 3) (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967292) 4294967296)) (<= 3 v_prenex_1)))} is VALID [2018-11-14 17:30:13,091 INFO L273 TraceCheckUtils]: 34: Hoare triple {2231#(exists ((v_prenex_1 Int)) (and (= (mod (* 2 v_prenex_1) 4294967296) (mod main_~sn~0 4294967296)) (<= v_prenex_1 3) (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967292) 4294967296)) (<= 3 v_prenex_1)))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2241#(exists ((v_prenex_1 Int)) (and (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= v_prenex_1 3) (<= 3 v_prenex_1) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296))))} is VALID [2018-11-14 17:30:13,092 INFO L273 TraceCheckUtils]: 35: Hoare triple {2241#(exists ((v_prenex_1 Int)) (and (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= v_prenex_1 3) (<= 3 v_prenex_1) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296))))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2241#(exists ((v_prenex_1 Int)) (and (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= v_prenex_1 3) (<= 3 v_prenex_1) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296))))} is VALID [2018-11-14 17:30:13,092 INFO L256 TraceCheckUtils]: 36: Hoare triple {2241#(exists ((v_prenex_1 Int)) (and (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= v_prenex_1 3) (<= 3 v_prenex_1) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296))))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2118#true} is VALID [2018-11-14 17:30:13,092 INFO L273 TraceCheckUtils]: 37: Hoare triple {2118#true} ~cond := #in~cond; {2118#true} is VALID [2018-11-14 17:30:13,092 INFO L273 TraceCheckUtils]: 38: Hoare triple {2118#true} assume !(~cond == 0); {2118#true} is VALID [2018-11-14 17:30:13,092 INFO L273 TraceCheckUtils]: 39: Hoare triple {2118#true} assume true; {2118#true} is VALID [2018-11-14 17:30:13,093 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2118#true} {2241#(exists ((v_prenex_1 Int)) (and (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= v_prenex_1 3) (<= 3 v_prenex_1) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296))))} #43#return; {2241#(exists ((v_prenex_1 Int)) (and (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= v_prenex_1 3) (<= 3 v_prenex_1) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296))))} is VALID [2018-11-14 17:30:13,093 INFO L273 TraceCheckUtils]: 41: Hoare triple {2241#(exists ((v_prenex_1 Int)) (and (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= v_prenex_1 3) (<= 3 v_prenex_1) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296))))} assume true; {2241#(exists ((v_prenex_1 Int)) (and (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= v_prenex_1 3) (<= 3 v_prenex_1) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296))))} is VALID [2018-11-14 17:30:13,094 INFO L273 TraceCheckUtils]: 42: Hoare triple {2241#(exists ((v_prenex_1 Int)) (and (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= v_prenex_1 3) (<= 3 v_prenex_1) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296))))} assume !false; {2241#(exists ((v_prenex_1 Int)) (and (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= v_prenex_1 3) (<= 3 v_prenex_1) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296))))} is VALID [2018-11-14 17:30:13,096 INFO L273 TraceCheckUtils]: 43: Hoare triple {2241#(exists ((v_prenex_1 Int)) (and (= (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= v_prenex_1 3) (<= 3 v_prenex_1) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967294) 4294967296))))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2269#(exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967292) 4294967296) (mod (* 2 v_prenex_1) 4294967296)) (<= v_prenex_1 3) (= (mod (+ main_~sn~0 4294967288) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= 3 v_prenex_1)))} is VALID [2018-11-14 17:30:13,096 INFO L273 TraceCheckUtils]: 44: Hoare triple {2269#(exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967292) 4294967296) (mod (* 2 v_prenex_1) 4294967296)) (<= v_prenex_1 3) (= (mod (+ main_~sn~0 4294967288) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= 3 v_prenex_1)))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2269#(exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967292) 4294967296) (mod (* 2 v_prenex_1) 4294967296)) (<= v_prenex_1 3) (= (mod (+ main_~sn~0 4294967288) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= 3 v_prenex_1)))} is VALID [2018-11-14 17:30:13,096 INFO L256 TraceCheckUtils]: 45: Hoare triple {2269#(exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967292) 4294967296) (mod (* 2 v_prenex_1) 4294967296)) (<= v_prenex_1 3) (= (mod (+ main_~sn~0 4294967288) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= 3 v_prenex_1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2118#true} is VALID [2018-11-14 17:30:13,097 INFO L273 TraceCheckUtils]: 46: Hoare triple {2118#true} ~cond := #in~cond; {2118#true} is VALID [2018-11-14 17:30:13,097 INFO L273 TraceCheckUtils]: 47: Hoare triple {2118#true} assume !(~cond == 0); {2118#true} is VALID [2018-11-14 17:30:13,097 INFO L273 TraceCheckUtils]: 48: Hoare triple {2118#true} assume true; {2118#true} is VALID [2018-11-14 17:30:13,097 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2118#true} {2269#(exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967292) 4294967296) (mod (* 2 v_prenex_1) 4294967296)) (<= v_prenex_1 3) (= (mod (+ main_~sn~0 4294967288) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= 3 v_prenex_1)))} #43#return; {2269#(exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967292) 4294967296) (mod (* 2 v_prenex_1) 4294967296)) (<= v_prenex_1 3) (= (mod (+ main_~sn~0 4294967288) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= 3 v_prenex_1)))} is VALID [2018-11-14 17:30:13,098 INFO L273 TraceCheckUtils]: 50: Hoare triple {2269#(exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967292) 4294967296) (mod (* 2 v_prenex_1) 4294967296)) (<= v_prenex_1 3) (= (mod (+ main_~sn~0 4294967288) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= 3 v_prenex_1)))} assume true; {2269#(exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967292) 4294967296) (mod (* 2 v_prenex_1) 4294967296)) (<= v_prenex_1 3) (= (mod (+ main_~sn~0 4294967288) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= 3 v_prenex_1)))} is VALID [2018-11-14 17:30:13,098 INFO L273 TraceCheckUtils]: 51: Hoare triple {2269#(exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967292) 4294967296) (mod (* 2 v_prenex_1) 4294967296)) (<= v_prenex_1 3) (= (mod (+ main_~sn~0 4294967288) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= 3 v_prenex_1)))} assume !false; {2269#(exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967292) 4294967296) (mod (* 2 v_prenex_1) 4294967296)) (<= v_prenex_1 3) (= (mod (+ main_~sn~0 4294967288) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= 3 v_prenex_1)))} is VALID [2018-11-14 17:30:13,101 INFO L273 TraceCheckUtils]: 52: Hoare triple {2269#(exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967292) 4294967296) (mod (* 2 v_prenex_1) 4294967296)) (<= v_prenex_1 3) (= (mod (+ main_~sn~0 4294967288) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= 3 v_prenex_1)))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2297#(and (< (mod main_~x~0 4294967296) 10) (exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967286) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= v_prenex_1 3) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= 3 v_prenex_1))))} is VALID [2018-11-14 17:30:13,103 INFO L273 TraceCheckUtils]: 53: Hoare triple {2297#(and (< (mod main_~x~0 4294967296) 10) (exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967286) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= v_prenex_1 3) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= 3 v_prenex_1))))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2301#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967286) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= v_prenex_1 3) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= 3 v_prenex_1))))} is VALID [2018-11-14 17:30:13,103 INFO L256 TraceCheckUtils]: 54: Hoare triple {2301#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967286) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= v_prenex_1 3) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= 3 v_prenex_1))))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2118#true} is VALID [2018-11-14 17:30:13,104 INFO L273 TraceCheckUtils]: 55: Hoare triple {2118#true} ~cond := #in~cond; {2160#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:30:13,104 INFO L273 TraceCheckUtils]: 56: Hoare triple {2160#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(~cond == 0); {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:30:13,104 INFO L273 TraceCheckUtils]: 57: Hoare triple {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:30:13,109 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {2164#(not (= |__VERIFIER_assert_#in~cond| 0))} {2301#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967286) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= v_prenex_1 3) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= 3 v_prenex_1))))} #43#return; {2317#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967286) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= v_prenex_1 3) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= 3 v_prenex_1))))} is VALID [2018-11-14 17:30:13,110 INFO L273 TraceCheckUtils]: 59: Hoare triple {2317#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967286) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= v_prenex_1 3) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= 3 v_prenex_1))))} assume true; {2317#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967286) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= v_prenex_1 3) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= 3 v_prenex_1))))} is VALID [2018-11-14 17:30:13,111 INFO L273 TraceCheckUtils]: 60: Hoare triple {2317#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967286) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= v_prenex_1 3) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= 3 v_prenex_1))))} assume !false; {2317#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967286) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= v_prenex_1 3) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= 3 v_prenex_1))))} is VALID [2018-11-14 17:30:13,125 INFO L273 TraceCheckUtils]: 61: Hoare triple {2317#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 10) (= (mod (* 2 main_~x~0) 4294967296) (mod main_~sn~0 4294967296)) (exists ((v_prenex_1 Int)) (and (= (mod (+ main_~sn~0 4294967286) 4294967296) (mod (+ (* 2 v_prenex_1) 4294967292) 4294967296)) (<= v_prenex_1 3) (= (mod (* 2 v_prenex_1) 4294967296) (mod (+ main_~sn~0 4294967290) 4294967296)) (<= 3 v_prenex_1))))} assume !(~x~0 % 4294967296 < 10); {2119#false} is VALID [2018-11-14 17:30:13,125 INFO L273 TraceCheckUtils]: 62: Hoare triple {2119#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2119#false} is VALID [2018-11-14 17:30:13,126 INFO L256 TraceCheckUtils]: 63: Hoare triple {2119#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2119#false} is VALID [2018-11-14 17:30:13,126 INFO L273 TraceCheckUtils]: 64: Hoare triple {2119#false} ~cond := #in~cond; {2119#false} is VALID [2018-11-14 17:30:13,126 INFO L273 TraceCheckUtils]: 65: Hoare triple {2119#false} assume ~cond == 0; {2119#false} is VALID [2018-11-14 17:30:13,126 INFO L273 TraceCheckUtils]: 66: Hoare triple {2119#false} assume !false; {2119#false} is VALID [2018-11-14 17:30:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 30 proven. 111 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-14 17:30:13,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:30:13,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18] total 23 [2018-11-14 17:30:13,175 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2018-11-14 17:30:13,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:30:13,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 17:30:14,369 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-14 17:30:14,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 17:30:14,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 17:30:14,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:30:14,370 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 23 states. [2018-11-14 17:30:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:29,809 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-11-14 17:30:29,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 17:30:29,810 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2018-11-14 17:30:29,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:30:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:30:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 72 transitions. [2018-11-14 17:30:29,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:30:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 72 transitions. [2018-11-14 17:30:29,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 72 transitions. [2018-11-14 17:30:30,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:30:30,103 INFO L225 Difference]: With dead ends: 72 [2018-11-14 17:30:30,103 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 17:30:30,104 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:30:30,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 17:30:30,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2018-11-14 17:30:30,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:30:30,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 58 states. [2018-11-14 17:30:30,200 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 58 states. [2018-11-14 17:30:30,201 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 58 states. [2018-11-14 17:30:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:30,205 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-14 17:30:30,205 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-14 17:30:30,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:30,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:30,206 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 61 states. [2018-11-14 17:30:30,206 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 61 states. [2018-11-14 17:30:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:30,209 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-14 17:30:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-14 17:30:30,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:30,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:30,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:30:30,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:30:30,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 17:30:30,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-11-14 17:30:30,214 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 67 [2018-11-14 17:30:30,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:30:30,214 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-11-14 17:30:30,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 17:30:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-11-14 17:30:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-14 17:30:30,216 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:30:30,216 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:30:30,216 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:30:30,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:30:30,217 INFO L82 PathProgramCache]: Analyzing trace with hash -259908319, now seen corresponding path program 7 times [2018-11-14 17:30:30,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:30:30,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:30:30,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:30,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:30:30,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:30,832 INFO L256 TraceCheckUtils]: 0: Hoare triple {2657#true} call ULTIMATE.init(); {2657#true} is VALID [2018-11-14 17:30:30,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 17:30:30,833 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2657#true} {2657#true} #39#return; {2657#true} is VALID [2018-11-14 17:30:30,833 INFO L256 TraceCheckUtils]: 3: Hoare triple {2657#true} call #t~ret3 := main(); {2657#true} is VALID [2018-11-14 17:30:30,834 INFO L273 TraceCheckUtils]: 4: Hoare triple {2657#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {2659#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:30,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {2659#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2659#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:30,835 INFO L273 TraceCheckUtils]: 6: Hoare triple {2659#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {2659#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:30,836 INFO L273 TraceCheckUtils]: 7: Hoare triple {2659#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2659#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:30,837 INFO L273 TraceCheckUtils]: 8: Hoare triple {2659#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:30,837 INFO L256 TraceCheckUtils]: 9: Hoare triple {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2657#true} is VALID [2018-11-14 17:30:30,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {2657#true} ~cond := #in~cond; {2657#true} is VALID [2018-11-14 17:30:30,838 INFO L273 TraceCheckUtils]: 11: Hoare triple {2657#true} assume !(~cond == 0); {2657#true} is VALID [2018-11-14 17:30:30,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 17:30:30,839 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2657#true} {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:30,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:30,840 INFO L273 TraceCheckUtils]: 15: Hoare triple {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:30,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:30,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:30,842 INFO L256 TraceCheckUtils]: 18: Hoare triple {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2657#true} is VALID [2018-11-14 17:30:30,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {2657#true} ~cond := #in~cond; {2657#true} is VALID [2018-11-14 17:30:30,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {2657#true} assume !(~cond == 0); {2657#true} is VALID [2018-11-14 17:30:30,842 INFO L273 TraceCheckUtils]: 21: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 17:30:30,843 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2657#true} {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #43#return; {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:30,844 INFO L273 TraceCheckUtils]: 23: Hoare triple {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:30,844 INFO L273 TraceCheckUtils]: 24: Hoare triple {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:30,844 INFO L273 TraceCheckUtils]: 25: Hoare triple {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:30,845 INFO L273 TraceCheckUtils]: 26: Hoare triple {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:30,845 INFO L256 TraceCheckUtils]: 27: Hoare triple {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2657#true} is VALID [2018-11-14 17:30:30,845 INFO L273 TraceCheckUtils]: 28: Hoare triple {2657#true} ~cond := #in~cond; {2657#true} is VALID [2018-11-14 17:30:30,845 INFO L273 TraceCheckUtils]: 29: Hoare triple {2657#true} assume !(~cond == 0); {2657#true} is VALID [2018-11-14 17:30:30,846 INFO L273 TraceCheckUtils]: 30: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 17:30:30,846 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2657#true} {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #43#return; {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:30,846 INFO L273 TraceCheckUtils]: 32: Hoare triple {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:30,847 INFO L273 TraceCheckUtils]: 33: Hoare triple {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:30,848 INFO L273 TraceCheckUtils]: 34: Hoare triple {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:30,849 INFO L273 TraceCheckUtils]: 35: Hoare triple {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:30,849 INFO L256 TraceCheckUtils]: 36: Hoare triple {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2657#true} is VALID [2018-11-14 17:30:30,849 INFO L273 TraceCheckUtils]: 37: Hoare triple {2657#true} ~cond := #in~cond; {2657#true} is VALID [2018-11-14 17:30:30,849 INFO L273 TraceCheckUtils]: 38: Hoare triple {2657#true} assume !(~cond == 0); {2657#true} is VALID [2018-11-14 17:30:30,850 INFO L273 TraceCheckUtils]: 39: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 17:30:30,850 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2657#true} {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #43#return; {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:30,851 INFO L273 TraceCheckUtils]: 41: Hoare triple {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:30,851 INFO L273 TraceCheckUtils]: 42: Hoare triple {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:30,852 INFO L273 TraceCheckUtils]: 43: Hoare triple {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:30,852 INFO L273 TraceCheckUtils]: 44: Hoare triple {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:30,852 INFO L256 TraceCheckUtils]: 45: Hoare triple {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2657#true} is VALID [2018-11-14 17:30:30,852 INFO L273 TraceCheckUtils]: 46: Hoare triple {2657#true} ~cond := #in~cond; {2657#true} is VALID [2018-11-14 17:30:30,852 INFO L273 TraceCheckUtils]: 47: Hoare triple {2657#true} assume !(~cond == 0); {2657#true} is VALID [2018-11-14 17:30:30,853 INFO L273 TraceCheckUtils]: 48: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 17:30:30,853 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2657#true} {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #43#return; {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:30,853 INFO L273 TraceCheckUtils]: 50: Hoare triple {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:30,854 INFO L273 TraceCheckUtils]: 51: Hoare triple {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:30,854 INFO L273 TraceCheckUtils]: 52: Hoare triple {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:30,855 INFO L273 TraceCheckUtils]: 53: Hoare triple {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:30,855 INFO L256 TraceCheckUtils]: 54: Hoare triple {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2657#true} is VALID [2018-11-14 17:30:30,855 INFO L273 TraceCheckUtils]: 55: Hoare triple {2657#true} ~cond := #in~cond; {2657#true} is VALID [2018-11-14 17:30:30,855 INFO L273 TraceCheckUtils]: 56: Hoare triple {2657#true} assume !(~cond == 0); {2657#true} is VALID [2018-11-14 17:30:30,855 INFO L273 TraceCheckUtils]: 57: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 17:30:30,856 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {2657#true} {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #43#return; {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:30,856 INFO L273 TraceCheckUtils]: 59: Hoare triple {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:30,857 INFO L273 TraceCheckUtils]: 60: Hoare triple {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !false; {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:30,857 INFO L273 TraceCheckUtils]: 61: Hoare triple {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:30,858 INFO L273 TraceCheckUtils]: 62: Hoare triple {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2666#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:30,859 INFO L256 TraceCheckUtils]: 63: Hoare triple {2666#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2657#true} is VALID [2018-11-14 17:30:30,859 INFO L273 TraceCheckUtils]: 64: Hoare triple {2657#true} ~cond := #in~cond; {2657#true} is VALID [2018-11-14 17:30:30,859 INFO L273 TraceCheckUtils]: 65: Hoare triple {2657#true} assume !(~cond == 0); {2657#true} is VALID [2018-11-14 17:30:30,859 INFO L273 TraceCheckUtils]: 66: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 17:30:30,860 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {2657#true} {2666#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} #43#return; {2666#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:30,861 INFO L273 TraceCheckUtils]: 68: Hoare triple {2666#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {2666#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:30,861 INFO L273 TraceCheckUtils]: 69: Hoare triple {2666#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !false; {2666#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:30,862 INFO L273 TraceCheckUtils]: 70: Hoare triple {2666#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10); {2658#false} is VALID [2018-11-14 17:30:30,862 INFO L273 TraceCheckUtils]: 71: Hoare triple {2658#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2658#false} is VALID [2018-11-14 17:30:30,862 INFO L256 TraceCheckUtils]: 72: Hoare triple {2658#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2658#false} is VALID [2018-11-14 17:30:30,862 INFO L273 TraceCheckUtils]: 73: Hoare triple {2658#false} ~cond := #in~cond; {2658#false} is VALID [2018-11-14 17:30:30,862 INFO L273 TraceCheckUtils]: 74: Hoare triple {2658#false} assume ~cond == 0; {2658#false} is VALID [2018-11-14 17:30:30,863 INFO L273 TraceCheckUtils]: 75: Hoare triple {2658#false} assume !false; {2658#false} is VALID [2018-11-14 17:30:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 28 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-14 17:30:30,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:30:30,870 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:30:30,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:30:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:30,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:30:31,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {2657#true} call ULTIMATE.init(); {2657#true} is VALID [2018-11-14 17:30:31,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 17:30:31,274 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2657#true} {2657#true} #39#return; {2657#true} is VALID [2018-11-14 17:30:31,275 INFO L256 TraceCheckUtils]: 3: Hoare triple {2657#true} call #t~ret3 := main(); {2657#true} is VALID [2018-11-14 17:30:31,275 INFO L273 TraceCheckUtils]: 4: Hoare triple {2657#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {2659#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:31,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {2659#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2659#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:31,276 INFO L273 TraceCheckUtils]: 6: Hoare triple {2659#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {2659#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:31,276 INFO L273 TraceCheckUtils]: 7: Hoare triple {2659#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2659#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:31,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {2659#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:31,277 INFO L256 TraceCheckUtils]: 9: Hoare triple {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2657#true} is VALID [2018-11-14 17:30:31,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {2657#true} ~cond := #in~cond; {2657#true} is VALID [2018-11-14 17:30:31,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {2657#true} assume !(~cond == 0); {2657#true} is VALID [2018-11-14 17:30:31,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 17:30:31,278 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2657#true} {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:31,279 INFO L273 TraceCheckUtils]: 14: Hoare triple {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:31,280 INFO L273 TraceCheckUtils]: 15: Hoare triple {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:31,281 INFO L273 TraceCheckUtils]: 16: Hoare triple {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:31,281 INFO L273 TraceCheckUtils]: 17: Hoare triple {2660#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:31,282 INFO L256 TraceCheckUtils]: 18: Hoare triple {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2657#true} is VALID [2018-11-14 17:30:31,282 INFO L273 TraceCheckUtils]: 19: Hoare triple {2657#true} ~cond := #in~cond; {2657#true} is VALID [2018-11-14 17:30:31,282 INFO L273 TraceCheckUtils]: 20: Hoare triple {2657#true} assume !(~cond == 0); {2657#true} is VALID [2018-11-14 17:30:31,283 INFO L273 TraceCheckUtils]: 21: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 17:30:31,300 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2657#true} {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #43#return; {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:31,306 INFO L273 TraceCheckUtils]: 23: Hoare triple {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:31,306 INFO L273 TraceCheckUtils]: 24: Hoare triple {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:31,307 INFO L273 TraceCheckUtils]: 25: Hoare triple {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:31,307 INFO L273 TraceCheckUtils]: 26: Hoare triple {2661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:31,307 INFO L256 TraceCheckUtils]: 27: Hoare triple {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2657#true} is VALID [2018-11-14 17:30:31,308 INFO L273 TraceCheckUtils]: 28: Hoare triple {2657#true} ~cond := #in~cond; {2657#true} is VALID [2018-11-14 17:30:31,308 INFO L273 TraceCheckUtils]: 29: Hoare triple {2657#true} assume !(~cond == 0); {2657#true} is VALID [2018-11-14 17:30:31,308 INFO L273 TraceCheckUtils]: 30: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 17:30:31,308 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {2657#true} {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #43#return; {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:31,309 INFO L273 TraceCheckUtils]: 32: Hoare triple {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:31,309 INFO L273 TraceCheckUtils]: 33: Hoare triple {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:31,310 INFO L273 TraceCheckUtils]: 34: Hoare triple {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:31,311 INFO L273 TraceCheckUtils]: 35: Hoare triple {2662#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:31,311 INFO L256 TraceCheckUtils]: 36: Hoare triple {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2657#true} is VALID [2018-11-14 17:30:31,311 INFO L273 TraceCheckUtils]: 37: Hoare triple {2657#true} ~cond := #in~cond; {2657#true} is VALID [2018-11-14 17:30:31,311 INFO L273 TraceCheckUtils]: 38: Hoare triple {2657#true} assume !(~cond == 0); {2657#true} is VALID [2018-11-14 17:30:31,311 INFO L273 TraceCheckUtils]: 39: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 17:30:31,312 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2657#true} {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #43#return; {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:31,313 INFO L273 TraceCheckUtils]: 41: Hoare triple {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:31,315 INFO L273 TraceCheckUtils]: 42: Hoare triple {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:31,315 INFO L273 TraceCheckUtils]: 43: Hoare triple {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:31,316 INFO L273 TraceCheckUtils]: 44: Hoare triple {2663#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:31,316 INFO L256 TraceCheckUtils]: 45: Hoare triple {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2657#true} is VALID [2018-11-14 17:30:31,316 INFO L273 TraceCheckUtils]: 46: Hoare triple {2657#true} ~cond := #in~cond; {2657#true} is VALID [2018-11-14 17:30:31,316 INFO L273 TraceCheckUtils]: 47: Hoare triple {2657#true} assume !(~cond == 0); {2657#true} is VALID [2018-11-14 17:30:31,316 INFO L273 TraceCheckUtils]: 48: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 17:30:31,317 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2657#true} {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #43#return; {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:31,318 INFO L273 TraceCheckUtils]: 50: Hoare triple {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:31,318 INFO L273 TraceCheckUtils]: 51: Hoare triple {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:31,318 INFO L273 TraceCheckUtils]: 52: Hoare triple {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:31,319 INFO L273 TraceCheckUtils]: 53: Hoare triple {2664#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:31,319 INFO L256 TraceCheckUtils]: 54: Hoare triple {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2657#true} is VALID [2018-11-14 17:30:31,319 INFO L273 TraceCheckUtils]: 55: Hoare triple {2657#true} ~cond := #in~cond; {2657#true} is VALID [2018-11-14 17:30:31,319 INFO L273 TraceCheckUtils]: 56: Hoare triple {2657#true} assume !(~cond == 0); {2657#true} is VALID [2018-11-14 17:30:31,319 INFO L273 TraceCheckUtils]: 57: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 17:30:31,320 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {2657#true} {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #43#return; {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:31,320 INFO L273 TraceCheckUtils]: 59: Hoare triple {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:31,321 INFO L273 TraceCheckUtils]: 60: Hoare triple {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !false; {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:31,322 INFO L273 TraceCheckUtils]: 61: Hoare triple {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:31,323 INFO L273 TraceCheckUtils]: 62: Hoare triple {2665#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2856#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:31,323 INFO L256 TraceCheckUtils]: 63: Hoare triple {2856#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2657#true} is VALID [2018-11-14 17:30:31,323 INFO L273 TraceCheckUtils]: 64: Hoare triple {2657#true} ~cond := #in~cond; {2657#true} is VALID [2018-11-14 17:30:31,323 INFO L273 TraceCheckUtils]: 65: Hoare triple {2657#true} assume !(~cond == 0); {2657#true} is VALID [2018-11-14 17:30:31,324 INFO L273 TraceCheckUtils]: 66: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-14 17:30:31,324 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {2657#true} {2856#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #43#return; {2856#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:31,325 INFO L273 TraceCheckUtils]: 68: Hoare triple {2856#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {2856#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:31,325 INFO L273 TraceCheckUtils]: 69: Hoare triple {2856#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {2856#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:31,326 INFO L273 TraceCheckUtils]: 70: Hoare triple {2856#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 10); {2658#false} is VALID [2018-11-14 17:30:31,326 INFO L273 TraceCheckUtils]: 71: Hoare triple {2658#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {2658#false} is VALID [2018-11-14 17:30:31,326 INFO L256 TraceCheckUtils]: 72: Hoare triple {2658#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {2658#false} is VALID [2018-11-14 17:30:31,326 INFO L273 TraceCheckUtils]: 73: Hoare triple {2658#false} ~cond := #in~cond; {2658#false} is VALID [2018-11-14 17:30:31,326 INFO L273 TraceCheckUtils]: 74: Hoare triple {2658#false} assume ~cond == 0; {2658#false} is VALID [2018-11-14 17:30:31,326 INFO L273 TraceCheckUtils]: 75: Hoare triple {2658#false} assume !false; {2658#false} is VALID [2018-11-14 17:30:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 28 proven. 126 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-14 17:30:31,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:30:31,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 17:30:31,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2018-11-14 17:30:31,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:30:31,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:30:31,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:30:31,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:30:31,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:30:31,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:30:31,416 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 11 states. [2018-11-14 17:30:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:32,457 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2018-11-14 17:30:32,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:30:32,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 76 [2018-11-14 17:30:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:30:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:30:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2018-11-14 17:30:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:30:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 76 transitions. [2018-11-14 17:30:32,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 76 transitions. [2018-11-14 17:30:32,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:30:32,548 INFO L225 Difference]: With dead ends: 75 [2018-11-14 17:30:32,548 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 17:30:32,549 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:30:32,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 17:30:32,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-14 17:30:32,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:30:32,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 63 states. [2018-11-14 17:30:32,752 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 63 states. [2018-11-14 17:30:32,752 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 63 states. [2018-11-14 17:30:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:32,762 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-14 17:30:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-14 17:30:32,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:32,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:32,763 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 64 states. [2018-11-14 17:30:32,763 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 64 states. [2018-11-14 17:30:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:32,770 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-14 17:30:32,770 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-14 17:30:32,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:32,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:32,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:30:32,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:30:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-14 17:30:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-11-14 17:30:32,774 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 76 [2018-11-14 17:30:32,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:30:32,775 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-11-14 17:30:32,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:30:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-11-14 17:30:32,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-14 17:30:32,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:30:32,776 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:30:32,777 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:30:32,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:30:32,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2013053603, now seen corresponding path program 8 times [2018-11-14 17:30:32,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:30:32,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:30:32,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:32,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:30:32,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:33,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {3214#true} call ULTIMATE.init(); {3214#true} is VALID [2018-11-14 17:30:33,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,069 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3214#true} {3214#true} #39#return; {3214#true} is VALID [2018-11-14 17:30:33,069 INFO L256 TraceCheckUtils]: 3: Hoare triple {3214#true} call #t~ret3 := main(); {3214#true} is VALID [2018-11-14 17:30:33,070 INFO L273 TraceCheckUtils]: 4: Hoare triple {3214#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {3216#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:33,071 INFO L273 TraceCheckUtils]: 5: Hoare triple {3216#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3216#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:33,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {3216#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {3216#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:33,072 INFO L273 TraceCheckUtils]: 7: Hoare triple {3216#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3216#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:33,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {3216#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:33,073 INFO L256 TraceCheckUtils]: 9: Hoare triple {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3214#true} is VALID [2018-11-14 17:30:33,073 INFO L273 TraceCheckUtils]: 10: Hoare triple {3214#true} ~cond := #in~cond; {3214#true} is VALID [2018-11-14 17:30:33,073 INFO L273 TraceCheckUtils]: 11: Hoare triple {3214#true} assume !(~cond == 0); {3214#true} is VALID [2018-11-14 17:30:33,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,074 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {3214#true} {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:33,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:33,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:33,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:33,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:33,076 INFO L256 TraceCheckUtils]: 18: Hoare triple {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3214#true} is VALID [2018-11-14 17:30:33,076 INFO L273 TraceCheckUtils]: 19: Hoare triple {3214#true} ~cond := #in~cond; {3214#true} is VALID [2018-11-14 17:30:33,076 INFO L273 TraceCheckUtils]: 20: Hoare triple {3214#true} assume !(~cond == 0); {3214#true} is VALID [2018-11-14 17:30:33,077 INFO L273 TraceCheckUtils]: 21: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,077 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {3214#true} {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #43#return; {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:33,078 INFO L273 TraceCheckUtils]: 23: Hoare triple {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:33,079 INFO L273 TraceCheckUtils]: 24: Hoare triple {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:33,079 INFO L273 TraceCheckUtils]: 25: Hoare triple {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:33,080 INFO L273 TraceCheckUtils]: 26: Hoare triple {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:33,080 INFO L256 TraceCheckUtils]: 27: Hoare triple {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3214#true} is VALID [2018-11-14 17:30:33,081 INFO L273 TraceCheckUtils]: 28: Hoare triple {3214#true} ~cond := #in~cond; {3214#true} is VALID [2018-11-14 17:30:33,081 INFO L273 TraceCheckUtils]: 29: Hoare triple {3214#true} assume !(~cond == 0); {3214#true} is VALID [2018-11-14 17:30:33,081 INFO L273 TraceCheckUtils]: 30: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,082 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3214#true} {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #43#return; {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:33,082 INFO L273 TraceCheckUtils]: 32: Hoare triple {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:33,083 INFO L273 TraceCheckUtils]: 33: Hoare triple {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:33,088 INFO L273 TraceCheckUtils]: 34: Hoare triple {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:33,089 INFO L273 TraceCheckUtils]: 35: Hoare triple {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:33,089 INFO L256 TraceCheckUtils]: 36: Hoare triple {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3214#true} is VALID [2018-11-14 17:30:33,089 INFO L273 TraceCheckUtils]: 37: Hoare triple {3214#true} ~cond := #in~cond; {3214#true} is VALID [2018-11-14 17:30:33,089 INFO L273 TraceCheckUtils]: 38: Hoare triple {3214#true} assume !(~cond == 0); {3214#true} is VALID [2018-11-14 17:30:33,089 INFO L273 TraceCheckUtils]: 39: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,090 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3214#true} {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #43#return; {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:33,090 INFO L273 TraceCheckUtils]: 41: Hoare triple {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:33,091 INFO L273 TraceCheckUtils]: 42: Hoare triple {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:33,091 INFO L273 TraceCheckUtils]: 43: Hoare triple {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:33,091 INFO L273 TraceCheckUtils]: 44: Hoare triple {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:33,092 INFO L256 TraceCheckUtils]: 45: Hoare triple {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3214#true} is VALID [2018-11-14 17:30:33,092 INFO L273 TraceCheckUtils]: 46: Hoare triple {3214#true} ~cond := #in~cond; {3214#true} is VALID [2018-11-14 17:30:33,092 INFO L273 TraceCheckUtils]: 47: Hoare triple {3214#true} assume !(~cond == 0); {3214#true} is VALID [2018-11-14 17:30:33,092 INFO L273 TraceCheckUtils]: 48: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,111 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {3214#true} {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #43#return; {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:33,120 INFO L273 TraceCheckUtils]: 50: Hoare triple {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:33,132 INFO L273 TraceCheckUtils]: 51: Hoare triple {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:33,133 INFO L273 TraceCheckUtils]: 52: Hoare triple {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:33,133 INFO L273 TraceCheckUtils]: 53: Hoare triple {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:33,134 INFO L256 TraceCheckUtils]: 54: Hoare triple {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3214#true} is VALID [2018-11-14 17:30:33,134 INFO L273 TraceCheckUtils]: 55: Hoare triple {3214#true} ~cond := #in~cond; {3214#true} is VALID [2018-11-14 17:30:33,134 INFO L273 TraceCheckUtils]: 56: Hoare triple {3214#true} assume !(~cond == 0); {3214#true} is VALID [2018-11-14 17:30:33,134 INFO L273 TraceCheckUtils]: 57: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,151 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3214#true} {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #43#return; {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:33,160 INFO L273 TraceCheckUtils]: 59: Hoare triple {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:33,169 INFO L273 TraceCheckUtils]: 60: Hoare triple {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !false; {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:33,169 INFO L273 TraceCheckUtils]: 61: Hoare triple {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:33,174 INFO L273 TraceCheckUtils]: 62: Hoare triple {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:33,174 INFO L256 TraceCheckUtils]: 63: Hoare triple {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3214#true} is VALID [2018-11-14 17:30:33,174 INFO L273 TraceCheckUtils]: 64: Hoare triple {3214#true} ~cond := #in~cond; {3214#true} is VALID [2018-11-14 17:30:33,174 INFO L273 TraceCheckUtils]: 65: Hoare triple {3214#true} assume !(~cond == 0); {3214#true} is VALID [2018-11-14 17:30:33,174 INFO L273 TraceCheckUtils]: 66: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,192 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {3214#true} {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #43#return; {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:33,201 INFO L273 TraceCheckUtils]: 68: Hoare triple {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:33,213 INFO L273 TraceCheckUtils]: 69: Hoare triple {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:33,228 INFO L273 TraceCheckUtils]: 70: Hoare triple {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:33,237 INFO L273 TraceCheckUtils]: 71: Hoare triple {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3224#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:33,237 INFO L256 TraceCheckUtils]: 72: Hoare triple {3224#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3214#true} is VALID [2018-11-14 17:30:33,237 INFO L273 TraceCheckUtils]: 73: Hoare triple {3214#true} ~cond := #in~cond; {3214#true} is VALID [2018-11-14 17:30:33,237 INFO L273 TraceCheckUtils]: 74: Hoare triple {3214#true} assume !(~cond == 0); {3214#true} is VALID [2018-11-14 17:30:33,237 INFO L273 TraceCheckUtils]: 75: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,246 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {3214#true} {3224#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} #43#return; {3224#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:33,247 INFO L273 TraceCheckUtils]: 77: Hoare triple {3224#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {3224#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:33,248 INFO L273 TraceCheckUtils]: 78: Hoare triple {3224#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !false; {3224#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:33,248 INFO L273 TraceCheckUtils]: 79: Hoare triple {3224#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10); {3215#false} is VALID [2018-11-14 17:30:33,248 INFO L273 TraceCheckUtils]: 80: Hoare triple {3215#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3215#false} is VALID [2018-11-14 17:30:33,249 INFO L256 TraceCheckUtils]: 81: Hoare triple {3215#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3215#false} is VALID [2018-11-14 17:30:33,249 INFO L273 TraceCheckUtils]: 82: Hoare triple {3215#false} ~cond := #in~cond; {3215#false} is VALID [2018-11-14 17:30:33,249 INFO L273 TraceCheckUtils]: 83: Hoare triple {3215#false} assume ~cond == 0; {3215#false} is VALID [2018-11-14 17:30:33,249 INFO L273 TraceCheckUtils]: 84: Hoare triple {3215#false} assume !false; {3215#false} is VALID [2018-11-14 17:30:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 32 proven. 164 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-14 17:30:33,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:30:33,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:30:33,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:30:33,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:30:33,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:30:33,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:33,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:30:33,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {3214#true} call ULTIMATE.init(); {3214#true} is VALID [2018-11-14 17:30:33,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,671 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3214#true} {3214#true} #39#return; {3214#true} is VALID [2018-11-14 17:30:33,671 INFO L256 TraceCheckUtils]: 3: Hoare triple {3214#true} call #t~ret3 := main(); {3214#true} is VALID [2018-11-14 17:30:33,672 INFO L273 TraceCheckUtils]: 4: Hoare triple {3214#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {3216#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:33,672 INFO L273 TraceCheckUtils]: 5: Hoare triple {3216#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3216#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:33,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {3216#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {3216#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:33,673 INFO L273 TraceCheckUtils]: 7: Hoare triple {3216#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3216#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:33,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {3216#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:33,674 INFO L256 TraceCheckUtils]: 9: Hoare triple {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3214#true} is VALID [2018-11-14 17:30:33,674 INFO L273 TraceCheckUtils]: 10: Hoare triple {3214#true} ~cond := #in~cond; {3214#true} is VALID [2018-11-14 17:30:33,674 INFO L273 TraceCheckUtils]: 11: Hoare triple {3214#true} assume !(~cond == 0); {3214#true} is VALID [2018-11-14 17:30:33,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,675 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {3214#true} {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:33,676 INFO L273 TraceCheckUtils]: 14: Hoare triple {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:33,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:33,677 INFO L273 TraceCheckUtils]: 16: Hoare triple {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:33,677 INFO L273 TraceCheckUtils]: 17: Hoare triple {3217#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:33,678 INFO L256 TraceCheckUtils]: 18: Hoare triple {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3214#true} is VALID [2018-11-14 17:30:33,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {3214#true} ~cond := #in~cond; {3214#true} is VALID [2018-11-14 17:30:33,678 INFO L273 TraceCheckUtils]: 20: Hoare triple {3214#true} assume !(~cond == 0); {3214#true} is VALID [2018-11-14 17:30:33,678 INFO L273 TraceCheckUtils]: 21: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,679 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {3214#true} {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #43#return; {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:33,679 INFO L273 TraceCheckUtils]: 23: Hoare triple {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:33,680 INFO L273 TraceCheckUtils]: 24: Hoare triple {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:33,681 INFO L273 TraceCheckUtils]: 25: Hoare triple {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:33,681 INFO L273 TraceCheckUtils]: 26: Hoare triple {3218#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:33,682 INFO L256 TraceCheckUtils]: 27: Hoare triple {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3214#true} is VALID [2018-11-14 17:30:33,682 INFO L273 TraceCheckUtils]: 28: Hoare triple {3214#true} ~cond := #in~cond; {3214#true} is VALID [2018-11-14 17:30:33,682 INFO L273 TraceCheckUtils]: 29: Hoare triple {3214#true} assume !(~cond == 0); {3214#true} is VALID [2018-11-14 17:30:33,682 INFO L273 TraceCheckUtils]: 30: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,683 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3214#true} {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #43#return; {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:33,684 INFO L273 TraceCheckUtils]: 32: Hoare triple {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:33,684 INFO L273 TraceCheckUtils]: 33: Hoare triple {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:33,685 INFO L273 TraceCheckUtils]: 34: Hoare triple {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:33,685 INFO L273 TraceCheckUtils]: 35: Hoare triple {3219#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:33,685 INFO L256 TraceCheckUtils]: 36: Hoare triple {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3214#true} is VALID [2018-11-14 17:30:33,685 INFO L273 TraceCheckUtils]: 37: Hoare triple {3214#true} ~cond := #in~cond; {3214#true} is VALID [2018-11-14 17:30:33,685 INFO L273 TraceCheckUtils]: 38: Hoare triple {3214#true} assume !(~cond == 0); {3214#true} is VALID [2018-11-14 17:30:33,686 INFO L273 TraceCheckUtils]: 39: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,686 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3214#true} {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #43#return; {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:33,687 INFO L273 TraceCheckUtils]: 41: Hoare triple {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:33,688 INFO L273 TraceCheckUtils]: 42: Hoare triple {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:33,688 INFO L273 TraceCheckUtils]: 43: Hoare triple {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:33,689 INFO L273 TraceCheckUtils]: 44: Hoare triple {3220#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:33,689 INFO L256 TraceCheckUtils]: 45: Hoare triple {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3214#true} is VALID [2018-11-14 17:30:33,689 INFO L273 TraceCheckUtils]: 46: Hoare triple {3214#true} ~cond := #in~cond; {3214#true} is VALID [2018-11-14 17:30:33,689 INFO L273 TraceCheckUtils]: 47: Hoare triple {3214#true} assume !(~cond == 0); {3214#true} is VALID [2018-11-14 17:30:33,689 INFO L273 TraceCheckUtils]: 48: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,690 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {3214#true} {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #43#return; {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:33,690 INFO L273 TraceCheckUtils]: 50: Hoare triple {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:33,690 INFO L273 TraceCheckUtils]: 51: Hoare triple {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:33,691 INFO L273 TraceCheckUtils]: 52: Hoare triple {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:33,692 INFO L273 TraceCheckUtils]: 53: Hoare triple {3221#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:33,692 INFO L256 TraceCheckUtils]: 54: Hoare triple {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3214#true} is VALID [2018-11-14 17:30:33,692 INFO L273 TraceCheckUtils]: 55: Hoare triple {3214#true} ~cond := #in~cond; {3214#true} is VALID [2018-11-14 17:30:33,692 INFO L273 TraceCheckUtils]: 56: Hoare triple {3214#true} assume !(~cond == 0); {3214#true} is VALID [2018-11-14 17:30:33,693 INFO L273 TraceCheckUtils]: 57: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,693 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3214#true} {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #43#return; {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:33,694 INFO L273 TraceCheckUtils]: 59: Hoare triple {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:33,695 INFO L273 TraceCheckUtils]: 60: Hoare triple {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !false; {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:33,695 INFO L273 TraceCheckUtils]: 61: Hoare triple {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:33,696 INFO L273 TraceCheckUtils]: 62: Hoare triple {3222#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:33,696 INFO L256 TraceCheckUtils]: 63: Hoare triple {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3214#true} is VALID [2018-11-14 17:30:33,696 INFO L273 TraceCheckUtils]: 64: Hoare triple {3214#true} ~cond := #in~cond; {3214#true} is VALID [2018-11-14 17:30:33,696 INFO L273 TraceCheckUtils]: 65: Hoare triple {3214#true} assume !(~cond == 0); {3214#true} is VALID [2018-11-14 17:30:33,696 INFO L273 TraceCheckUtils]: 66: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,697 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {3214#true} {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #43#return; {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:33,697 INFO L273 TraceCheckUtils]: 68: Hoare triple {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:33,697 INFO L273 TraceCheckUtils]: 69: Hoare triple {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:33,698 INFO L273 TraceCheckUtils]: 70: Hoare triple {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:33,699 INFO L273 TraceCheckUtils]: 71: Hoare triple {3223#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3441#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:30:33,699 INFO L256 TraceCheckUtils]: 72: Hoare triple {3441#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3214#true} is VALID [2018-11-14 17:30:33,699 INFO L273 TraceCheckUtils]: 73: Hoare triple {3214#true} ~cond := #in~cond; {3214#true} is VALID [2018-11-14 17:30:33,699 INFO L273 TraceCheckUtils]: 74: Hoare triple {3214#true} assume !(~cond == 0); {3214#true} is VALID [2018-11-14 17:30:33,700 INFO L273 TraceCheckUtils]: 75: Hoare triple {3214#true} assume true; {3214#true} is VALID [2018-11-14 17:30:33,700 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {3214#true} {3441#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #43#return; {3441#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:30:33,701 INFO L273 TraceCheckUtils]: 77: Hoare triple {3441#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {3441#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:30:33,702 INFO L273 TraceCheckUtils]: 78: Hoare triple {3441#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !false; {3441#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:30:33,702 INFO L273 TraceCheckUtils]: 79: Hoare triple {3441#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 10); {3215#false} is VALID [2018-11-14 17:30:33,702 INFO L273 TraceCheckUtils]: 80: Hoare triple {3215#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3215#false} is VALID [2018-11-14 17:30:33,703 INFO L256 TraceCheckUtils]: 81: Hoare triple {3215#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3215#false} is VALID [2018-11-14 17:30:33,703 INFO L273 TraceCheckUtils]: 82: Hoare triple {3215#false} ~cond := #in~cond; {3215#false} is VALID [2018-11-14 17:30:33,703 INFO L273 TraceCheckUtils]: 83: Hoare triple {3215#false} assume ~cond == 0; {3215#false} is VALID [2018-11-14 17:30:33,703 INFO L273 TraceCheckUtils]: 84: Hoare triple {3215#false} assume !false; {3215#false} is VALID [2018-11-14 17:30:33,709 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 32 proven. 164 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-14 17:30:33,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:30:33,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 17:30:33,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2018-11-14 17:30:33,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:30:33,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:30:33,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:30:33,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:30:33,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:30:33,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:30:33,796 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 12 states. [2018-11-14 17:30:35,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:35,037 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-11-14 17:30:35,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:30:35,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2018-11-14 17:30:35,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:30:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:30:35,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-14 17:30:35,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:30:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-14 17:30:35,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 82 transitions. [2018-11-14 17:30:35,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:30:35,129 INFO L225 Difference]: With dead ends: 80 [2018-11-14 17:30:35,130 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 17:30:35,130 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:30:35,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 17:30:35,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-14 17:30:35,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:30:35,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 68 states. [2018-11-14 17:30:35,209 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 68 states. [2018-11-14 17:30:35,210 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 68 states. [2018-11-14 17:30:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:35,213 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-11-14 17:30:35,213 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-11-14 17:30:35,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:35,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:35,214 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 69 states. [2018-11-14 17:30:35,214 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 69 states. [2018-11-14 17:30:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:30:35,216 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2018-11-14 17:30:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-11-14 17:30:35,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:30:35,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:30:35,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:30:35,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:30:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 17:30:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-11-14 17:30:35,220 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 85 [2018-11-14 17:30:35,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:30:35,220 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-11-14 17:30:35,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:30:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2018-11-14 17:30:35,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-14 17:30:35,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:30:35,222 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:30:35,222 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:30:35,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:30:35,222 INFO L82 PathProgramCache]: Analyzing trace with hash 485961569, now seen corresponding path program 9 times [2018-11-14 17:30:35,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:30:35,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:30:35,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:35,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:30:35,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:30:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:30:35,499 INFO L256 TraceCheckUtils]: 0: Hoare triple {3823#true} call ULTIMATE.init(); {3823#true} is VALID [2018-11-14 17:30:35,499 INFO L273 TraceCheckUtils]: 1: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:30:35,500 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3823#true} {3823#true} #39#return; {3823#true} is VALID [2018-11-14 17:30:35,500 INFO L256 TraceCheckUtils]: 3: Hoare triple {3823#true} call #t~ret3 := main(); {3823#true} is VALID [2018-11-14 17:30:35,500 INFO L273 TraceCheckUtils]: 4: Hoare triple {3823#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {3825#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:35,500 INFO L273 TraceCheckUtils]: 5: Hoare triple {3825#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3825#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:35,501 INFO L273 TraceCheckUtils]: 6: Hoare triple {3825#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {3825#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:35,501 INFO L273 TraceCheckUtils]: 7: Hoare triple {3825#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3825#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:30:35,502 INFO L273 TraceCheckUtils]: 8: Hoare triple {3825#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:35,502 INFO L256 TraceCheckUtils]: 9: Hoare triple {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:30:35,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:30:35,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:30:35,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:30:35,504 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {3823#true} {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:35,505 INFO L273 TraceCheckUtils]: 14: Hoare triple {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:35,505 INFO L273 TraceCheckUtils]: 15: Hoare triple {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:35,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:30:35,507 INFO L273 TraceCheckUtils]: 17: Hoare triple {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:35,507 INFO L256 TraceCheckUtils]: 18: Hoare triple {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:30:35,507 INFO L273 TraceCheckUtils]: 19: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:30:35,507 INFO L273 TraceCheckUtils]: 20: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:30:35,508 INFO L273 TraceCheckUtils]: 21: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:30:35,508 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {3823#true} {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #43#return; {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:35,509 INFO L273 TraceCheckUtils]: 23: Hoare triple {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:35,510 INFO L273 TraceCheckUtils]: 24: Hoare triple {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:35,510 INFO L273 TraceCheckUtils]: 25: Hoare triple {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:30:35,511 INFO L273 TraceCheckUtils]: 26: Hoare triple {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:35,511 INFO L256 TraceCheckUtils]: 27: Hoare triple {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:30:35,512 INFO L273 TraceCheckUtils]: 28: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:30:35,512 INFO L273 TraceCheckUtils]: 29: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:30:35,512 INFO L273 TraceCheckUtils]: 30: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:30:35,513 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3823#true} {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #43#return; {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:35,513 INFO L273 TraceCheckUtils]: 32: Hoare triple {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:35,514 INFO L273 TraceCheckUtils]: 33: Hoare triple {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:35,515 INFO L273 TraceCheckUtils]: 34: Hoare triple {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:30:35,515 INFO L273 TraceCheckUtils]: 35: Hoare triple {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:35,515 INFO L256 TraceCheckUtils]: 36: Hoare triple {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:30:35,515 INFO L273 TraceCheckUtils]: 37: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:30:35,515 INFO L273 TraceCheckUtils]: 38: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:30:35,516 INFO L273 TraceCheckUtils]: 39: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:30:35,516 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3823#true} {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #43#return; {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:35,517 INFO L273 TraceCheckUtils]: 41: Hoare triple {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:35,517 INFO L273 TraceCheckUtils]: 42: Hoare triple {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:35,518 INFO L273 TraceCheckUtils]: 43: Hoare triple {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:30:35,519 INFO L273 TraceCheckUtils]: 44: Hoare triple {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:35,519 INFO L256 TraceCheckUtils]: 45: Hoare triple {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:30:35,519 INFO L273 TraceCheckUtils]: 46: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:30:35,519 INFO L273 TraceCheckUtils]: 47: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:30:35,519 INFO L273 TraceCheckUtils]: 48: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:30:35,520 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {3823#true} {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #43#return; {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:35,521 INFO L273 TraceCheckUtils]: 50: Hoare triple {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:35,522 INFO L273 TraceCheckUtils]: 51: Hoare triple {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:35,522 INFO L273 TraceCheckUtils]: 52: Hoare triple {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:30:35,523 INFO L273 TraceCheckUtils]: 53: Hoare triple {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:35,523 INFO L256 TraceCheckUtils]: 54: Hoare triple {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:30:35,523 INFO L273 TraceCheckUtils]: 55: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:30:35,523 INFO L273 TraceCheckUtils]: 56: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:30:35,523 INFO L273 TraceCheckUtils]: 57: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:30:35,524 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3823#true} {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #43#return; {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:35,524 INFO L273 TraceCheckUtils]: 59: Hoare triple {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:35,525 INFO L273 TraceCheckUtils]: 60: Hoare triple {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !false; {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:35,526 INFO L273 TraceCheckUtils]: 61: Hoare triple {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:30:35,526 INFO L273 TraceCheckUtils]: 62: Hoare triple {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:35,527 INFO L256 TraceCheckUtils]: 63: Hoare triple {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:30:35,527 INFO L273 TraceCheckUtils]: 64: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:30:35,527 INFO L273 TraceCheckUtils]: 65: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:30:35,527 INFO L273 TraceCheckUtils]: 66: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:30:35,528 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {3823#true} {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #43#return; {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:35,529 INFO L273 TraceCheckUtils]: 68: Hoare triple {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:35,529 INFO L273 TraceCheckUtils]: 69: Hoare triple {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:35,530 INFO L273 TraceCheckUtils]: 70: Hoare triple {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:30:35,530 INFO L273 TraceCheckUtils]: 71: Hoare triple {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:30:35,530 INFO L256 TraceCheckUtils]: 72: Hoare triple {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:30:35,530 INFO L273 TraceCheckUtils]: 73: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:30:35,531 INFO L273 TraceCheckUtils]: 74: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:30:35,531 INFO L273 TraceCheckUtils]: 75: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:30:35,531 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {3823#true} {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #43#return; {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:30:35,532 INFO L273 TraceCheckUtils]: 77: Hoare triple {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:30:35,532 INFO L273 TraceCheckUtils]: 78: Hoare triple {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !false; {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:30:35,533 INFO L273 TraceCheckUtils]: 79: Hoare triple {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:30:35,534 INFO L273 TraceCheckUtils]: 80: Hoare triple {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3834#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:35,534 INFO L256 TraceCheckUtils]: 81: Hoare triple {3834#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:30:35,534 INFO L273 TraceCheckUtils]: 82: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:30:35,534 INFO L273 TraceCheckUtils]: 83: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:30:35,534 INFO L273 TraceCheckUtils]: 84: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:30:35,535 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {3823#true} {3834#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} #43#return; {3834#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:35,536 INFO L273 TraceCheckUtils]: 86: Hoare triple {3834#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {3834#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:35,536 INFO L273 TraceCheckUtils]: 87: Hoare triple {3834#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !false; {3834#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:30:35,537 INFO L273 TraceCheckUtils]: 88: Hoare triple {3834#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10); {3824#false} is VALID [2018-11-14 17:30:35,537 INFO L273 TraceCheckUtils]: 89: Hoare triple {3824#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3824#false} is VALID [2018-11-14 17:30:35,537 INFO L256 TraceCheckUtils]: 90: Hoare triple {3824#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3824#false} is VALID [2018-11-14 17:30:35,537 INFO L273 TraceCheckUtils]: 91: Hoare triple {3824#false} ~cond := #in~cond; {3824#false} is VALID [2018-11-14 17:30:35,537 INFO L273 TraceCheckUtils]: 92: Hoare triple {3824#false} assume ~cond == 0; {3824#false} is VALID [2018-11-14 17:30:35,537 INFO L273 TraceCheckUtils]: 93: Hoare triple {3824#false} assume !false; {3824#false} is VALID [2018-11-14 17:30:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 36 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-14 17:30:35,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:30:35,548 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-14 17:30:35,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:31:23,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 17:31:23,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:31:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:31:23,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:31:23,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {3823#true} call ULTIMATE.init(); {3823#true} is VALID [2018-11-14 17:31:23,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:31:23,718 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3823#true} {3823#true} #39#return; {3823#true} is VALID [2018-11-14 17:31:23,718 INFO L256 TraceCheckUtils]: 3: Hoare triple {3823#true} call #t~ret3 := main(); {3823#true} is VALID [2018-11-14 17:31:23,718 INFO L273 TraceCheckUtils]: 4: Hoare triple {3823#true} ~sn~0 := 0;~loop1~0 := #t~nondet0;havoc #t~nondet0;~n1~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 0; {3825#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:31:23,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {3825#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {3825#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:31:23,719 INFO L273 TraceCheckUtils]: 6: Hoare triple {3825#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !false; {3825#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:31:23,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {3825#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3825#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:31:23,720 INFO L273 TraceCheckUtils]: 8: Hoare triple {3825#(and (<= main_~x~0 0) (<= 0 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:31:23,720 INFO L256 TraceCheckUtils]: 9: Hoare triple {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:31:23,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:31:23,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:31:23,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:31:23,721 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {3823#true} {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #43#return; {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:31:23,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume true; {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:31:23,722 INFO L273 TraceCheckUtils]: 15: Hoare triple {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !false; {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:31:23,722 INFO L273 TraceCheckUtils]: 16: Hoare triple {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-14 17:31:23,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {3826#(and (<= main_~x~0 1) (<= 1 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:31:23,723 INFO L256 TraceCheckUtils]: 18: Hoare triple {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:31:23,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:31:23,724 INFO L273 TraceCheckUtils]: 20: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:31:23,724 INFO L273 TraceCheckUtils]: 21: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:31:23,725 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {3823#true} {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #43#return; {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:31:23,726 INFO L273 TraceCheckUtils]: 23: Hoare triple {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:31:23,726 INFO L273 TraceCheckUtils]: 24: Hoare triple {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !false; {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:31:23,727 INFO L273 TraceCheckUtils]: 25: Hoare triple {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:31:23,727 INFO L273 TraceCheckUtils]: 26: Hoare triple {3827#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:31:23,727 INFO L256 TraceCheckUtils]: 27: Hoare triple {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:31:23,727 INFO L273 TraceCheckUtils]: 28: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:31:23,728 INFO L273 TraceCheckUtils]: 29: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:31:23,728 INFO L273 TraceCheckUtils]: 30: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:31:23,728 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3823#true} {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #43#return; {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:31:23,729 INFO L273 TraceCheckUtils]: 32: Hoare triple {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume true; {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:31:23,729 INFO L273 TraceCheckUtils]: 33: Hoare triple {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !false; {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:31:23,730 INFO L273 TraceCheckUtils]: 34: Hoare triple {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-14 17:31:23,731 INFO L273 TraceCheckUtils]: 35: Hoare triple {3828#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:31:23,731 INFO L256 TraceCheckUtils]: 36: Hoare triple {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:31:23,731 INFO L273 TraceCheckUtils]: 37: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:31:23,732 INFO L273 TraceCheckUtils]: 38: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:31:23,732 INFO L273 TraceCheckUtils]: 39: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:31:23,733 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3823#true} {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #43#return; {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:31:23,733 INFO L273 TraceCheckUtils]: 41: Hoare triple {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:31:23,734 INFO L273 TraceCheckUtils]: 42: Hoare triple {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !false; {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:31:23,734 INFO L273 TraceCheckUtils]: 43: Hoare triple {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:31:23,735 INFO L273 TraceCheckUtils]: 44: Hoare triple {3829#(and (<= 4 main_~x~0) (<= main_~x~0 4))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:31:23,735 INFO L256 TraceCheckUtils]: 45: Hoare triple {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:31:23,735 INFO L273 TraceCheckUtils]: 46: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:31:23,735 INFO L273 TraceCheckUtils]: 47: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:31:23,735 INFO L273 TraceCheckUtils]: 48: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:31:23,736 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {3823#true} {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #43#return; {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:31:23,737 INFO L273 TraceCheckUtils]: 50: Hoare triple {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume true; {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:31:23,737 INFO L273 TraceCheckUtils]: 51: Hoare triple {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !false; {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:31:23,738 INFO L273 TraceCheckUtils]: 52: Hoare triple {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-14 17:31:23,739 INFO L273 TraceCheckUtils]: 53: Hoare triple {3830#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:31:23,739 INFO L256 TraceCheckUtils]: 54: Hoare triple {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:31:23,739 INFO L273 TraceCheckUtils]: 55: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:31:23,739 INFO L273 TraceCheckUtils]: 56: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:31:23,740 INFO L273 TraceCheckUtils]: 57: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:31:23,740 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3823#true} {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #43#return; {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:31:23,741 INFO L273 TraceCheckUtils]: 59: Hoare triple {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:31:23,742 INFO L273 TraceCheckUtils]: 60: Hoare triple {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !false; {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:31:23,742 INFO L273 TraceCheckUtils]: 61: Hoare triple {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:31:23,743 INFO L273 TraceCheckUtils]: 62: Hoare triple {3831#(and (<= main_~x~0 6) (<= 6 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:31:23,743 INFO L256 TraceCheckUtils]: 63: Hoare triple {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:31:23,744 INFO L273 TraceCheckUtils]: 64: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:31:23,744 INFO L273 TraceCheckUtils]: 65: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:31:23,744 INFO L273 TraceCheckUtils]: 66: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:31:23,745 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {3823#true} {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #43#return; {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:31:23,745 INFO L273 TraceCheckUtils]: 68: Hoare triple {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume true; {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:31:23,746 INFO L273 TraceCheckUtils]: 69: Hoare triple {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !false; {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:31:23,747 INFO L273 TraceCheckUtils]: 70: Hoare triple {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-14 17:31:23,748 INFO L273 TraceCheckUtils]: 71: Hoare triple {3832#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:31:23,748 INFO L256 TraceCheckUtils]: 72: Hoare triple {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:31:23,748 INFO L273 TraceCheckUtils]: 73: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:31:23,748 INFO L273 TraceCheckUtils]: 74: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:31:23,749 INFO L273 TraceCheckUtils]: 75: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:31:23,750 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {3823#true} {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #43#return; {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:31:23,750 INFO L273 TraceCheckUtils]: 77: Hoare triple {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:31:23,751 INFO L273 TraceCheckUtils]: 78: Hoare triple {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !false; {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:31:23,751 INFO L273 TraceCheckUtils]: 79: Hoare triple {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10;~sn~0 := ~sn~0 + 2; {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:31:23,752 INFO L273 TraceCheckUtils]: 80: Hoare triple {3833#(and (<= 8 main_~x~0) (<= main_~x~0 8))} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {4078#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:31:23,753 INFO L256 TraceCheckUtils]: 81: Hoare triple {4078#(and (<= 9 main_~x~0) (<= main_~x~0 9))} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3823#true} is VALID [2018-11-14 17:31:23,753 INFO L273 TraceCheckUtils]: 82: Hoare triple {3823#true} ~cond := #in~cond; {3823#true} is VALID [2018-11-14 17:31:23,753 INFO L273 TraceCheckUtils]: 83: Hoare triple {3823#true} assume !(~cond == 0); {3823#true} is VALID [2018-11-14 17:31:23,753 INFO L273 TraceCheckUtils]: 84: Hoare triple {3823#true} assume true; {3823#true} is VALID [2018-11-14 17:31:23,754 INFO L268 TraceCheckUtils]: 85: Hoare quadruple {3823#true} {4078#(and (<= 9 main_~x~0) (<= main_~x~0 9))} #43#return; {4078#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:31:23,755 INFO L273 TraceCheckUtils]: 86: Hoare triple {4078#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume true; {4078#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:31:23,755 INFO L273 TraceCheckUtils]: 87: Hoare triple {4078#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !false; {4078#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-14 17:31:23,756 INFO L273 TraceCheckUtils]: 88: Hoare triple {4078#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 < 10); {3824#false} is VALID [2018-11-14 17:31:23,756 INFO L273 TraceCheckUtils]: 89: Hoare triple {3824#false} #t~post2 := ~x~0;~x~0 := #t~post2 + 1;havoc #t~post2; {3824#false} is VALID [2018-11-14 17:31:23,756 INFO L256 TraceCheckUtils]: 90: Hoare triple {3824#false} call __VERIFIER_assert((if ~sn~0 % 4294967296 == ~x~0 * 2 % 4294967296 || ~sn~0 == 0 then 1 else 0)); {3824#false} is VALID [2018-11-14 17:31:23,756 INFO L273 TraceCheckUtils]: 91: Hoare triple {3824#false} ~cond := #in~cond; {3824#false} is VALID [2018-11-14 17:31:23,756 INFO L273 TraceCheckUtils]: 92: Hoare triple {3824#false} assume ~cond == 0; {3824#false} is VALID [2018-11-14 17:31:23,757 INFO L273 TraceCheckUtils]: 93: Hoare triple {3824#false} assume !false; {3824#false} is VALID [2018-11-14 17:31:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 36 proven. 207 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-14 17:31:23,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:31:23,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 17:31:23,793 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2018-11-14 17:31:23,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:31:23,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 17:31:23,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:31:23,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 17:31:23,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 17:31:23,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:31:23,867 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 13 states. [2018-11-14 17:31:25,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:31:25,215 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2018-11-14 17:31:25,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:31:25,215 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2018-11-14 17:31:25,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:31:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:31:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2018-11-14 17:31:25,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:31:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2018-11-14 17:31:25,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 88 transitions. [2018-11-14 17:31:25,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:31:25,318 INFO L225 Difference]: With dead ends: 85 [2018-11-14 17:31:25,319 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 17:31:25,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:31:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 17:31:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-11-14 17:31:25,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:31:25,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 73 states. [2018-11-14 17:31:25,394 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 73 states. [2018-11-14 17:31:25,395 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 73 states. [2018-11-14 17:31:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:31:25,398 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-14 17:31:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2018-11-14 17:31:25,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:31:25,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:31:25,399 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 74 states. [2018-11-14 17:31:25,399 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 74 states. [2018-11-14 17:31:25,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:31:25,401 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-14 17:31:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2018-11-14 17:31:25,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:31:25,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:31:25,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:31:25,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:31:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-14 17:31:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2018-11-14 17:31:25,409 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 94 [2018-11-14 17:31:25,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:31:25,409 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2018-11-14 17:31:25,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 17:31:25,409 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2018-11-14 17:31:25,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-14 17:31:25,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:31:25,411 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:31:25,411 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:31:25,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:31:25,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1149749149, now seen corresponding path program 10 times [2018-11-14 17:31:25,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:31:25,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:31:25,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:31:25,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:31:25,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:31:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:31:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:31:25,590 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 17:31:25,666 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:31:25,666 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:31:25,666 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:31:25,666 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 17:31:25,666 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-14 17:31:25,666 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:31:25,666 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:31:25,667 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:31:25,667 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-14 17:31:25,667 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2018-11-14 17:31:25,667 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 17:31:25,667 WARN L170 areAnnotationChecker]: L3 has no Hoare annotation [2018-11-14 17:31:25,667 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:31:25,667 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 17:31:25,667 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2018-11-14 17:31:25,667 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-14 17:31:25,667 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:31:25,668 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 17:31:25,668 WARN L170 areAnnotationChecker]: L3-2 has no Hoare annotation [2018-11-14 17:31:25,668 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 17:31:25,668 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-14 17:31:25,668 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:31:25,668 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 17:31:25,669 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2018-11-14 17:31:25,669 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 17:31:25,669 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 17:31:25,669 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:31:25,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:31:25 BoogieIcfgContainer [2018-11-14 17:31:25,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:31:25,673 INFO L168 Benchmark]: Toolchain (without parser) took 93302.49 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:31:25,675 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:31:25,675 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:31:25,676 INFO L168 Benchmark]: Boogie Preprocessor took 39.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:31:25,676 INFO L168 Benchmark]: RCFGBuilder took 544.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:31:25,677 INFO L168 Benchmark]: TraceAbstraction took 92390.47 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 319.3 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -257.1 MB). Peak memory consumption was 62.2 MB. Max. memory is 7.1 GB. [2018-11-14 17:31:25,681 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 322.96 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 544.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -794.2 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 92390.47 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 319.3 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -257.1 MB). Peak memory consumption was 62.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int sn=0; [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L12] unsigned int x=0; VAL [loop1=2, n1=3, sn=0, x=0] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=0, x=0] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=2, x=0] [L17] x++ VAL [loop1=2, n1=3, sn=2, x=1] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=2, x=1] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=2, x=1] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=4, x=1] [L17] x++ VAL [loop1=2, n1=3, sn=4, x=2] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=4, x=2] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=4, x=2] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=6, x=2] [L17] x++ VAL [loop1=2, n1=3, sn=6, x=3] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=6, x=3] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=6, x=3] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=8, x=3] [L17] x++ VAL [loop1=2, n1=3, sn=8, x=4] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=8, x=4] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=8, x=4] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=10, x=4] [L17] x++ VAL [loop1=2, n1=3, sn=10, x=5] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=10, x=5] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=10, x=5] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=12, x=5] [L17] x++ VAL [loop1=2, n1=3, sn=12, x=6] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=12, x=6] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=12, x=6] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=14, x=6] [L17] x++ VAL [loop1=2, n1=3, sn=14, x=7] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=14, x=7] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=14, x=7] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=16, x=7] [L17] x++ VAL [loop1=2, n1=3, sn=16, x=8] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=16, x=8] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=16, x=8] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=18, x=8] [L17] x++ VAL [loop1=2, n1=3, sn=18, x=9] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=18, x=9] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=18, x=9] [L14] COND TRUE x<10 [L15] sn = sn + (2) VAL [loop1=2, n1=3, sn=20, x=9] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=10] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=1] [L3] COND FALSE, RET !(!(cond)) VAL [\old(cond)=1, cond=1] [L18] __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [loop1=2, n1=3, sn=20, x=10] [L13] COND TRUE 1 VAL [loop1=2, n1=3, sn=20, x=10] [L14] COND FALSE !(x<10) VAL [loop1=2, n1=3, sn=20, x=10] [L17] x++ VAL [loop1=2, n1=3, sn=20, x=11] [L18] CALL __VERIFIER_assert(sn==x*(2) || sn == 0) VAL [\old(cond)=0] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 92.3s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 23.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 328 SDtfs, 74 SDslu, 1992 SDs, 0 SdLazy, 1540 SolverSat, 61 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 615 GetRequests, 503 SyntacticMatches, 20 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 12 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 50.5s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 1173 NumberOfCodeBlocks, 1164 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1050 ConstructedInterpolants, 18 QuantifiedInterpolants, 330378 SizeOfPredicates, 14 NumberOfNonLiveVariables, 992 ConjunctsInSsa, 151 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 1302/2790 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...