java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono1_false-unreach-call1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:16:03,504 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:16:03,506 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:16:03,520 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:16:03,521 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:16:03,522 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:16:03,523 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:16:03,525 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:16:03,527 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:16:03,528 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:16:03,529 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:16:03,529 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:16:03,530 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:16:03,531 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:16:03,533 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:16:03,534 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:16:03,534 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:16:03,536 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:16:03,539 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:16:03,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:16:03,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:16:03,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:16:03,546 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:16:03,547 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:16:03,547 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:16:03,548 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:16:03,549 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:16:03,550 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:16:03,551 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:16:03,552 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:16:03,552 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:16:03,553 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:16:03,553 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:16:03,553 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:16:03,555 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:16:03,555 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:16:03,556 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:16:03,572 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:16:03,572 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:16:03,573 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:16:03,573 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:16:03,574 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:16:03,574 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:16:03,574 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:16:03,574 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:16:03,575 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:16:03,575 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:16:03,575 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:16:03,575 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:16:03,575 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:16:03,576 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:16:03,576 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:16:03,576 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:16:03,576 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:16:03,576 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:16:03,577 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:16:03,577 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:16:03,577 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:16:03,577 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:16:03,577 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:16:03,578 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:16:03,578 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:16:03,578 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:16:03,578 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:16:03,578 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:16:03,578 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:16:03,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:16:03,579 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:16:03,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:16:03,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:16:03,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:16:03,662 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:16:03,663 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:16:03,663 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_false-unreach-call1.c [2018-11-23 13:16:03,725 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23573c733/d33709d1138c4283b42422e3c25013a8/FLAG18a08da6e [2018-11-23 13:16:04,183 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:16:04,184 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_false-unreach-call1.c [2018-11-23 13:16:04,191 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23573c733/d33709d1138c4283b42422e3c25013a8/FLAG18a08da6e [2018-11-23 13:16:04,532 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23573c733/d33709d1138c4283b42422e3c25013a8 [2018-11-23 13:16:04,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:16:04,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:16:04,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:16:04,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:16:04,549 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:16:04,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:04" (1/1) ... [2018-11-23 13:16:04,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7115c4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:04, skipping insertion in model container [2018-11-23 13:16:04,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:16:04" (1/1) ... [2018-11-23 13:16:04,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:16:04,588 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:16:04,837 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:16:04,841 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:16:04,859 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:16:04,876 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:16:04,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:04 WrapperNode [2018-11-23 13:16:04,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:16:04,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:16:04,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:16:04,878 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:16:04,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:04" (1/1) ... [2018-11-23 13:16:04,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:04" (1/1) ... [2018-11-23 13:16:04,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:16:04,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:16:04,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:16:04,900 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:16:04,908 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:04" (1/1) ... [2018-11-23 13:16:04,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:04" (1/1) ... [2018-11-23 13:16:04,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:04" (1/1) ... [2018-11-23 13:16:04,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:04" (1/1) ... [2018-11-23 13:16:04,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:04" (1/1) ... [2018-11-23 13:16:04,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:04" (1/1) ... [2018-11-23 13:16:04,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:04" (1/1) ... [2018-11-23 13:16:04,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:16:04,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:16:04,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:16:04,923 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:16:04,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:16:05,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:16:05,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:16:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:16:05,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:16:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:16:05,049 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:16:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:16:05,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:16:05,478 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:16:05,478 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:16:05,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:05 BoogieIcfgContainer [2018-11-23 13:16:05,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:16:05,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:16:05,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:16:05,484 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:16:05,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:16:04" (1/3) ... [2018-11-23 13:16:05,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c16d5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:05, skipping insertion in model container [2018-11-23 13:16:05,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:16:04" (2/3) ... [2018-11-23 13:16:05,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c16d5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:16:05, skipping insertion in model container [2018-11-23 13:16:05,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:16:05" (3/3) ... [2018-11-23 13:16:05,488 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono1_false-unreach-call1.c [2018-11-23 13:16:05,498 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:16:05,507 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:16:05,522 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:16:05,563 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:16:05,563 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:16:05,564 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:16:05,564 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:16:05,564 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:16:05,564 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:16:05,564 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:16:05,564 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:16:05,565 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:16:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 13:16:05,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:16:05,590 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:05,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:05,593 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:05,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:05,599 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-23 13:16:05,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:05,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:05,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:05,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:05,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:05,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-23 13:16:05,748 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-23 13:16:05,748 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #37#return; {21#true} is VALID [2018-11-23 13:16:05,749 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret1 := main(); {21#true} is VALID [2018-11-23 13:16:05,749 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 0; {21#true} is VALID [2018-11-23 13:16:05,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-23 13:16:05,750 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {22#false} is VALID [2018-11-23 13:16:05,751 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-23 13:16:05,751 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2018-11-23 13:16:05,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-23 13:16:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:05,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:16:05,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:16:05,762 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:16:05,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:05,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:16:05,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:05,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:16:05,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:16:05,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:16:05,833 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 13:16:05,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:05,905 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 13:16:05,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:16:05,905 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:16:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:16:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-23 13:16:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:16:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-23 13:16:05,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 33 transitions. [2018-11-23 13:16:06,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:06,133 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:16:06,134 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:16:06,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:16:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:16:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:16:06,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:06,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:16:06,272 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:16:06,273 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:16:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:06,278 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 13:16:06,278 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:16:06,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:06,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:06,279 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:16:06,279 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:16:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:06,283 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 13:16:06,285 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:16:06,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:06,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:06,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:06,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:16:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-23 13:16:06,290 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-11-23 13:16:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:06,291 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-23 13:16:06,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:16:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:16:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:16:06,292 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:06,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:06,292 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:06,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:06,293 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2018-11-23 13:16:06,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:06,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:06,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:06,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:06,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:06,703 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2018-11-23 13:16:06,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {106#true} is VALID [2018-11-23 13:16:06,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {106#true} assume true; {106#true} is VALID [2018-11-23 13:16:06,790 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} #37#return; {106#true} is VALID [2018-11-23 13:16:06,790 INFO L256 TraceCheckUtils]: 3: Hoare triple {106#true} call #t~ret1 := main(); {106#true} is VALID [2018-11-23 13:16:06,795 INFO L273 TraceCheckUtils]: 4: Hoare triple {106#true} ~x~0 := 0; {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:06,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {107#false} is VALID [2018-11-23 13:16:06,796 INFO L256 TraceCheckUtils]: 6: Hoare triple {107#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {107#false} is VALID [2018-11-23 13:16:06,797 INFO L273 TraceCheckUtils]: 7: Hoare triple {107#false} ~cond := #in~cond; {107#false} is VALID [2018-11-23 13:16:06,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {107#false} assume 0 == ~cond; {107#false} is VALID [2018-11-23 13:16:06,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {107#false} assume !false; {107#false} is VALID [2018-11-23 13:16:06,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:06,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:16:06,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:16:06,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:16:06,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:06,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:16:06,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:06,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:16:06,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:16:06,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:16:06,849 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2018-11-23 13:16:06,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:06,947 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-11-23 13:16:06,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:16:06,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:16:06,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:06,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:16:06,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 13:16:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:16:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2018-11-23 13:16:06,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2018-11-23 13:16:07,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:07,094 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:16:07,094 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:16:07,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:16:07,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:16:07,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:16:07,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:07,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:16:07,108 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:16:07,108 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:16:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:07,110 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 13:16:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:16:07,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:07,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:07,111 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:16:07,111 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:16:07,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:07,112 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 13:16:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:16:07,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:07,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:07,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:07,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:16:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 13:16:07,115 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-23 13:16:07,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:07,116 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 13:16:07,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:16:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:16:07,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:16:07,117 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:07,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:07,117 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:07,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:07,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2018-11-23 13:16:07,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:07,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:07,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:07,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:07,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:07,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2018-11-23 13:16:07,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#true} assume true; {193#true} is VALID [2018-11-23 13:16:07,289 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} #37#return; {193#true} is VALID [2018-11-23 13:16:07,289 INFO L256 TraceCheckUtils]: 3: Hoare triple {193#true} call #t~ret1 := main(); {193#true} is VALID [2018-11-23 13:16:07,290 INFO L273 TraceCheckUtils]: 4: Hoare triple {193#true} ~x~0 := 0; {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:07,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:07,292 INFO L273 TraceCheckUtils]: 6: Hoare triple {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {196#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:07,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {196#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {194#false} is VALID [2018-11-23 13:16:07,304 INFO L256 TraceCheckUtils]: 8: Hoare triple {194#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {194#false} is VALID [2018-11-23 13:16:07,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2018-11-23 13:16:07,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {194#false} assume 0 == ~cond; {194#false} is VALID [2018-11-23 13:16:07,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {194#false} assume !false; {194#false} is VALID [2018-11-23 13:16:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:07,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:07,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:07,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:07,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:07,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {193#true} call ULTIMATE.init(); {193#true} is VALID [2018-11-23 13:16:07,698 INFO L273 TraceCheckUtils]: 1: Hoare triple {193#true} assume true; {193#true} is VALID [2018-11-23 13:16:07,698 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {193#true} {193#true} #37#return; {193#true} is VALID [2018-11-23 13:16:07,699 INFO L256 TraceCheckUtils]: 3: Hoare triple {193#true} call #t~ret1 := main(); {193#true} is VALID [2018-11-23 13:16:07,711 INFO L273 TraceCheckUtils]: 4: Hoare triple {193#true} ~x~0 := 0; {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:07,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:07,738 INFO L273 TraceCheckUtils]: 6: Hoare triple {195#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {218#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:07,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {218#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {194#false} is VALID [2018-11-23 13:16:07,750 INFO L256 TraceCheckUtils]: 8: Hoare triple {194#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {194#false} is VALID [2018-11-23 13:16:07,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {194#false} ~cond := #in~cond; {194#false} is VALID [2018-11-23 13:16:07,750 INFO L273 TraceCheckUtils]: 10: Hoare triple {194#false} assume 0 == ~cond; {194#false} is VALID [2018-11-23 13:16:07,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {194#false} assume !false; {194#false} is VALID [2018-11-23 13:16:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:07,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:07,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:16:07,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:16:07,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:07,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:16:07,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:07,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:16:07,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:16:07,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:16:07,864 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-23 13:16:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:08,109 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 13:16:08,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:16:08,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:16:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:08,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:16:08,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 13:16:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:16:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 13:16:08,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2018-11-23 13:16:08,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:08,169 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:16:08,169 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:16:08,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:16:08,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:16:08,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:16:08,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:08,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:16:08,188 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:16:08,188 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:16:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:08,190 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 13:16:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:16:08,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:08,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:08,191 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:16:08,192 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:16:08,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:08,193 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 13:16:08,194 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:16:08,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:08,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:08,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:08,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:08,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:16:08,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-23 13:16:08,196 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2018-11-23 13:16:08,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:08,197 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-23 13:16:08,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:16:08,197 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:16:08,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:16:08,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:08,198 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:08,199 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:08,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:08,199 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2018-11-23 13:16:08,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:08,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:08,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:08,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:08,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:08,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {325#true} call ULTIMATE.init(); {325#true} is VALID [2018-11-23 13:16:08,448 INFO L273 TraceCheckUtils]: 1: Hoare triple {325#true} assume true; {325#true} is VALID [2018-11-23 13:16:08,448 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {325#true} {325#true} #37#return; {325#true} is VALID [2018-11-23 13:16:08,449 INFO L256 TraceCheckUtils]: 3: Hoare triple {325#true} call #t~ret1 := main(); {325#true} is VALID [2018-11-23 13:16:08,454 INFO L273 TraceCheckUtils]: 4: Hoare triple {325#true} ~x~0 := 0; {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:08,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:08,456 INFO L273 TraceCheckUtils]: 6: Hoare triple {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:08,461 INFO L273 TraceCheckUtils]: 7: Hoare triple {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:08,466 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {329#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:08,468 INFO L273 TraceCheckUtils]: 9: Hoare triple {329#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {326#false} is VALID [2018-11-23 13:16:08,468 INFO L256 TraceCheckUtils]: 10: Hoare triple {326#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {326#false} is VALID [2018-11-23 13:16:08,468 INFO L273 TraceCheckUtils]: 11: Hoare triple {326#false} ~cond := #in~cond; {326#false} is VALID [2018-11-23 13:16:08,468 INFO L273 TraceCheckUtils]: 12: Hoare triple {326#false} assume 0 == ~cond; {326#false} is VALID [2018-11-23 13:16:08,469 INFO L273 TraceCheckUtils]: 13: Hoare triple {326#false} assume !false; {326#false} is VALID [2018-11-23 13:16:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:08,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:08,470 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:08,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:16:08,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:16:08,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:08,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:08,593 INFO L256 TraceCheckUtils]: 0: Hoare triple {325#true} call ULTIMATE.init(); {325#true} is VALID [2018-11-23 13:16:08,593 INFO L273 TraceCheckUtils]: 1: Hoare triple {325#true} assume true; {325#true} is VALID [2018-11-23 13:16:08,594 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {325#true} {325#true} #37#return; {325#true} is VALID [2018-11-23 13:16:08,594 INFO L256 TraceCheckUtils]: 3: Hoare triple {325#true} call #t~ret1 := main(); {325#true} is VALID [2018-11-23 13:16:08,598 INFO L273 TraceCheckUtils]: 4: Hoare triple {325#true} ~x~0 := 0; {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:08,600 INFO L273 TraceCheckUtils]: 5: Hoare triple {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:08,601 INFO L273 TraceCheckUtils]: 6: Hoare triple {327#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:08,602 INFO L273 TraceCheckUtils]: 7: Hoare triple {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:08,602 INFO L273 TraceCheckUtils]: 8: Hoare triple {328#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {357#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:08,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {357#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 100000000); {326#false} is VALID [2018-11-23 13:16:08,604 INFO L256 TraceCheckUtils]: 10: Hoare triple {326#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {326#false} is VALID [2018-11-23 13:16:08,604 INFO L273 TraceCheckUtils]: 11: Hoare triple {326#false} ~cond := #in~cond; {326#false} is VALID [2018-11-23 13:16:08,605 INFO L273 TraceCheckUtils]: 12: Hoare triple {326#false} assume 0 == ~cond; {326#false} is VALID [2018-11-23 13:16:08,605 INFO L273 TraceCheckUtils]: 13: Hoare triple {326#false} assume !false; {326#false} is VALID [2018-11-23 13:16:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:08,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:08,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:16:08,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:16:08,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:08,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:16:08,659 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:08,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:16:08,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:16:08,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:16:08,660 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 6 states. [2018-11-23 13:16:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:08,907 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-23 13:16:08,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:16:08,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:16:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:16:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-23 13:16:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:16:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-23 13:16:08,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2018-11-23 13:16:08,948 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-23 13:16:08,950 INFO L225 Difference]: With dead ends: 25 [2018-11-23 13:16:08,950 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:16:08,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:16:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:16:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:16:08,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:08,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 13:16:08,972 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:16:08,973 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:16:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:08,975 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 13:16:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 13:16:08,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:08,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:08,976 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:16:08,976 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:16:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:08,978 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 13:16:08,978 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 13:16:08,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:08,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:08,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:08,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:08,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:16:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 13:16:08,981 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2018-11-23 13:16:08,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:08,981 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 13:16:08,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:16:08,981 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 13:16:08,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:16:08,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:08,982 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:08,983 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:08,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:08,983 INFO L82 PathProgramCache]: Analyzing trace with hash -639535185, now seen corresponding path program 3 times [2018-11-23 13:16:08,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:08,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:08,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:08,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:08,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:09,200 INFO L256 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2018-11-23 13:16:09,201 INFO L273 TraceCheckUtils]: 1: Hoare triple {474#true} assume true; {474#true} is VALID [2018-11-23 13:16:09,201 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {474#true} {474#true} #37#return; {474#true} is VALID [2018-11-23 13:16:09,202 INFO L256 TraceCheckUtils]: 3: Hoare triple {474#true} call #t~ret1 := main(); {474#true} is VALID [2018-11-23 13:16:09,203 INFO L273 TraceCheckUtils]: 4: Hoare triple {474#true} ~x~0 := 0; {476#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:09,204 INFO L273 TraceCheckUtils]: 5: Hoare triple {476#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {476#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:09,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {476#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {477#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:09,208 INFO L273 TraceCheckUtils]: 7: Hoare triple {477#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {477#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:09,209 INFO L273 TraceCheckUtils]: 8: Hoare triple {477#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:09,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:09,211 INFO L273 TraceCheckUtils]: 10: Hoare triple {478#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {479#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:09,212 INFO L273 TraceCheckUtils]: 11: Hoare triple {479#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {475#false} is VALID [2018-11-23 13:16:09,212 INFO L256 TraceCheckUtils]: 12: Hoare triple {475#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {475#false} is VALID [2018-11-23 13:16:09,213 INFO L273 TraceCheckUtils]: 13: Hoare triple {475#false} ~cond := #in~cond; {475#false} is VALID [2018-11-23 13:16:09,213 INFO L273 TraceCheckUtils]: 14: Hoare triple {475#false} assume 0 == ~cond; {475#false} is VALID [2018-11-23 13:16:09,213 INFO L273 TraceCheckUtils]: 15: Hoare triple {475#false} assume !false; {475#false} is VALID [2018-11-23 13:16:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:09,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:09,215 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:09,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:16:09,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 13:16:09,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:09,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:09,296 INFO L256 TraceCheckUtils]: 0: Hoare triple {474#true} call ULTIMATE.init(); {474#true} is VALID [2018-11-23 13:16:09,297 INFO L273 TraceCheckUtils]: 1: Hoare triple {474#true} assume true; {474#true} is VALID [2018-11-23 13:16:09,297 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {474#true} {474#true} #37#return; {474#true} is VALID [2018-11-23 13:16:09,297 INFO L256 TraceCheckUtils]: 3: Hoare triple {474#true} call #t~ret1 := main(); {474#true} is VALID [2018-11-23 13:16:09,297 INFO L273 TraceCheckUtils]: 4: Hoare triple {474#true} ~x~0 := 0; {474#true} is VALID [2018-11-23 13:16:09,298 INFO L273 TraceCheckUtils]: 5: Hoare triple {474#true} assume !!(~x~0 % 4294967296 < 100000000); {474#true} is VALID [2018-11-23 13:16:09,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {474#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {474#true} is VALID [2018-11-23 13:16:09,298 INFO L273 TraceCheckUtils]: 7: Hoare triple {474#true} assume !!(~x~0 % 4294967296 < 100000000); {474#true} is VALID [2018-11-23 13:16:09,298 INFO L273 TraceCheckUtils]: 8: Hoare triple {474#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {474#true} is VALID [2018-11-23 13:16:09,299 INFO L273 TraceCheckUtils]: 9: Hoare triple {474#true} assume !!(~x~0 % 4294967296 < 100000000); {474#true} is VALID [2018-11-23 13:16:09,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {474#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {513#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2018-11-23 13:16:09,301 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 100000000); {475#false} is VALID [2018-11-23 13:16:09,301 INFO L256 TraceCheckUtils]: 12: Hoare triple {475#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {475#false} is VALID [2018-11-23 13:16:09,301 INFO L273 TraceCheckUtils]: 13: Hoare triple {475#false} ~cond := #in~cond; {475#false} is VALID [2018-11-23 13:16:09,302 INFO L273 TraceCheckUtils]: 14: Hoare triple {475#false} assume 0 == ~cond; {475#false} is VALID [2018-11-23 13:16:09,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {475#false} assume !false; {475#false} is VALID [2018-11-23 13:16:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 13:16:09,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:16:09,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-23 13:16:09,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:16:09,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:09,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:16:09,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:09,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:16:09,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:16:09,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:16:09,379 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2018-11-23 13:16:09,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:09,615 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 13:16:09,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:16:09,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:16:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:09,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:16:09,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-23 13:16:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:16:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-23 13:16:09,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2018-11-23 13:16:09,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:09,694 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:16:09,694 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:16:09,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:16:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:16:09,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 13:16:09,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:09,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 13:16:09,720 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 13:16:09,720 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 13:16:09,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:09,722 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:16:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:16:09,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:09,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:09,723 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 13:16:09,723 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 13:16:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:09,725 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:16:09,726 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:16:09,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:09,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:09,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:09,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:16:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 13:16:09,728 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2018-11-23 13:16:09,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:09,728 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 13:16:09,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:16:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 13:16:09,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:16:09,730 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:09,730 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:09,730 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:09,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:09,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1988642215, now seen corresponding path program 1 times [2018-11-23 13:16:09,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:09,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:09,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:09,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:09,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:10,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2018-11-23 13:16:10,194 INFO L273 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2018-11-23 13:16:10,194 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #37#return; {651#true} is VALID [2018-11-23 13:16:10,194 INFO L256 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret1 := main(); {651#true} is VALID [2018-11-23 13:16:10,198 INFO L273 TraceCheckUtils]: 4: Hoare triple {651#true} ~x~0 := 0; {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:10,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:10,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:10,200 INFO L273 TraceCheckUtils]: 7: Hoare triple {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:10,201 INFO L273 TraceCheckUtils]: 8: Hoare triple {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:10,202 INFO L273 TraceCheckUtils]: 9: Hoare triple {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:10,203 INFO L273 TraceCheckUtils]: 10: Hoare triple {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:10,204 INFO L273 TraceCheckUtils]: 11: Hoare triple {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:10,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:10,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:10,208 INFO L273 TraceCheckUtils]: 14: Hoare triple {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {658#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:10,209 INFO L273 TraceCheckUtils]: 15: Hoare triple {658#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {652#false} is VALID [2018-11-23 13:16:10,209 INFO L256 TraceCheckUtils]: 16: Hoare triple {652#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {652#false} is VALID [2018-11-23 13:16:10,210 INFO L273 TraceCheckUtils]: 17: Hoare triple {652#false} ~cond := #in~cond; {652#false} is VALID [2018-11-23 13:16:10,210 INFO L273 TraceCheckUtils]: 18: Hoare triple {652#false} assume 0 == ~cond; {652#false} is VALID [2018-11-23 13:16:10,211 INFO L273 TraceCheckUtils]: 19: Hoare triple {652#false} assume !false; {652#false} is VALID [2018-11-23 13:16:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:10,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:10,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:10,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:10,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:10,550 INFO L256 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2018-11-23 13:16:10,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2018-11-23 13:16:10,551 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #37#return; {651#true} is VALID [2018-11-23 13:16:10,551 INFO L256 TraceCheckUtils]: 3: Hoare triple {651#true} call #t~ret1 := main(); {651#true} is VALID [2018-11-23 13:16:10,554 INFO L273 TraceCheckUtils]: 4: Hoare triple {651#true} ~x~0 := 0; {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:10,556 INFO L273 TraceCheckUtils]: 5: Hoare triple {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:10,557 INFO L273 TraceCheckUtils]: 6: Hoare triple {653#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:10,558 INFO L273 TraceCheckUtils]: 7: Hoare triple {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:10,571 INFO L273 TraceCheckUtils]: 8: Hoare triple {654#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:10,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:10,573 INFO L273 TraceCheckUtils]: 10: Hoare triple {655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:10,574 INFO L273 TraceCheckUtils]: 11: Hoare triple {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:10,574 INFO L273 TraceCheckUtils]: 12: Hoare triple {656#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:10,575 INFO L273 TraceCheckUtils]: 13: Hoare triple {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:10,576 INFO L273 TraceCheckUtils]: 14: Hoare triple {657#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {652#false} is VALID [2018-11-23 13:16:10,576 INFO L273 TraceCheckUtils]: 15: Hoare triple {652#false} assume !(~x~0 % 4294967296 < 100000000); {652#false} is VALID [2018-11-23 13:16:10,576 INFO L256 TraceCheckUtils]: 16: Hoare triple {652#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {652#false} is VALID [2018-11-23 13:16:10,577 INFO L273 TraceCheckUtils]: 17: Hoare triple {652#false} ~cond := #in~cond; {652#false} is VALID [2018-11-23 13:16:10,577 INFO L273 TraceCheckUtils]: 18: Hoare triple {652#false} assume 0 == ~cond; {652#false} is VALID [2018-11-23 13:16:10,578 INFO L273 TraceCheckUtils]: 19: Hoare triple {652#false} assume !false; {652#false} is VALID [2018-11-23 13:16:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:10,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:10,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-11-23 13:16:10,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:16:10,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:10,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:16:10,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:10,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:16:10,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:16:10,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:16:10,680 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 8 states. [2018-11-23 13:16:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:11,192 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 13:16:11,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:16:11,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 13:16:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:16:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-23 13:16:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:16:11,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-23 13:16:11,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2018-11-23 13:16:11,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:11,323 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:16:11,323 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:16:11,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:16:11,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:16:11,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 13:16:11,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:11,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 13:16:11,362 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:16:11,362 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:16:11,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:11,364 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 13:16:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 13:16:11,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:11,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:11,365 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:16:11,365 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:16:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:11,367 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 13:16:11,367 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 13:16:11,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:11,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:11,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:11,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:11,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:16:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 13:16:11,370 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2018-11-23 13:16:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:11,370 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 13:16:11,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:16:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 13:16:11,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:16:11,371 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:11,372 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:11,372 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:11,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:11,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1105955487, now seen corresponding path program 2 times [2018-11-23 13:16:11,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:11,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:11,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:11,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:16:11,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:11,734 INFO L256 TraceCheckUtils]: 0: Hoare triple {858#true} call ULTIMATE.init(); {858#true} is VALID [2018-11-23 13:16:11,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {858#true} assume true; {858#true} is VALID [2018-11-23 13:16:11,734 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {858#true} {858#true} #37#return; {858#true} is VALID [2018-11-23 13:16:11,735 INFO L256 TraceCheckUtils]: 3: Hoare triple {858#true} call #t~ret1 := main(); {858#true} is VALID [2018-11-23 13:16:11,736 INFO L273 TraceCheckUtils]: 4: Hoare triple {858#true} ~x~0 := 0; {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:11,737 INFO L273 TraceCheckUtils]: 5: Hoare triple {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:11,737 INFO L273 TraceCheckUtils]: 6: Hoare triple {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:11,738 INFO L273 TraceCheckUtils]: 7: Hoare triple {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:11,739 INFO L273 TraceCheckUtils]: 8: Hoare triple {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:11,739 INFO L273 TraceCheckUtils]: 9: Hoare triple {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:11,740 INFO L273 TraceCheckUtils]: 10: Hoare triple {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:11,741 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:11,742 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:11,743 INFO L273 TraceCheckUtils]: 13: Hoare triple {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:11,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:11,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:11,747 INFO L273 TraceCheckUtils]: 16: Hoare triple {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:11,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:11,749 INFO L273 TraceCheckUtils]: 18: Hoare triple {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {867#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:11,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {867#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {859#false} is VALID [2018-11-23 13:16:11,750 INFO L256 TraceCheckUtils]: 20: Hoare triple {859#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {859#false} is VALID [2018-11-23 13:16:11,751 INFO L273 TraceCheckUtils]: 21: Hoare triple {859#false} ~cond := #in~cond; {859#false} is VALID [2018-11-23 13:16:11,751 INFO L273 TraceCheckUtils]: 22: Hoare triple {859#false} assume 0 == ~cond; {859#false} is VALID [2018-11-23 13:16:11,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {859#false} assume !false; {859#false} is VALID [2018-11-23 13:16:11,754 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:11,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:11,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:11,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:16:11,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:16:11,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:11,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:11,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {858#true} call ULTIMATE.init(); {858#true} is VALID [2018-11-23 13:16:11,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {858#true} assume true; {858#true} is VALID [2018-11-23 13:16:11,965 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {858#true} {858#true} #37#return; {858#true} is VALID [2018-11-23 13:16:11,966 INFO L256 TraceCheckUtils]: 3: Hoare triple {858#true} call #t~ret1 := main(); {858#true} is VALID [2018-11-23 13:16:11,967 INFO L273 TraceCheckUtils]: 4: Hoare triple {858#true} ~x~0 := 0; {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:11,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:11,968 INFO L273 TraceCheckUtils]: 6: Hoare triple {860#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:11,969 INFO L273 TraceCheckUtils]: 7: Hoare triple {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:11,969 INFO L273 TraceCheckUtils]: 8: Hoare triple {861#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:11,970 INFO L273 TraceCheckUtils]: 9: Hoare triple {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:11,971 INFO L273 TraceCheckUtils]: 10: Hoare triple {862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:11,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:11,973 INFO L273 TraceCheckUtils]: 12: Hoare triple {863#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:11,974 INFO L273 TraceCheckUtils]: 13: Hoare triple {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:11,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {864#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:11,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:11,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {865#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:11,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:11,981 INFO L273 TraceCheckUtils]: 18: Hoare triple {866#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {925#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:11,982 INFO L273 TraceCheckUtils]: 19: Hoare triple {925#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 100000000); {859#false} is VALID [2018-11-23 13:16:11,983 INFO L256 TraceCheckUtils]: 20: Hoare triple {859#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {859#false} is VALID [2018-11-23 13:16:11,983 INFO L273 TraceCheckUtils]: 21: Hoare triple {859#false} ~cond := #in~cond; {859#false} is VALID [2018-11-23 13:16:11,983 INFO L273 TraceCheckUtils]: 22: Hoare triple {859#false} assume 0 == ~cond; {859#false} is VALID [2018-11-23 13:16:11,984 INFO L273 TraceCheckUtils]: 23: Hoare triple {859#false} assume !false; {859#false} is VALID [2018-11-23 13:16:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:12,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:12,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:16:12,005 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:16:12,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:12,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:16:12,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:12,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:16:12,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:16:12,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:16:12,049 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 11 states. [2018-11-23 13:16:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:12,532 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 13:16:12,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:16:12,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:16:12,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:16:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 13:16:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:16:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 13:16:12,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2018-11-23 13:16:12,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:12,585 INFO L225 Difference]: With dead ends: 37 [2018-11-23 13:16:12,585 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:16:12,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:16:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:16:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 13:16:12,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:12,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 13:16:12,623 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:16:12,624 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:16:12,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:12,626 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 13:16:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 13:16:12,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:12,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:12,627 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:16:12,627 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:16:12,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:12,629 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 13:16:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 13:16:12,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:12,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:12,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:12,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:16:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 13:16:12,631 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-11-23 13:16:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:12,632 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 13:16:12,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:16:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 13:16:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:16:12,633 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:12,633 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:12,633 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:12,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:12,633 INFO L82 PathProgramCache]: Analyzing trace with hash 3029019, now seen corresponding path program 3 times [2018-11-23 13:16:12,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:12,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:12,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:12,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:12,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:13,044 INFO L256 TraceCheckUtils]: 0: Hoare triple {1100#true} call ULTIMATE.init(); {1100#true} is VALID [2018-11-23 13:16:13,045 INFO L273 TraceCheckUtils]: 1: Hoare triple {1100#true} assume true; {1100#true} is VALID [2018-11-23 13:16:13,045 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1100#true} {1100#true} #37#return; {1100#true} is VALID [2018-11-23 13:16:13,045 INFO L256 TraceCheckUtils]: 3: Hoare triple {1100#true} call #t~ret1 := main(); {1100#true} is VALID [2018-11-23 13:16:13,046 INFO L273 TraceCheckUtils]: 4: Hoare triple {1100#true} ~x~0 := 0; {1102#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:13,047 INFO L273 TraceCheckUtils]: 5: Hoare triple {1102#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1102#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:13,048 INFO L273 TraceCheckUtils]: 6: Hoare triple {1102#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1103#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:13,049 INFO L273 TraceCheckUtils]: 7: Hoare triple {1103#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1103#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:13,051 INFO L273 TraceCheckUtils]: 8: Hoare triple {1103#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1104#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:13,052 INFO L273 TraceCheckUtils]: 9: Hoare triple {1104#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1104#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:13,053 INFO L273 TraceCheckUtils]: 10: Hoare triple {1104#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1105#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:13,060 INFO L273 TraceCheckUtils]: 11: Hoare triple {1105#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1105#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:13,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {1105#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1106#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:13,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {1106#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {1106#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:13,062 INFO L273 TraceCheckUtils]: 14: Hoare triple {1106#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:13,063 INFO L273 TraceCheckUtils]: 15: Hoare triple {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:13,069 INFO L273 TraceCheckUtils]: 16: Hoare triple {1107#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1108#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:13,070 INFO L273 TraceCheckUtils]: 17: Hoare triple {1108#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1108#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:13,071 INFO L273 TraceCheckUtils]: 18: Hoare triple {1108#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1109#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:13,071 INFO L273 TraceCheckUtils]: 19: Hoare triple {1109#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1109#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:13,072 INFO L273 TraceCheckUtils]: 20: Hoare triple {1109#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1110#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:13,073 INFO L273 TraceCheckUtils]: 21: Hoare triple {1110#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {1110#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:13,074 INFO L273 TraceCheckUtils]: 22: Hoare triple {1110#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1111#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:13,076 INFO L273 TraceCheckUtils]: 23: Hoare triple {1111#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {1101#false} is VALID [2018-11-23 13:16:13,076 INFO L256 TraceCheckUtils]: 24: Hoare triple {1101#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {1101#false} is VALID [2018-11-23 13:16:13,076 INFO L273 TraceCheckUtils]: 25: Hoare triple {1101#false} ~cond := #in~cond; {1101#false} is VALID [2018-11-23 13:16:13,077 INFO L273 TraceCheckUtils]: 26: Hoare triple {1101#false} assume 0 == ~cond; {1101#false} is VALID [2018-11-23 13:16:13,077 INFO L273 TraceCheckUtils]: 27: Hoare triple {1101#false} assume !false; {1101#false} is VALID [2018-11-23 13:16:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:13,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:13,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:13,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:16:13,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:16:13,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:13,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:13,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {1100#true} call ULTIMATE.init(); {1100#true} is VALID [2018-11-23 13:16:13,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {1100#true} assume true; {1100#true} is VALID [2018-11-23 13:16:13,310 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1100#true} {1100#true} #37#return; {1100#true} is VALID [2018-11-23 13:16:13,310 INFO L256 TraceCheckUtils]: 3: Hoare triple {1100#true} call #t~ret1 := main(); {1100#true} is VALID [2018-11-23 13:16:13,311 INFO L273 TraceCheckUtils]: 4: Hoare triple {1100#true} ~x~0 := 0; {1100#true} is VALID [2018-11-23 13:16:13,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 100000000); {1100#true} is VALID [2018-11-23 13:16:13,311 INFO L273 TraceCheckUtils]: 6: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:16:13,311 INFO L273 TraceCheckUtils]: 7: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 100000000); {1100#true} is VALID [2018-11-23 13:16:13,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:16:13,312 INFO L273 TraceCheckUtils]: 9: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 100000000); {1100#true} is VALID [2018-11-23 13:16:13,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:16:13,312 INFO L273 TraceCheckUtils]: 11: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 100000000); {1100#true} is VALID [2018-11-23 13:16:13,312 INFO L273 TraceCheckUtils]: 12: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:16:13,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 100000000); {1100#true} is VALID [2018-11-23 13:16:13,313 INFO L273 TraceCheckUtils]: 14: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:16:13,313 INFO L273 TraceCheckUtils]: 15: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 100000000); {1100#true} is VALID [2018-11-23 13:16:13,313 INFO L273 TraceCheckUtils]: 16: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:16:13,313 INFO L273 TraceCheckUtils]: 17: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 100000000); {1100#true} is VALID [2018-11-23 13:16:13,313 INFO L273 TraceCheckUtils]: 18: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1100#true} is VALID [2018-11-23 13:16:13,313 INFO L273 TraceCheckUtils]: 19: Hoare triple {1100#true} assume !!(~x~0 % 4294967296 < 100000000); {1100#true} is VALID [2018-11-23 13:16:13,315 INFO L273 TraceCheckUtils]: 20: Hoare triple {1100#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1175#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2018-11-23 13:16:13,315 INFO L273 TraceCheckUtils]: 21: Hoare triple {1175#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {1175#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2018-11-23 13:16:13,317 INFO L273 TraceCheckUtils]: 22: Hoare triple {1175#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1182#(and (<= 10000000 (mod (+ main_~x~0 4294967294) 4294967296)) (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000))} is VALID [2018-11-23 13:16:13,319 INFO L273 TraceCheckUtils]: 23: Hoare triple {1182#(and (<= 10000000 (mod (+ main_~x~0 4294967294) 4294967296)) (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000))} assume !(~x~0 % 4294967296 < 100000000); {1101#false} is VALID [2018-11-23 13:16:13,319 INFO L256 TraceCheckUtils]: 24: Hoare triple {1101#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {1101#false} is VALID [2018-11-23 13:16:13,320 INFO L273 TraceCheckUtils]: 25: Hoare triple {1101#false} ~cond := #in~cond; {1101#false} is VALID [2018-11-23 13:16:13,320 INFO L273 TraceCheckUtils]: 26: Hoare triple {1101#false} assume 0 == ~cond; {1101#false} is VALID [2018-11-23 13:16:13,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {1101#false} assume !false; {1101#false} is VALID [2018-11-23 13:16:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-23 13:16:13,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:13,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2018-11-23 13:16:13,342 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 13:16:13,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:13,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:16:13,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:13,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:16:13,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:16:13,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:16:13,392 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 14 states. [2018-11-23 13:16:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:16,703 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-23 13:16:16,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:16:16,703 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-11-23 13:16:16,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:16:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2018-11-23 13:16:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:16:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2018-11-23 13:16:16,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 50 transitions. [2018-11-23 13:16:16,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:16,900 INFO L225 Difference]: With dead ends: 44 [2018-11-23 13:16:16,901 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:16:16,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:16:16,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:16:16,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 13:16:16,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:16,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 13:16:16,927 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 13:16:16,927 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 13:16:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:16,930 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 13:16:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 13:16:16,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:16,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:16,930 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 13:16:16,931 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 13:16:16,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:16,932 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 13:16:16,933 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 13:16:16,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:16,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:16,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:16,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:16:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-23 13:16:16,935 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 28 [2018-11-23 13:16:16,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:16,935 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-23 13:16:16,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:16:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 13:16:16,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:16:16,936 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:16,937 INFO L402 BasicCegarLoop]: trace histogram [12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:16,937 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:16,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:16,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1686757776, now seen corresponding path program 4 times [2018-11-23 13:16:16,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:16,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:16,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:16,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:16,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:17,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {1393#true} call ULTIMATE.init(); {1393#true} is VALID [2018-11-23 13:16:17,370 INFO L273 TraceCheckUtils]: 1: Hoare triple {1393#true} assume true; {1393#true} is VALID [2018-11-23 13:16:17,370 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1393#true} {1393#true} #37#return; {1393#true} is VALID [2018-11-23 13:16:17,370 INFO L256 TraceCheckUtils]: 3: Hoare triple {1393#true} call #t~ret1 := main(); {1393#true} is VALID [2018-11-23 13:16:17,373 INFO L273 TraceCheckUtils]: 4: Hoare triple {1393#true} ~x~0 := 0; {1395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:17,375 INFO L273 TraceCheckUtils]: 5: Hoare triple {1395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:17,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {1395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1396#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:17,382 INFO L273 TraceCheckUtils]: 7: Hoare triple {1396#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1396#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:17,383 INFO L273 TraceCheckUtils]: 8: Hoare triple {1396#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1397#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:17,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {1397#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1397#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:17,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {1397#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1398#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:17,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {1398#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1398#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:17,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {1398#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1399#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:17,386 INFO L273 TraceCheckUtils]: 13: Hoare triple {1399#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {1399#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:17,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {1399#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1400#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:17,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {1400#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1400#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:17,421 INFO L273 TraceCheckUtils]: 16: Hoare triple {1400#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:17,437 INFO L273 TraceCheckUtils]: 17: Hoare triple {1401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:17,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {1401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1402#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:17,460 INFO L273 TraceCheckUtils]: 19: Hoare triple {1402#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1402#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:17,469 INFO L273 TraceCheckUtils]: 20: Hoare triple {1402#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1403#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:17,484 INFO L273 TraceCheckUtils]: 21: Hoare triple {1403#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {1403#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:17,493 INFO L273 TraceCheckUtils]: 22: Hoare triple {1403#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1404#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:16:17,506 INFO L273 TraceCheckUtils]: 23: Hoare triple {1404#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {1404#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:16:17,518 INFO L273 TraceCheckUtils]: 24: Hoare triple {1404#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1405#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:16:17,531 INFO L273 TraceCheckUtils]: 25: Hoare triple {1405#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1405#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:16:17,546 INFO L273 TraceCheckUtils]: 26: Hoare triple {1405#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1406#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:16:17,549 INFO L273 TraceCheckUtils]: 27: Hoare triple {1406#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1406#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:16:17,550 INFO L273 TraceCheckUtils]: 28: Hoare triple {1406#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1407#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:17,551 INFO L273 TraceCheckUtils]: 29: Hoare triple {1407#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {1394#false} is VALID [2018-11-23 13:16:17,551 INFO L256 TraceCheckUtils]: 30: Hoare triple {1394#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {1394#false} is VALID [2018-11-23 13:16:17,551 INFO L273 TraceCheckUtils]: 31: Hoare triple {1394#false} ~cond := #in~cond; {1394#false} is VALID [2018-11-23 13:16:17,551 INFO L273 TraceCheckUtils]: 32: Hoare triple {1394#false} assume 0 == ~cond; {1394#false} is VALID [2018-11-23 13:16:17,552 INFO L273 TraceCheckUtils]: 33: Hoare triple {1394#false} assume !false; {1394#false} is VALID [2018-11-23 13:16:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:17,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:17,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:17,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:16:17,582 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:16:17,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:16:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:17,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:16:17,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {1393#true} call ULTIMATE.init(); {1393#true} is VALID [2018-11-23 13:16:17,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {1393#true} assume true; {1393#true} is VALID [2018-11-23 13:16:17,865 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1393#true} {1393#true} #37#return; {1393#true} is VALID [2018-11-23 13:16:17,865 INFO L256 TraceCheckUtils]: 3: Hoare triple {1393#true} call #t~ret1 := main(); {1393#true} is VALID [2018-11-23 13:16:17,878 INFO L273 TraceCheckUtils]: 4: Hoare triple {1393#true} ~x~0 := 0; {1395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:17,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {1395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:17,881 INFO L273 TraceCheckUtils]: 6: Hoare triple {1395#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1396#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:17,882 INFO L273 TraceCheckUtils]: 7: Hoare triple {1396#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1396#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:17,887 INFO L273 TraceCheckUtils]: 8: Hoare triple {1396#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1397#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:17,890 INFO L273 TraceCheckUtils]: 9: Hoare triple {1397#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1397#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:17,890 INFO L273 TraceCheckUtils]: 10: Hoare triple {1397#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1398#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:17,891 INFO L273 TraceCheckUtils]: 11: Hoare triple {1398#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1398#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:17,891 INFO L273 TraceCheckUtils]: 12: Hoare triple {1398#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1399#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:17,892 INFO L273 TraceCheckUtils]: 13: Hoare triple {1399#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {1399#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:17,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {1399#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1400#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:17,913 INFO L273 TraceCheckUtils]: 15: Hoare triple {1400#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1400#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:17,914 INFO L273 TraceCheckUtils]: 16: Hoare triple {1400#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:17,915 INFO L273 TraceCheckUtils]: 17: Hoare triple {1401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:17,915 INFO L273 TraceCheckUtils]: 18: Hoare triple {1401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1402#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:17,917 INFO L273 TraceCheckUtils]: 19: Hoare triple {1402#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1402#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:17,917 INFO L273 TraceCheckUtils]: 20: Hoare triple {1402#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1403#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:17,918 INFO L273 TraceCheckUtils]: 21: Hoare triple {1403#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {1403#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:17,919 INFO L273 TraceCheckUtils]: 22: Hoare triple {1403#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1404#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:16:17,920 INFO L273 TraceCheckUtils]: 23: Hoare triple {1404#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {1404#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:16:17,921 INFO L273 TraceCheckUtils]: 24: Hoare triple {1404#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1405#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:16:17,923 INFO L273 TraceCheckUtils]: 25: Hoare triple {1405#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1405#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:16:17,924 INFO L273 TraceCheckUtils]: 26: Hoare triple {1405#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1394#false} is VALID [2018-11-23 13:16:17,924 INFO L273 TraceCheckUtils]: 27: Hoare triple {1394#false} assume !!(~x~0 % 4294967296 < 100000000); {1394#false} is VALID [2018-11-23 13:16:17,924 INFO L273 TraceCheckUtils]: 28: Hoare triple {1394#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1394#false} is VALID [2018-11-23 13:16:17,924 INFO L273 TraceCheckUtils]: 29: Hoare triple {1394#false} assume !(~x~0 % 4294967296 < 100000000); {1394#false} is VALID [2018-11-23 13:16:17,924 INFO L256 TraceCheckUtils]: 30: Hoare triple {1394#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {1394#false} is VALID [2018-11-23 13:16:17,925 INFO L273 TraceCheckUtils]: 31: Hoare triple {1394#false} ~cond := #in~cond; {1394#false} is VALID [2018-11-23 13:16:17,925 INFO L273 TraceCheckUtils]: 32: Hoare triple {1394#false} assume 0 == ~cond; {1394#false} is VALID [2018-11-23 13:16:17,925 INFO L273 TraceCheckUtils]: 33: Hoare triple {1394#false} assume !false; {1394#false} is VALID [2018-11-23 13:16:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 33 proven. 110 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:16:17,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:16:17,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 15 [2018-11-23 13:16:17,957 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-23 13:16:17,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:16:17,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:16:18,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:18,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:16:18,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:16:18,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:16:18,007 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 15 states. [2018-11-23 13:16:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:19,048 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-23 13:16:19,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:16:19,049 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-11-23 13:16:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:16:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:16:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2018-11-23 13:16:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:16:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2018-11-23 13:16:19,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 47 transitions. [2018-11-23 13:16:19,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:16:19,108 INFO L225 Difference]: With dead ends: 51 [2018-11-23 13:16:19,108 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:16:19,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:16:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:16:19,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 13:16:19,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:16:19,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 13:16:19,146 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 13:16:19,146 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 13:16:19,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:19,150 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 13:16:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 13:16:19,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:19,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:19,150 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 13:16:19,151 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 13:16:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:16:19,152 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 13:16:19,152 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 13:16:19,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:16:19,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:16:19,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:16:19,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:16:19,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:16:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-23 13:16:19,155 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 34 [2018-11-23 13:16:19,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:16:19,155 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-23 13:16:19,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:16:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 13:16:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:16:19,156 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:16:19,156 INFO L402 BasicCegarLoop]: trace histogram [14, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:16:19,157 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:16:19,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:16:19,157 INFO L82 PathProgramCache]: Analyzing trace with hash 419627978, now seen corresponding path program 5 times [2018-11-23 13:16:19,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:16:19,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:16:19,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:19,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:16:19,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:16:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:16:20,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {1727#true} call ULTIMATE.init(); {1727#true} is VALID [2018-11-23 13:16:20,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {1727#true} assume true; {1727#true} is VALID [2018-11-23 13:16:20,491 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1727#true} {1727#true} #37#return; {1727#true} is VALID [2018-11-23 13:16:20,491 INFO L256 TraceCheckUtils]: 3: Hoare triple {1727#true} call #t~ret1 := main(); {1727#true} is VALID [2018-11-23 13:16:20,492 INFO L273 TraceCheckUtils]: 4: Hoare triple {1727#true} ~x~0 := 0; {1729#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:20,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {1729#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1729#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:16:20,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {1729#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1730#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:20,496 INFO L273 TraceCheckUtils]: 7: Hoare triple {1730#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1730#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:16:20,497 INFO L273 TraceCheckUtils]: 8: Hoare triple {1730#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1731#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:20,497 INFO L273 TraceCheckUtils]: 9: Hoare triple {1731#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1731#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:16:20,498 INFO L273 TraceCheckUtils]: 10: Hoare triple {1731#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1732#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:20,498 INFO L273 TraceCheckUtils]: 11: Hoare triple {1732#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1732#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:16:20,499 INFO L273 TraceCheckUtils]: 12: Hoare triple {1732#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1733#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:20,500 INFO L273 TraceCheckUtils]: 13: Hoare triple {1733#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {1733#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:16:20,501 INFO L273 TraceCheckUtils]: 14: Hoare triple {1733#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1734#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:20,502 INFO L273 TraceCheckUtils]: 15: Hoare triple {1734#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1734#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:16:20,503 INFO L273 TraceCheckUtils]: 16: Hoare triple {1734#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1735#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:20,504 INFO L273 TraceCheckUtils]: 17: Hoare triple {1735#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1735#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:16:20,505 INFO L273 TraceCheckUtils]: 18: Hoare triple {1735#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1736#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:20,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {1736#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1736#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:16:20,507 INFO L273 TraceCheckUtils]: 20: Hoare triple {1736#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1737#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:20,508 INFO L273 TraceCheckUtils]: 21: Hoare triple {1737#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {1737#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:16:20,516 INFO L273 TraceCheckUtils]: 22: Hoare triple {1737#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1738#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:16:20,516 INFO L273 TraceCheckUtils]: 23: Hoare triple {1738#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {1738#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:16:20,517 INFO L273 TraceCheckUtils]: 24: Hoare triple {1738#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1739#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:16:20,525 INFO L273 TraceCheckUtils]: 25: Hoare triple {1739#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1739#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:16:20,526 INFO L273 TraceCheckUtils]: 26: Hoare triple {1739#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1740#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:16:20,527 INFO L273 TraceCheckUtils]: 27: Hoare triple {1740#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {1740#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:16:20,528 INFO L273 TraceCheckUtils]: 28: Hoare triple {1740#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1741#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:16:20,528 INFO L273 TraceCheckUtils]: 29: Hoare triple {1741#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1741#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:16:20,529 INFO L273 TraceCheckUtils]: 30: Hoare triple {1741#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1742#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:16:20,529 INFO L273 TraceCheckUtils]: 31: Hoare triple {1742#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1742#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:16:20,530 INFO L273 TraceCheckUtils]: 32: Hoare triple {1742#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1743#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:16:20,531 INFO L273 TraceCheckUtils]: 33: Hoare triple {1743#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {1728#false} is VALID [2018-11-23 13:16:20,532 INFO L256 TraceCheckUtils]: 34: Hoare triple {1728#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {1728#false} is VALID [2018-11-23 13:16:20,532 INFO L273 TraceCheckUtils]: 35: Hoare triple {1728#false} ~cond := #in~cond; {1728#false} is VALID [2018-11-23 13:16:20,532 INFO L273 TraceCheckUtils]: 36: Hoare triple {1728#false} assume 0 == ~cond; {1728#false} is VALID [2018-11-23 13:16:20,532 INFO L273 TraceCheckUtils]: 37: Hoare triple {1728#false} assume !false; {1728#false} is VALID [2018-11-23 13:16:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:16:20,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:16:20,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:16:20,552 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:17:32,008 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2018-11-23 13:17:32,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:17:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:32,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:17:32,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {1727#true} call ULTIMATE.init(); {1727#true} is VALID [2018-11-23 13:17:32,223 INFO L273 TraceCheckUtils]: 1: Hoare triple {1727#true} assume true; {1727#true} is VALID [2018-11-23 13:17:32,223 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1727#true} {1727#true} #37#return; {1727#true} is VALID [2018-11-23 13:17:32,223 INFO L256 TraceCheckUtils]: 3: Hoare triple {1727#true} call #t~ret1 := main(); {1727#true} is VALID [2018-11-23 13:17:32,224 INFO L273 TraceCheckUtils]: 4: Hoare triple {1727#true} ~x~0 := 0; {1729#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:32,224 INFO L273 TraceCheckUtils]: 5: Hoare triple {1729#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1729#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:32,225 INFO L273 TraceCheckUtils]: 6: Hoare triple {1729#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1730#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:32,225 INFO L273 TraceCheckUtils]: 7: Hoare triple {1730#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1730#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:32,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {1730#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1731#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:32,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {1731#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1731#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:32,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {1731#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1732#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:32,228 INFO L273 TraceCheckUtils]: 11: Hoare triple {1732#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1732#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:32,229 INFO L273 TraceCheckUtils]: 12: Hoare triple {1732#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1733#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:32,232 INFO L273 TraceCheckUtils]: 13: Hoare triple {1733#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {1733#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:32,251 INFO L273 TraceCheckUtils]: 14: Hoare triple {1733#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1734#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:32,252 INFO L273 TraceCheckUtils]: 15: Hoare triple {1734#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1734#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:32,253 INFO L273 TraceCheckUtils]: 16: Hoare triple {1734#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1735#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:32,253 INFO L273 TraceCheckUtils]: 17: Hoare triple {1735#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1735#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:32,254 INFO L273 TraceCheckUtils]: 18: Hoare triple {1735#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1736#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:32,254 INFO L273 TraceCheckUtils]: 19: Hoare triple {1736#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1736#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:32,255 INFO L273 TraceCheckUtils]: 20: Hoare triple {1736#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1737#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:32,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {1737#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {1737#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:32,256 INFO L273 TraceCheckUtils]: 22: Hoare triple {1737#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1738#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:32,256 INFO L273 TraceCheckUtils]: 23: Hoare triple {1738#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {1738#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:32,257 INFO L273 TraceCheckUtils]: 24: Hoare triple {1738#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1739#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:32,258 INFO L273 TraceCheckUtils]: 25: Hoare triple {1739#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1739#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:32,262 INFO L273 TraceCheckUtils]: 26: Hoare triple {1739#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1740#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:32,262 INFO L273 TraceCheckUtils]: 27: Hoare triple {1740#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {1740#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:32,263 INFO L273 TraceCheckUtils]: 28: Hoare triple {1740#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {1741#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:32,263 INFO L273 TraceCheckUtils]: 29: Hoare triple {1741#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1741#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:32,267 INFO L273 TraceCheckUtils]: 30: Hoare triple {1741#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1742#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:32,267 INFO L273 TraceCheckUtils]: 31: Hoare triple {1742#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1742#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:32,268 INFO L273 TraceCheckUtils]: 32: Hoare triple {1742#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1728#false} is VALID [2018-11-23 13:17:32,268 INFO L273 TraceCheckUtils]: 33: Hoare triple {1728#false} assume !(~x~0 % 4294967296 < 100000000); {1728#false} is VALID [2018-11-23 13:17:32,268 INFO L256 TraceCheckUtils]: 34: Hoare triple {1728#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {1728#false} is VALID [2018-11-23 13:17:32,268 INFO L273 TraceCheckUtils]: 35: Hoare triple {1728#false} ~cond := #in~cond; {1728#false} is VALID [2018-11-23 13:17:32,268 INFO L273 TraceCheckUtils]: 36: Hoare triple {1728#false} assume 0 == ~cond; {1728#false} is VALID [2018-11-23 13:17:32,268 INFO L273 TraceCheckUtils]: 37: Hoare triple {1728#false} assume !false; {1728#false} is VALID [2018-11-23 13:17:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:17:32,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:17:32,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 17 [2018-11-23 13:17:32,293 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 13:17:32,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:17:32,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:17:32,337 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-23 13:17:32,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:17:32,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:17:32,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:17:32,338 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 17 states. [2018-11-23 13:17:33,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:33,628 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-23 13:17:33,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:17:33,628 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 13:17:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:17:33,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:17:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 51 transitions. [2018-11-23 13:17:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:17:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 51 transitions. [2018-11-23 13:17:33,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 51 transitions. [2018-11-23 13:17:33,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:33,717 INFO L225 Difference]: With dead ends: 55 [2018-11-23 13:17:33,717 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:17:33,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:17:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:17:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 13:17:33,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:17:33,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 13:17:33,761 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 13:17:33,761 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 13:17:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:33,763 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 13:17:33,763 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 13:17:33,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:33,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:33,764 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 13:17:33,764 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 13:17:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:33,765 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 13:17:33,765 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 13:17:33,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:33,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:33,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:17:33,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:17:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:17:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-23 13:17:33,767 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 38 [2018-11-23 13:17:33,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:17:33,768 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-23 13:17:33,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:17:33,768 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 13:17:33,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:17:33,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:17:33,769 INFO L402 BasicCegarLoop]: trace histogram [16, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:17:33,769 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:17:33,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:17:33,769 INFO L82 PathProgramCache]: Analyzing trace with hash -884180732, now seen corresponding path program 6 times [2018-11-23 13:17:33,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:17:33,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:17:33,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:33,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:17:33,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:34,694 INFO L256 TraceCheckUtils]: 0: Hoare triple {2095#true} call ULTIMATE.init(); {2095#true} is VALID [2018-11-23 13:17:34,694 INFO L273 TraceCheckUtils]: 1: Hoare triple {2095#true} assume true; {2095#true} is VALID [2018-11-23 13:17:34,694 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2095#true} {2095#true} #37#return; {2095#true} is VALID [2018-11-23 13:17:34,695 INFO L256 TraceCheckUtils]: 3: Hoare triple {2095#true} call #t~ret1 := main(); {2095#true} is VALID [2018-11-23 13:17:34,695 INFO L273 TraceCheckUtils]: 4: Hoare triple {2095#true} ~x~0 := 0; {2097#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:34,696 INFO L273 TraceCheckUtils]: 5: Hoare triple {2097#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2097#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:34,696 INFO L273 TraceCheckUtils]: 6: Hoare triple {2097#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2098#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:34,697 INFO L273 TraceCheckUtils]: 7: Hoare triple {2098#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2098#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:34,697 INFO L273 TraceCheckUtils]: 8: Hoare triple {2098#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2099#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:34,698 INFO L273 TraceCheckUtils]: 9: Hoare triple {2099#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2099#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:34,698 INFO L273 TraceCheckUtils]: 10: Hoare triple {2099#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2100#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:34,699 INFO L273 TraceCheckUtils]: 11: Hoare triple {2100#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2100#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:34,700 INFO L273 TraceCheckUtils]: 12: Hoare triple {2100#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2101#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:34,701 INFO L273 TraceCheckUtils]: 13: Hoare triple {2101#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {2101#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:34,702 INFO L273 TraceCheckUtils]: 14: Hoare triple {2101#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2102#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:34,703 INFO L273 TraceCheckUtils]: 15: Hoare triple {2102#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2102#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:34,703 INFO L273 TraceCheckUtils]: 16: Hoare triple {2102#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2103#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:34,704 INFO L273 TraceCheckUtils]: 17: Hoare triple {2103#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2103#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:34,705 INFO L273 TraceCheckUtils]: 18: Hoare triple {2103#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2104#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:34,706 INFO L273 TraceCheckUtils]: 19: Hoare triple {2104#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2104#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:34,707 INFO L273 TraceCheckUtils]: 20: Hoare triple {2104#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2105#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:34,708 INFO L273 TraceCheckUtils]: 21: Hoare triple {2105#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {2105#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:34,709 INFO L273 TraceCheckUtils]: 22: Hoare triple {2105#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2106#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:34,709 INFO L273 TraceCheckUtils]: 23: Hoare triple {2106#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {2106#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:34,710 INFO L273 TraceCheckUtils]: 24: Hoare triple {2106#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2107#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:34,711 INFO L273 TraceCheckUtils]: 25: Hoare triple {2107#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2107#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:34,712 INFO L273 TraceCheckUtils]: 26: Hoare triple {2107#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2108#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:34,713 INFO L273 TraceCheckUtils]: 27: Hoare triple {2108#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {2108#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:34,714 INFO L273 TraceCheckUtils]: 28: Hoare triple {2108#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2109#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:34,714 INFO L273 TraceCheckUtils]: 29: Hoare triple {2109#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2109#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:34,715 INFO L273 TraceCheckUtils]: 30: Hoare triple {2109#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2110#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:34,716 INFO L273 TraceCheckUtils]: 31: Hoare triple {2110#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2110#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:34,717 INFO L273 TraceCheckUtils]: 32: Hoare triple {2110#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2111#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:34,718 INFO L273 TraceCheckUtils]: 33: Hoare triple {2111#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2111#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:34,719 INFO L273 TraceCheckUtils]: 34: Hoare triple {2111#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2112#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:34,720 INFO L273 TraceCheckUtils]: 35: Hoare triple {2112#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2112#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:34,721 INFO L273 TraceCheckUtils]: 36: Hoare triple {2112#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2113#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:17:34,722 INFO L273 TraceCheckUtils]: 37: Hoare triple {2113#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {2096#false} is VALID [2018-11-23 13:17:34,722 INFO L256 TraceCheckUtils]: 38: Hoare triple {2096#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {2096#false} is VALID [2018-11-23 13:17:34,722 INFO L273 TraceCheckUtils]: 39: Hoare triple {2096#false} ~cond := #in~cond; {2096#false} is VALID [2018-11-23 13:17:34,722 INFO L273 TraceCheckUtils]: 40: Hoare triple {2096#false} assume 0 == ~cond; {2096#false} is VALID [2018-11-23 13:17:34,723 INFO L273 TraceCheckUtils]: 41: Hoare triple {2096#false} assume !false; {2096#false} is VALID [2018-11-23 13:17:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:17:34,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:17:34,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:17:34,745 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:17:34,804 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 13:17:34,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:17:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:34,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:17:35,453 INFO L256 TraceCheckUtils]: 0: Hoare triple {2095#true} call ULTIMATE.init(); {2095#true} is VALID [2018-11-23 13:17:35,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {2095#true} assume true; {2095#true} is VALID [2018-11-23 13:17:35,454 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2095#true} {2095#true} #37#return; {2095#true} is VALID [2018-11-23 13:17:35,454 INFO L256 TraceCheckUtils]: 3: Hoare triple {2095#true} call #t~ret1 := main(); {2095#true} is VALID [2018-11-23 13:17:35,455 INFO L273 TraceCheckUtils]: 4: Hoare triple {2095#true} ~x~0 := 0; {2095#true} is VALID [2018-11-23 13:17:35,455 INFO L273 TraceCheckUtils]: 5: Hoare triple {2095#true} assume !!(~x~0 % 4294967296 < 100000000); {2095#true} is VALID [2018-11-23 13:17:35,455 INFO L273 TraceCheckUtils]: 6: Hoare triple {2095#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2095#true} is VALID [2018-11-23 13:17:35,455 INFO L273 TraceCheckUtils]: 7: Hoare triple {2095#true} assume !!(~x~0 % 4294967296 < 100000000); {2095#true} is VALID [2018-11-23 13:17:35,455 INFO L273 TraceCheckUtils]: 8: Hoare triple {2095#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2095#true} is VALID [2018-11-23 13:17:35,456 INFO L273 TraceCheckUtils]: 9: Hoare triple {2095#true} assume !!(~x~0 % 4294967296 < 100000000); {2095#true} is VALID [2018-11-23 13:17:35,456 INFO L273 TraceCheckUtils]: 10: Hoare triple {2095#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2095#true} is VALID [2018-11-23 13:17:35,456 INFO L273 TraceCheckUtils]: 11: Hoare triple {2095#true} assume !!(~x~0 % 4294967296 < 100000000); {2095#true} is VALID [2018-11-23 13:17:35,456 INFO L273 TraceCheckUtils]: 12: Hoare triple {2095#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2095#true} is VALID [2018-11-23 13:17:35,456 INFO L273 TraceCheckUtils]: 13: Hoare triple {2095#true} assume !!(~x~0 % 4294967296 < 100000000); {2095#true} is VALID [2018-11-23 13:17:35,456 INFO L273 TraceCheckUtils]: 14: Hoare triple {2095#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2095#true} is VALID [2018-11-23 13:17:35,457 INFO L273 TraceCheckUtils]: 15: Hoare triple {2095#true} assume !!(~x~0 % 4294967296 < 100000000); {2095#true} is VALID [2018-11-23 13:17:35,457 INFO L273 TraceCheckUtils]: 16: Hoare triple {2095#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2095#true} is VALID [2018-11-23 13:17:35,457 INFO L273 TraceCheckUtils]: 17: Hoare triple {2095#true} assume !!(~x~0 % 4294967296 < 100000000); {2095#true} is VALID [2018-11-23 13:17:35,457 INFO L273 TraceCheckUtils]: 18: Hoare triple {2095#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2095#true} is VALID [2018-11-23 13:17:35,457 INFO L273 TraceCheckUtils]: 19: Hoare triple {2095#true} assume !!(~x~0 % 4294967296 < 100000000); {2095#true} is VALID [2018-11-23 13:17:35,457 INFO L273 TraceCheckUtils]: 20: Hoare triple {2095#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2095#true} is VALID [2018-11-23 13:17:35,458 INFO L273 TraceCheckUtils]: 21: Hoare triple {2095#true} assume !!(~x~0 % 4294967296 < 100000000); {2095#true} is VALID [2018-11-23 13:17:35,458 INFO L273 TraceCheckUtils]: 22: Hoare triple {2095#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2095#true} is VALID [2018-11-23 13:17:35,458 INFO L273 TraceCheckUtils]: 23: Hoare triple {2095#true} assume !!(~x~0 % 4294967296 < 100000000); {2095#true} is VALID [2018-11-23 13:17:35,458 INFO L273 TraceCheckUtils]: 24: Hoare triple {2095#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2095#true} is VALID [2018-11-23 13:17:35,458 INFO L273 TraceCheckUtils]: 25: Hoare triple {2095#true} assume !!(~x~0 % 4294967296 < 100000000); {2095#true} is VALID [2018-11-23 13:17:35,458 INFO L273 TraceCheckUtils]: 26: Hoare triple {2095#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2095#true} is VALID [2018-11-23 13:17:35,459 INFO L273 TraceCheckUtils]: 27: Hoare triple {2095#true} assume !!(~x~0 % 4294967296 < 100000000); {2095#true} is VALID [2018-11-23 13:17:35,459 INFO L273 TraceCheckUtils]: 28: Hoare triple {2095#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2095#true} is VALID [2018-11-23 13:17:35,459 INFO L273 TraceCheckUtils]: 29: Hoare triple {2095#true} assume !!(~x~0 % 4294967296 < 100000000); {2095#true} is VALID [2018-11-23 13:17:35,459 INFO L273 TraceCheckUtils]: 30: Hoare triple {2095#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2095#true} is VALID [2018-11-23 13:17:35,459 INFO L273 TraceCheckUtils]: 31: Hoare triple {2095#true} assume !!(~x~0 % 4294967296 < 100000000); {2095#true} is VALID [2018-11-23 13:17:35,460 INFO L273 TraceCheckUtils]: 32: Hoare triple {2095#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2213#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2018-11-23 13:17:35,461 INFO L273 TraceCheckUtils]: 33: Hoare triple {2213#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {2213#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2018-11-23 13:17:35,461 INFO L273 TraceCheckUtils]: 34: Hoare triple {2213#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2220#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2018-11-23 13:17:35,462 INFO L273 TraceCheckUtils]: 35: Hoare triple {2220#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {2220#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2018-11-23 13:17:35,464 INFO L273 TraceCheckUtils]: 36: Hoare triple {2220#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2227#(and (< (mod (+ main_~x~0 4294967291) 4294967296) 10000000) (<= 10000000 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2018-11-23 13:17:35,464 INFO L273 TraceCheckUtils]: 37: Hoare triple {2227#(and (< (mod (+ main_~x~0 4294967291) 4294967296) 10000000) (<= 10000000 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !(~x~0 % 4294967296 < 100000000); {2096#false} is VALID [2018-11-23 13:17:35,465 INFO L256 TraceCheckUtils]: 38: Hoare triple {2096#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {2096#false} is VALID [2018-11-23 13:17:35,465 INFO L273 TraceCheckUtils]: 39: Hoare triple {2096#false} ~cond := #in~cond; {2096#false} is VALID [2018-11-23 13:17:35,465 INFO L273 TraceCheckUtils]: 40: Hoare triple {2096#false} assume 0 == ~cond; {2096#false} is VALID [2018-11-23 13:17:35,465 INFO L273 TraceCheckUtils]: 41: Hoare triple {2096#false} assume !false; {2096#false} is VALID [2018-11-23 13:17:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 70 proven. 4 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-23 13:17:35,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:17:35,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 5] total 22 [2018-11-23 13:17:35,487 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-11-23 13:17:35,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:17:35,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:17:35,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:35,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:17:35,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:17:35,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:17:35,598 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 22 states. [2018-11-23 13:17:37,739 WARN L180 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-23 13:17:41,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:41,355 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-23 13:17:41,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:17:41,356 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-11-23 13:17:41,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:17:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:17:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 67 transitions. [2018-11-23 13:17:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:17:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 67 transitions. [2018-11-23 13:17:41,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 67 transitions. [2018-11-23 13:17:41,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:41,489 INFO L225 Difference]: With dead ends: 63 [2018-11-23 13:17:41,489 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:17:41,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:17:41,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:17:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-23 13:17:41,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:17:41,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2018-11-23 13:17:41,556 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2018-11-23 13:17:41,556 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2018-11-23 13:17:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:41,560 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 13:17:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 13:17:41,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:41,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:41,561 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2018-11-23 13:17:41,561 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2018-11-23 13:17:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:41,562 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 13:17:41,562 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 13:17:41,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:41,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:41,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:17:41,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:17:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:17:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-11-23 13:17:41,565 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 42 [2018-11-23 13:17:41,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:17:41,565 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-11-23 13:17:41,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:17:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 13:17:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:17:41,566 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:17:41,566 INFO L402 BasicCegarLoop]: trace histogram [19, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:17:41,567 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:17:41,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:17:41,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1168417095, now seen corresponding path program 7 times [2018-11-23 13:17:41,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:17:41,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:17:41,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:41,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:17:41,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:42,265 INFO L256 TraceCheckUtils]: 0: Hoare triple {2524#true} call ULTIMATE.init(); {2524#true} is VALID [2018-11-23 13:17:42,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {2524#true} assume true; {2524#true} is VALID [2018-11-23 13:17:42,266 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2524#true} {2524#true} #37#return; {2524#true} is VALID [2018-11-23 13:17:42,266 INFO L256 TraceCheckUtils]: 3: Hoare triple {2524#true} call #t~ret1 := main(); {2524#true} is VALID [2018-11-23 13:17:42,267 INFO L273 TraceCheckUtils]: 4: Hoare triple {2524#true} ~x~0 := 0; {2526#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:42,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {2526#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2526#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:42,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {2526#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2527#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:42,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {2527#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2527#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:42,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {2527#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:42,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {2528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:42,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {2528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2529#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:42,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {2529#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2529#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:42,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {2529#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2530#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:42,274 INFO L273 TraceCheckUtils]: 13: Hoare triple {2530#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {2530#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:42,275 INFO L273 TraceCheckUtils]: 14: Hoare triple {2530#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2531#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:42,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {2531#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2531#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:42,277 INFO L273 TraceCheckUtils]: 16: Hoare triple {2531#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2532#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:42,278 INFO L273 TraceCheckUtils]: 17: Hoare triple {2532#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2532#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:42,279 INFO L273 TraceCheckUtils]: 18: Hoare triple {2532#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2533#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:42,279 INFO L273 TraceCheckUtils]: 19: Hoare triple {2533#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2533#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:42,280 INFO L273 TraceCheckUtils]: 20: Hoare triple {2533#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2534#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:42,281 INFO L273 TraceCheckUtils]: 21: Hoare triple {2534#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {2534#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:42,282 INFO L273 TraceCheckUtils]: 22: Hoare triple {2534#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2535#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:42,283 INFO L273 TraceCheckUtils]: 23: Hoare triple {2535#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {2535#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:42,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {2535#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2536#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:42,284 INFO L273 TraceCheckUtils]: 25: Hoare triple {2536#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2536#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:42,285 INFO L273 TraceCheckUtils]: 26: Hoare triple {2536#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2537#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:42,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {2537#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {2537#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:42,287 INFO L273 TraceCheckUtils]: 28: Hoare triple {2537#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2538#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:42,288 INFO L273 TraceCheckUtils]: 29: Hoare triple {2538#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2538#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:42,289 INFO L273 TraceCheckUtils]: 30: Hoare triple {2538#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2539#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:42,289 INFO L273 TraceCheckUtils]: 31: Hoare triple {2539#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2539#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:42,290 INFO L273 TraceCheckUtils]: 32: Hoare triple {2539#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2540#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:42,291 INFO L273 TraceCheckUtils]: 33: Hoare triple {2540#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2540#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:42,292 INFO L273 TraceCheckUtils]: 34: Hoare triple {2540#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2541#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:42,293 INFO L273 TraceCheckUtils]: 35: Hoare triple {2541#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {2541#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:42,308 INFO L273 TraceCheckUtils]: 36: Hoare triple {2541#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2542#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:42,309 INFO L273 TraceCheckUtils]: 37: Hoare triple {2542#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2542#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:42,310 INFO L273 TraceCheckUtils]: 38: Hoare triple {2542#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2543#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:17:42,310 INFO L273 TraceCheckUtils]: 39: Hoare triple {2543#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2543#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:17:42,311 INFO L273 TraceCheckUtils]: 40: Hoare triple {2543#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2544#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:17:42,311 INFO L273 TraceCheckUtils]: 41: Hoare triple {2544#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 100000000); {2544#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:17:42,312 INFO L273 TraceCheckUtils]: 42: Hoare triple {2544#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2545#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:17:42,313 INFO L273 TraceCheckUtils]: 43: Hoare triple {2545#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {2525#false} is VALID [2018-11-23 13:17:42,313 INFO L256 TraceCheckUtils]: 44: Hoare triple {2525#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {2525#false} is VALID [2018-11-23 13:17:42,313 INFO L273 TraceCheckUtils]: 45: Hoare triple {2525#false} ~cond := #in~cond; {2525#false} is VALID [2018-11-23 13:17:42,313 INFO L273 TraceCheckUtils]: 46: Hoare triple {2525#false} assume 0 == ~cond; {2525#false} is VALID [2018-11-23 13:17:42,314 INFO L273 TraceCheckUtils]: 47: Hoare triple {2525#false} assume !false; {2525#false} is VALID [2018-11-23 13:17:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:17:42,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:17:42,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:17:42,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:17:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:42,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:17:42,736 INFO L256 TraceCheckUtils]: 0: Hoare triple {2524#true} call ULTIMATE.init(); {2524#true} is VALID [2018-11-23 13:17:42,737 INFO L273 TraceCheckUtils]: 1: Hoare triple {2524#true} assume true; {2524#true} is VALID [2018-11-23 13:17:42,737 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2524#true} {2524#true} #37#return; {2524#true} is VALID [2018-11-23 13:17:42,737 INFO L256 TraceCheckUtils]: 3: Hoare triple {2524#true} call #t~ret1 := main(); {2524#true} is VALID [2018-11-23 13:17:42,738 INFO L273 TraceCheckUtils]: 4: Hoare triple {2524#true} ~x~0 := 0; {2526#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:42,738 INFO L273 TraceCheckUtils]: 5: Hoare triple {2526#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2526#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:42,739 INFO L273 TraceCheckUtils]: 6: Hoare triple {2526#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2527#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:42,739 INFO L273 TraceCheckUtils]: 7: Hoare triple {2527#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2527#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:42,740 INFO L273 TraceCheckUtils]: 8: Hoare triple {2527#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:42,740 INFO L273 TraceCheckUtils]: 9: Hoare triple {2528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:42,741 INFO L273 TraceCheckUtils]: 10: Hoare triple {2528#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2529#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:42,741 INFO L273 TraceCheckUtils]: 11: Hoare triple {2529#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2529#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:42,742 INFO L273 TraceCheckUtils]: 12: Hoare triple {2529#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2530#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:42,743 INFO L273 TraceCheckUtils]: 13: Hoare triple {2530#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {2530#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:42,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {2530#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2531#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:42,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {2531#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2531#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:42,746 INFO L273 TraceCheckUtils]: 16: Hoare triple {2531#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2532#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:42,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {2532#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2532#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:42,747 INFO L273 TraceCheckUtils]: 18: Hoare triple {2532#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2533#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:42,748 INFO L273 TraceCheckUtils]: 19: Hoare triple {2533#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2533#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:42,749 INFO L273 TraceCheckUtils]: 20: Hoare triple {2533#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2534#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:42,750 INFO L273 TraceCheckUtils]: 21: Hoare triple {2534#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {2534#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:42,751 INFO L273 TraceCheckUtils]: 22: Hoare triple {2534#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2535#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:42,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {2535#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {2535#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:42,752 INFO L273 TraceCheckUtils]: 24: Hoare triple {2535#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2536#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:42,753 INFO L273 TraceCheckUtils]: 25: Hoare triple {2536#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2536#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:42,754 INFO L273 TraceCheckUtils]: 26: Hoare triple {2536#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2537#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:42,755 INFO L273 TraceCheckUtils]: 27: Hoare triple {2537#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {2537#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:42,756 INFO L273 TraceCheckUtils]: 28: Hoare triple {2537#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2538#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:42,756 INFO L273 TraceCheckUtils]: 29: Hoare triple {2538#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2538#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:42,757 INFO L273 TraceCheckUtils]: 30: Hoare triple {2538#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2539#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:42,758 INFO L273 TraceCheckUtils]: 31: Hoare triple {2539#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2539#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:42,759 INFO L273 TraceCheckUtils]: 32: Hoare triple {2539#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2540#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:42,760 INFO L273 TraceCheckUtils]: 33: Hoare triple {2540#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2540#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:42,761 INFO L273 TraceCheckUtils]: 34: Hoare triple {2540#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2541#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:42,761 INFO L273 TraceCheckUtils]: 35: Hoare triple {2541#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {2541#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:42,762 INFO L273 TraceCheckUtils]: 36: Hoare triple {2541#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2542#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:42,763 INFO L273 TraceCheckUtils]: 37: Hoare triple {2542#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2542#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:42,764 INFO L273 TraceCheckUtils]: 38: Hoare triple {2542#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2525#false} is VALID [2018-11-23 13:17:42,764 INFO L273 TraceCheckUtils]: 39: Hoare triple {2525#false} assume !!(~x~0 % 4294967296 < 100000000); {2525#false} is VALID [2018-11-23 13:17:42,765 INFO L273 TraceCheckUtils]: 40: Hoare triple {2525#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2525#false} is VALID [2018-11-23 13:17:42,765 INFO L273 TraceCheckUtils]: 41: Hoare triple {2525#false} assume !!(~x~0 % 4294967296 < 100000000); {2525#false} is VALID [2018-11-23 13:17:42,765 INFO L273 TraceCheckUtils]: 42: Hoare triple {2525#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2525#false} is VALID [2018-11-23 13:17:42,765 INFO L273 TraceCheckUtils]: 43: Hoare triple {2525#false} assume !(~x~0 % 4294967296 < 100000000); {2525#false} is VALID [2018-11-23 13:17:42,765 INFO L256 TraceCheckUtils]: 44: Hoare triple {2525#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {2525#false} is VALID [2018-11-23 13:17:42,766 INFO L273 TraceCheckUtils]: 45: Hoare triple {2525#false} ~cond := #in~cond; {2525#false} is VALID [2018-11-23 13:17:42,766 INFO L273 TraceCheckUtils]: 46: Hoare triple {2525#false} assume 0 == ~cond; {2525#false} is VALID [2018-11-23 13:17:42,766 INFO L273 TraceCheckUtils]: 47: Hoare triple {2525#false} assume !false; {2525#false} is VALID [2018-11-23 13:17:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 85 proven. 272 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:17:42,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:17:42,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 22 [2018-11-23 13:17:42,788 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 13:17:42,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:17:42,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:17:42,845 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-23 13:17:42,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:17:42,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:17:42,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:17:42,846 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 22 states. [2018-11-23 13:17:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:45,076 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-11-23 13:17:45,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:17:45,076 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-11-23 13:17:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:17:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:17:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2018-11-23 13:17:45,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:17:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2018-11-23 13:17:45,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 59 transitions. [2018-11-23 13:17:45,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:45,192 INFO L225 Difference]: With dead ends: 67 [2018-11-23 13:17:45,192 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 13:17:45,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:17:45,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 13:17:45,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 13:17:45,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:17:45,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-23 13:17:45,248 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 13:17:45,248 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 13:17:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:45,250 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 13:17:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 13:17:45,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:45,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:45,251 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 13:17:45,251 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 13:17:45,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:45,252 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 13:17:45,252 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 13:17:45,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:45,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:45,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:17:45,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:17:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 13:17:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-11-23 13:17:45,254 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 48 [2018-11-23 13:17:45,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:17:45,254 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-11-23 13:17:45,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:17:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 13:17:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 13:17:45,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:17:45,255 INFO L402 BasicCegarLoop]: trace histogram [21, 18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:17:45,255 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:17:45,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:17:45,255 INFO L82 PathProgramCache]: Analyzing trace with hash 652678003, now seen corresponding path program 8 times [2018-11-23 13:17:45,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:17:45,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:17:45,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:45,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:17:45,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:45,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {2980#true} call ULTIMATE.init(); {2980#true} is VALID [2018-11-23 13:17:45,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {2980#true} assume true; {2980#true} is VALID [2018-11-23 13:17:45,793 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2980#true} {2980#true} #37#return; {2980#true} is VALID [2018-11-23 13:17:45,793 INFO L256 TraceCheckUtils]: 3: Hoare triple {2980#true} call #t~ret1 := main(); {2980#true} is VALID [2018-11-23 13:17:45,794 INFO L273 TraceCheckUtils]: 4: Hoare triple {2980#true} ~x~0 := 0; {2982#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:45,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {2982#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2982#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:45,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {2982#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2983#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:45,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {2983#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2983#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:45,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {2983#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2984#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:45,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {2984#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2984#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:45,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {2984#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2985#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:45,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {2985#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2985#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:45,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {2985#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2986#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:45,801 INFO L273 TraceCheckUtils]: 13: Hoare triple {2986#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {2986#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:45,802 INFO L273 TraceCheckUtils]: 14: Hoare triple {2986#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2987#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:45,803 INFO L273 TraceCheckUtils]: 15: Hoare triple {2987#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2987#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:45,804 INFO L273 TraceCheckUtils]: 16: Hoare triple {2987#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2988#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:45,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {2988#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2988#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:45,805 INFO L273 TraceCheckUtils]: 18: Hoare triple {2988#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2989#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:45,806 INFO L273 TraceCheckUtils]: 19: Hoare triple {2989#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2989#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:45,807 INFO L273 TraceCheckUtils]: 20: Hoare triple {2989#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2990#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:45,808 INFO L273 TraceCheckUtils]: 21: Hoare triple {2990#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {2990#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:45,809 INFO L273 TraceCheckUtils]: 22: Hoare triple {2990#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2991#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:45,809 INFO L273 TraceCheckUtils]: 23: Hoare triple {2991#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {2991#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:45,810 INFO L273 TraceCheckUtils]: 24: Hoare triple {2991#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2992#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:45,811 INFO L273 TraceCheckUtils]: 25: Hoare triple {2992#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2992#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:45,812 INFO L273 TraceCheckUtils]: 26: Hoare triple {2992#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2993#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:45,813 INFO L273 TraceCheckUtils]: 27: Hoare triple {2993#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {2993#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:45,814 INFO L273 TraceCheckUtils]: 28: Hoare triple {2993#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2994#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:45,814 INFO L273 TraceCheckUtils]: 29: Hoare triple {2994#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2994#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:45,815 INFO L273 TraceCheckUtils]: 30: Hoare triple {2994#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2995#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:45,816 INFO L273 TraceCheckUtils]: 31: Hoare triple {2995#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2995#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:45,817 INFO L273 TraceCheckUtils]: 32: Hoare triple {2995#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2996#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:45,818 INFO L273 TraceCheckUtils]: 33: Hoare triple {2996#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2996#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:45,819 INFO L273 TraceCheckUtils]: 34: Hoare triple {2996#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2997#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:45,819 INFO L273 TraceCheckUtils]: 35: Hoare triple {2997#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {2997#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:45,820 INFO L273 TraceCheckUtils]: 36: Hoare triple {2997#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2998#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:45,821 INFO L273 TraceCheckUtils]: 37: Hoare triple {2998#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2998#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:45,822 INFO L273 TraceCheckUtils]: 38: Hoare triple {2998#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2999#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:17:45,823 INFO L273 TraceCheckUtils]: 39: Hoare triple {2999#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2999#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:17:45,824 INFO L273 TraceCheckUtils]: 40: Hoare triple {2999#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3000#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:17:45,825 INFO L273 TraceCheckUtils]: 41: Hoare triple {3000#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3000#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:17:45,825 INFO L273 TraceCheckUtils]: 42: Hoare triple {3000#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3001#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:17:45,826 INFO L273 TraceCheckUtils]: 43: Hoare triple {3001#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 100000000); {3001#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:17:45,827 INFO L273 TraceCheckUtils]: 44: Hoare triple {3001#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3002#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:17:45,828 INFO L273 TraceCheckUtils]: 45: Hoare triple {3002#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3002#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:17:45,829 INFO L273 TraceCheckUtils]: 46: Hoare triple {3002#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3003#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:17:45,830 INFO L273 TraceCheckUtils]: 47: Hoare triple {3003#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {2981#false} is VALID [2018-11-23 13:17:45,830 INFO L256 TraceCheckUtils]: 48: Hoare triple {2981#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {2981#false} is VALID [2018-11-23 13:17:45,830 INFO L273 TraceCheckUtils]: 49: Hoare triple {2981#false} ~cond := #in~cond; {2981#false} is VALID [2018-11-23 13:17:45,831 INFO L273 TraceCheckUtils]: 50: Hoare triple {2981#false} assume 0 == ~cond; {2981#false} is VALID [2018-11-23 13:17:45,831 INFO L273 TraceCheckUtils]: 51: Hoare triple {2981#false} assume !false; {2981#false} is VALID [2018-11-23 13:17:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:17:45,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:17:45,836 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:17:45,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:17:45,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:17:45,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:17:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:45,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:17:46,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {2980#true} call ULTIMATE.init(); {2980#true} is VALID [2018-11-23 13:17:46,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {2980#true} assume true; {2980#true} is VALID [2018-11-23 13:17:46,067 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2980#true} {2980#true} #37#return; {2980#true} is VALID [2018-11-23 13:17:46,067 INFO L256 TraceCheckUtils]: 3: Hoare triple {2980#true} call #t~ret1 := main(); {2980#true} is VALID [2018-11-23 13:17:46,067 INFO L273 TraceCheckUtils]: 4: Hoare triple {2980#true} ~x~0 := 0; {2982#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:46,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {2982#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2982#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:46,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {2982#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2983#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:46,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {2983#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2983#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:46,070 INFO L273 TraceCheckUtils]: 8: Hoare triple {2983#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2984#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:46,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {2984#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2984#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:46,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {2984#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2985#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:46,073 INFO L273 TraceCheckUtils]: 11: Hoare triple {2985#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2985#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:46,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {2985#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2986#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:46,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {2986#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {2986#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:46,075 INFO L273 TraceCheckUtils]: 14: Hoare triple {2986#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2987#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:46,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {2987#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2987#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:46,077 INFO L273 TraceCheckUtils]: 16: Hoare triple {2987#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2988#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:46,078 INFO L273 TraceCheckUtils]: 17: Hoare triple {2988#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2988#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:46,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {2988#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2989#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:46,079 INFO L273 TraceCheckUtils]: 19: Hoare triple {2989#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2989#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:46,080 INFO L273 TraceCheckUtils]: 20: Hoare triple {2989#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2990#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:46,081 INFO L273 TraceCheckUtils]: 21: Hoare triple {2990#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {2990#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:46,082 INFO L273 TraceCheckUtils]: 22: Hoare triple {2990#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2991#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:46,083 INFO L273 TraceCheckUtils]: 23: Hoare triple {2991#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {2991#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:46,083 INFO L273 TraceCheckUtils]: 24: Hoare triple {2991#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2992#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:46,084 INFO L273 TraceCheckUtils]: 25: Hoare triple {2992#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2992#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:46,085 INFO L273 TraceCheckUtils]: 26: Hoare triple {2992#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2993#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:46,086 INFO L273 TraceCheckUtils]: 27: Hoare triple {2993#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {2993#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:46,087 INFO L273 TraceCheckUtils]: 28: Hoare triple {2993#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2994#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:46,088 INFO L273 TraceCheckUtils]: 29: Hoare triple {2994#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2994#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:46,089 INFO L273 TraceCheckUtils]: 30: Hoare triple {2994#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2995#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:46,089 INFO L273 TraceCheckUtils]: 31: Hoare triple {2995#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2995#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:46,100 INFO L273 TraceCheckUtils]: 32: Hoare triple {2995#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2996#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:46,101 INFO L273 TraceCheckUtils]: 33: Hoare triple {2996#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2996#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:46,101 INFO L273 TraceCheckUtils]: 34: Hoare triple {2996#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2997#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:46,102 INFO L273 TraceCheckUtils]: 35: Hoare triple {2997#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {2997#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:46,102 INFO L273 TraceCheckUtils]: 36: Hoare triple {2997#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2998#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:46,103 INFO L273 TraceCheckUtils]: 37: Hoare triple {2998#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2998#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:46,123 INFO L273 TraceCheckUtils]: 38: Hoare triple {2998#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {2999#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:17:46,125 INFO L273 TraceCheckUtils]: 39: Hoare triple {2999#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2999#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:17:46,126 INFO L273 TraceCheckUtils]: 40: Hoare triple {2999#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3000#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:17:46,126 INFO L273 TraceCheckUtils]: 41: Hoare triple {3000#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3000#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:17:46,127 INFO L273 TraceCheckUtils]: 42: Hoare triple {3000#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3001#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:17:46,127 INFO L273 TraceCheckUtils]: 43: Hoare triple {3001#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 100000000); {3001#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:17:46,128 INFO L273 TraceCheckUtils]: 44: Hoare triple {3001#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3002#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:17:46,128 INFO L273 TraceCheckUtils]: 45: Hoare triple {3002#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3002#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:17:46,129 INFO L273 TraceCheckUtils]: 46: Hoare triple {3002#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3145#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:17:46,130 INFO L273 TraceCheckUtils]: 47: Hoare triple {3145#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {2981#false} is VALID [2018-11-23 13:17:46,130 INFO L256 TraceCheckUtils]: 48: Hoare triple {2981#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {2981#false} is VALID [2018-11-23 13:17:46,130 INFO L273 TraceCheckUtils]: 49: Hoare triple {2981#false} ~cond := #in~cond; {2981#false} is VALID [2018-11-23 13:17:46,130 INFO L273 TraceCheckUtils]: 50: Hoare triple {2981#false} assume 0 == ~cond; {2981#false} is VALID [2018-11-23 13:17:46,131 INFO L273 TraceCheckUtils]: 51: Hoare triple {2981#false} assume !false; {2981#false} is VALID [2018-11-23 13:17:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:17:46,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:17:46,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 13:17:46,154 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-11-23 13:17:46,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:17:46,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:17:46,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:46,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:17:46,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:17:46,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:17:46,220 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 25 states. [2018-11-23 13:17:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:48,720 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-11-23 13:17:48,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:17:48,720 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-11-23 13:17:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:17:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:17:48,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 63 transitions. [2018-11-23 13:17:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:17:48,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 63 transitions. [2018-11-23 13:17:48,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 63 transitions. [2018-11-23 13:17:48,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:48,798 INFO L225 Difference]: With dead ends: 71 [2018-11-23 13:17:48,798 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 13:17:48,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:17:48,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 13:17:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 13:17:48,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:17:48,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 13:17:48,978 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 13:17:48,978 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 13:17:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:48,980 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 13:17:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 13:17:48,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:48,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:48,980 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 13:17:48,980 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 13:17:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:17:48,981 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 13:17:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 13:17:48,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:17:48,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:17:48,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:17:48,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:17:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 13:17:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-23 13:17:48,984 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 52 [2018-11-23 13:17:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:17:48,984 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-23 13:17:48,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:17:48,984 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 13:17:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:17:48,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:17:48,985 INFO L402 BasicCegarLoop]: trace histogram [23, 20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:17:48,985 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:17:48,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:17:48,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1219877677, now seen corresponding path program 9 times [2018-11-23 13:17:48,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:17:48,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:17:48,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:48,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:17:48,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:17:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:49,656 INFO L256 TraceCheckUtils]: 0: Hoare triple {3471#true} call ULTIMATE.init(); {3471#true} is VALID [2018-11-23 13:17:49,656 INFO L273 TraceCheckUtils]: 1: Hoare triple {3471#true} assume true; {3471#true} is VALID [2018-11-23 13:17:49,657 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3471#true} {3471#true} #37#return; {3471#true} is VALID [2018-11-23 13:17:49,657 INFO L256 TraceCheckUtils]: 3: Hoare triple {3471#true} call #t~ret1 := main(); {3471#true} is VALID [2018-11-23 13:17:49,657 INFO L273 TraceCheckUtils]: 4: Hoare triple {3471#true} ~x~0 := 0; {3473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:49,658 INFO L273 TraceCheckUtils]: 5: Hoare triple {3473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:17:49,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {3473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:49,659 INFO L273 TraceCheckUtils]: 7: Hoare triple {3474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:17:49,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {3474#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:49,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {3475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {3475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:17:49,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {3475#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3476#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:49,661 INFO L273 TraceCheckUtils]: 11: Hoare triple {3476#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3476#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:17:49,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {3476#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3477#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:49,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {3477#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {3477#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:17:49,664 INFO L273 TraceCheckUtils]: 14: Hoare triple {3477#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3478#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:49,664 INFO L273 TraceCheckUtils]: 15: Hoare triple {3478#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {3478#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:17:49,665 INFO L273 TraceCheckUtils]: 16: Hoare triple {3478#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3479#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:49,666 INFO L273 TraceCheckUtils]: 17: Hoare triple {3479#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3479#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:17:49,667 INFO L273 TraceCheckUtils]: 18: Hoare triple {3479#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3480#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:49,668 INFO L273 TraceCheckUtils]: 19: Hoare triple {3480#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3480#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:17:49,669 INFO L273 TraceCheckUtils]: 20: Hoare triple {3480#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3481#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:49,669 INFO L273 TraceCheckUtils]: 21: Hoare triple {3481#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {3481#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:17:49,670 INFO L273 TraceCheckUtils]: 22: Hoare triple {3481#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3482#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:49,671 INFO L273 TraceCheckUtils]: 23: Hoare triple {3482#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {3482#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:17:49,672 INFO L273 TraceCheckUtils]: 24: Hoare triple {3482#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3483#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:49,673 INFO L273 TraceCheckUtils]: 25: Hoare triple {3483#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3483#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:17:49,674 INFO L273 TraceCheckUtils]: 26: Hoare triple {3483#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3484#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:49,674 INFO L273 TraceCheckUtils]: 27: Hoare triple {3484#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {3484#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:17:49,675 INFO L273 TraceCheckUtils]: 28: Hoare triple {3484#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3485#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:49,676 INFO L273 TraceCheckUtils]: 29: Hoare triple {3485#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3485#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:17:49,677 INFO L273 TraceCheckUtils]: 30: Hoare triple {3485#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3486#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:49,678 INFO L273 TraceCheckUtils]: 31: Hoare triple {3486#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3486#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:17:49,679 INFO L273 TraceCheckUtils]: 32: Hoare triple {3486#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3487#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:49,679 INFO L273 TraceCheckUtils]: 33: Hoare triple {3487#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3487#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:17:49,680 INFO L273 TraceCheckUtils]: 34: Hoare triple {3487#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3488#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:49,681 INFO L273 TraceCheckUtils]: 35: Hoare triple {3488#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {3488#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:17:49,682 INFO L273 TraceCheckUtils]: 36: Hoare triple {3488#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3489#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:49,683 INFO L273 TraceCheckUtils]: 37: Hoare triple {3489#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3489#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:17:49,684 INFO L273 TraceCheckUtils]: 38: Hoare triple {3489#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3490#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:17:49,685 INFO L273 TraceCheckUtils]: 39: Hoare triple {3490#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3490#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:17:49,686 INFO L273 TraceCheckUtils]: 40: Hoare triple {3490#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3491#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:17:49,686 INFO L273 TraceCheckUtils]: 41: Hoare triple {3491#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3491#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:17:49,687 INFO L273 TraceCheckUtils]: 42: Hoare triple {3491#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3492#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:17:49,688 INFO L273 TraceCheckUtils]: 43: Hoare triple {3492#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3492#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:17:49,689 INFO L273 TraceCheckUtils]: 44: Hoare triple {3492#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3493#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:17:49,690 INFO L273 TraceCheckUtils]: 45: Hoare triple {3493#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 100000000); {3493#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:17:49,691 INFO L273 TraceCheckUtils]: 46: Hoare triple {3493#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3494#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:17:49,691 INFO L273 TraceCheckUtils]: 47: Hoare triple {3494#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3494#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:17:49,692 INFO L273 TraceCheckUtils]: 48: Hoare triple {3494#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3495#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:17:49,693 INFO L273 TraceCheckUtils]: 49: Hoare triple {3495#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3495#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:17:49,694 INFO L273 TraceCheckUtils]: 50: Hoare triple {3495#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3496#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:17:49,695 INFO L273 TraceCheckUtils]: 51: Hoare triple {3496#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 100000000); {3472#false} is VALID [2018-11-23 13:17:49,695 INFO L256 TraceCheckUtils]: 52: Hoare triple {3472#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {3472#false} is VALID [2018-11-23 13:17:49,695 INFO L273 TraceCheckUtils]: 53: Hoare triple {3472#false} ~cond := #in~cond; {3472#false} is VALID [2018-11-23 13:17:49,696 INFO L273 TraceCheckUtils]: 54: Hoare triple {3472#false} assume 0 == ~cond; {3472#false} is VALID [2018-11-23 13:17:49,696 INFO L273 TraceCheckUtils]: 55: Hoare triple {3472#false} assume !false; {3472#false} is VALID [2018-11-23 13:17:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:17:49,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:17:49,701 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:17:49,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:17:49,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 13:17:49,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:17:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:17:49,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:17:49,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {3471#true} call ULTIMATE.init(); {3471#true} is VALID [2018-11-23 13:17:49,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {3471#true} assume true; {3471#true} is VALID [2018-11-23 13:17:49,939 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3471#true} {3471#true} #37#return; {3471#true} is VALID [2018-11-23 13:17:49,940 INFO L256 TraceCheckUtils]: 3: Hoare triple {3471#true} call #t~ret1 := main(); {3471#true} is VALID [2018-11-23 13:17:49,940 INFO L273 TraceCheckUtils]: 4: Hoare triple {3471#true} ~x~0 := 0; {3471#true} is VALID [2018-11-23 13:17:49,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,941 INFO L273 TraceCheckUtils]: 10: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,941 INFO L273 TraceCheckUtils]: 14: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,941 INFO L273 TraceCheckUtils]: 15: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,942 INFO L273 TraceCheckUtils]: 16: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,942 INFO L273 TraceCheckUtils]: 17: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,942 INFO L273 TraceCheckUtils]: 18: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,942 INFO L273 TraceCheckUtils]: 19: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,942 INFO L273 TraceCheckUtils]: 20: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,942 INFO L273 TraceCheckUtils]: 21: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,942 INFO L273 TraceCheckUtils]: 22: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,942 INFO L273 TraceCheckUtils]: 23: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,942 INFO L273 TraceCheckUtils]: 24: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,943 INFO L273 TraceCheckUtils]: 25: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,943 INFO L273 TraceCheckUtils]: 26: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,943 INFO L273 TraceCheckUtils]: 27: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,943 INFO L273 TraceCheckUtils]: 28: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,943 INFO L273 TraceCheckUtils]: 29: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,943 INFO L273 TraceCheckUtils]: 30: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,943 INFO L273 TraceCheckUtils]: 31: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,943 INFO L273 TraceCheckUtils]: 32: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,944 INFO L273 TraceCheckUtils]: 33: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,944 INFO L273 TraceCheckUtils]: 34: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,944 INFO L273 TraceCheckUtils]: 35: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,944 INFO L273 TraceCheckUtils]: 36: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,944 INFO L273 TraceCheckUtils]: 37: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,944 INFO L273 TraceCheckUtils]: 38: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,944 INFO L273 TraceCheckUtils]: 39: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,944 INFO L273 TraceCheckUtils]: 40: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,945 INFO L273 TraceCheckUtils]: 41: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,945 INFO L273 TraceCheckUtils]: 42: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3471#true} is VALID [2018-11-23 13:17:49,945 INFO L273 TraceCheckUtils]: 43: Hoare triple {3471#true} assume !!(~x~0 % 4294967296 < 100000000); {3471#true} is VALID [2018-11-23 13:17:49,946 INFO L273 TraceCheckUtils]: 44: Hoare triple {3471#true} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {3632#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2018-11-23 13:17:49,946 INFO L273 TraceCheckUtils]: 45: Hoare triple {3632#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {3632#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2018-11-23 13:17:49,964 INFO L273 TraceCheckUtils]: 46: Hoare triple {3632#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3639#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2018-11-23 13:17:49,973 INFO L273 TraceCheckUtils]: 47: Hoare triple {3639#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {3639#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} is VALID [2018-11-23 13:17:49,987 INFO L273 TraceCheckUtils]: 48: Hoare triple {3639#(< (mod (+ main_~x~0 4294967293) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3646#(< (mod (+ main_~x~0 4294967291) 4294967296) 10000000)} is VALID [2018-11-23 13:17:49,996 INFO L273 TraceCheckUtils]: 49: Hoare triple {3646#(< (mod (+ main_~x~0 4294967291) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {3646#(< (mod (+ main_~x~0 4294967291) 4294967296) 10000000)} is VALID [2018-11-23 13:17:50,009 INFO L273 TraceCheckUtils]: 50: Hoare triple {3646#(< (mod (+ main_~x~0 4294967291) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3653#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} is VALID [2018-11-23 13:17:50,018 INFO L273 TraceCheckUtils]: 51: Hoare triple {3653#(< (mod (+ main_~x~0 4294967289) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 100000000); {3472#false} is VALID [2018-11-23 13:17:50,018 INFO L256 TraceCheckUtils]: 52: Hoare triple {3472#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {3472#false} is VALID [2018-11-23 13:17:50,018 INFO L273 TraceCheckUtils]: 53: Hoare triple {3472#false} ~cond := #in~cond; {3472#false} is VALID [2018-11-23 13:17:50,019 INFO L273 TraceCheckUtils]: 54: Hoare triple {3472#false} assume 0 == ~cond; {3472#false} is VALID [2018-11-23 13:17:50,019 INFO L273 TraceCheckUtils]: 55: Hoare triple {3472#false} assume !false; {3472#false} is VALID [2018-11-23 13:17:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 140 proven. 9 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-11-23 13:17:50,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:17:50,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 6] total 30 [2018-11-23 13:17:50,052 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-11-23 13:17:50,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:17:50,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 13:17:50,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:17:50,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 13:17:50,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 13:17:50,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:17:50,148 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 30 states. [2018-11-23 13:17:59,350 WARN L180 SmtUtils]: Spent 5.93 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-23 13:18:12,459 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-11-23 13:18:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:22,091 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-11-23 13:18:22,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 13:18:22,092 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-11-23 13:18:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:22,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:18:22,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 84 transitions. [2018-11-23 13:18:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:18:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 84 transitions. [2018-11-23 13:18:22,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 84 transitions. [2018-11-23 13:18:25,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 83 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 13:18:25,668 INFO L225 Difference]: With dead ends: 81 [2018-11-23 13:18:25,669 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 13:18:25,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=272, Invalid=917, Unknown=1, NotChecked=0, Total=1190 [2018-11-23 13:18:25,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 13:18:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2018-11-23 13:18:25,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:18:25,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 63 states. [2018-11-23 13:18:25,738 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 63 states. [2018-11-23 13:18:25,738 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 63 states. [2018-11-23 13:18:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:25,741 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-11-23 13:18:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-11-23 13:18:25,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:25,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:25,742 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 68 states. [2018-11-23 13:18:25,742 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 68 states. [2018-11-23 13:18:25,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:25,744 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-11-23 13:18:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-11-23 13:18:25,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:25,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:25,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:18:25,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:18:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 13:18:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-23 13:18:25,746 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 56 [2018-11-23 13:18:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:25,746 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-23 13:18:25,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 13:18:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-23 13:18:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 13:18:25,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:25,747 INFO L402 BasicCegarLoop]: trace histogram [26, 22, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:25,747 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:18:25,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:25,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1395503838, now seen corresponding path program 10 times [2018-11-23 13:18:25,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:25,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:25,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:25,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:18:25,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:26,714 INFO L256 TraceCheckUtils]: 0: Hoare triple {4035#true} call ULTIMATE.init(); {4035#true} is VALID [2018-11-23 13:18:26,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {4035#true} assume true; {4035#true} is VALID [2018-11-23 13:18:26,715 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4035#true} {4035#true} #37#return; {4035#true} is VALID [2018-11-23 13:18:26,715 INFO L256 TraceCheckUtils]: 3: Hoare triple {4035#true} call #t~ret1 := main(); {4035#true} is VALID [2018-11-23 13:18:26,715 INFO L273 TraceCheckUtils]: 4: Hoare triple {4035#true} ~x~0 := 0; {4037#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:26,716 INFO L273 TraceCheckUtils]: 5: Hoare triple {4037#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4037#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:26,716 INFO L273 TraceCheckUtils]: 6: Hoare triple {4037#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4038#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:26,717 INFO L273 TraceCheckUtils]: 7: Hoare triple {4038#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4038#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:26,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {4038#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4039#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:26,718 INFO L273 TraceCheckUtils]: 9: Hoare triple {4039#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {4039#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:26,719 INFO L273 TraceCheckUtils]: 10: Hoare triple {4039#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4040#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:26,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {4040#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4040#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:26,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {4040#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4041#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:26,722 INFO L273 TraceCheckUtils]: 13: Hoare triple {4041#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {4041#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:26,723 INFO L273 TraceCheckUtils]: 14: Hoare triple {4041#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4042#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:26,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {4042#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {4042#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:26,724 INFO L273 TraceCheckUtils]: 16: Hoare triple {4042#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4043#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:26,725 INFO L273 TraceCheckUtils]: 17: Hoare triple {4043#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4043#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:26,726 INFO L273 TraceCheckUtils]: 18: Hoare triple {4043#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4044#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:26,727 INFO L273 TraceCheckUtils]: 19: Hoare triple {4044#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4044#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:26,727 INFO L273 TraceCheckUtils]: 20: Hoare triple {4044#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4045#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:26,728 INFO L273 TraceCheckUtils]: 21: Hoare triple {4045#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {4045#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:26,729 INFO L273 TraceCheckUtils]: 22: Hoare triple {4045#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4046#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:26,730 INFO L273 TraceCheckUtils]: 23: Hoare triple {4046#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {4046#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:26,731 INFO L273 TraceCheckUtils]: 24: Hoare triple {4046#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4047#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:26,732 INFO L273 TraceCheckUtils]: 25: Hoare triple {4047#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4047#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:26,733 INFO L273 TraceCheckUtils]: 26: Hoare triple {4047#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4048#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:26,733 INFO L273 TraceCheckUtils]: 27: Hoare triple {4048#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {4048#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:26,734 INFO L273 TraceCheckUtils]: 28: Hoare triple {4048#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4049#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:26,735 INFO L273 TraceCheckUtils]: 29: Hoare triple {4049#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4049#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:26,736 INFO L273 TraceCheckUtils]: 30: Hoare triple {4049#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4050#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:26,737 INFO L273 TraceCheckUtils]: 31: Hoare triple {4050#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4050#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:26,738 INFO L273 TraceCheckUtils]: 32: Hoare triple {4050#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4051#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:26,738 INFO L273 TraceCheckUtils]: 33: Hoare triple {4051#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4051#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:26,739 INFO L273 TraceCheckUtils]: 34: Hoare triple {4051#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4052#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:26,740 INFO L273 TraceCheckUtils]: 35: Hoare triple {4052#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {4052#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:26,741 INFO L273 TraceCheckUtils]: 36: Hoare triple {4052#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4053#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:26,742 INFO L273 TraceCheckUtils]: 37: Hoare triple {4053#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4053#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:26,743 INFO L273 TraceCheckUtils]: 38: Hoare triple {4053#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4054#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:26,743 INFO L273 TraceCheckUtils]: 39: Hoare triple {4054#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4054#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:26,744 INFO L273 TraceCheckUtils]: 40: Hoare triple {4054#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4055#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:26,745 INFO L273 TraceCheckUtils]: 41: Hoare triple {4055#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4055#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:26,746 INFO L273 TraceCheckUtils]: 42: Hoare triple {4055#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4056#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:26,747 INFO L273 TraceCheckUtils]: 43: Hoare triple {4056#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4056#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:26,748 INFO L273 TraceCheckUtils]: 44: Hoare triple {4056#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4057#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:26,748 INFO L273 TraceCheckUtils]: 45: Hoare triple {4057#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 100000000); {4057#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:26,749 INFO L273 TraceCheckUtils]: 46: Hoare triple {4057#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4058#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:26,750 INFO L273 TraceCheckUtils]: 47: Hoare triple {4058#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {4058#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:26,751 INFO L273 TraceCheckUtils]: 48: Hoare triple {4058#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4059#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:26,752 INFO L273 TraceCheckUtils]: 49: Hoare triple {4059#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4059#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:26,753 INFO L273 TraceCheckUtils]: 50: Hoare triple {4059#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4060#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:18:26,753 INFO L273 TraceCheckUtils]: 51: Hoare triple {4060#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4060#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:18:26,754 INFO L273 TraceCheckUtils]: 52: Hoare triple {4060#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4061#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:18:26,755 INFO L273 TraceCheckUtils]: 53: Hoare triple {4061#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4061#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:18:26,756 INFO L273 TraceCheckUtils]: 54: Hoare triple {4061#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4062#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:18:26,757 INFO L273 TraceCheckUtils]: 55: Hoare triple {4062#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < 100000000); {4062#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:18:26,758 INFO L273 TraceCheckUtils]: 56: Hoare triple {4062#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4036#false} is VALID [2018-11-23 13:18:26,758 INFO L273 TraceCheckUtils]: 57: Hoare triple {4036#false} assume !(~x~0 % 4294967296 < 100000000); {4036#false} is VALID [2018-11-23 13:18:26,758 INFO L256 TraceCheckUtils]: 58: Hoare triple {4036#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {4036#false} is VALID [2018-11-23 13:18:26,759 INFO L273 TraceCheckUtils]: 59: Hoare triple {4036#false} ~cond := #in~cond; {4036#false} is VALID [2018-11-23 13:18:26,759 INFO L273 TraceCheckUtils]: 60: Hoare triple {4036#false} assume 0 == ~cond; {4036#false} is VALID [2018-11-23 13:18:26,759 INFO L273 TraceCheckUtils]: 61: Hoare triple {4036#false} assume !false; {4036#false} is VALID [2018-11-23 13:18:26,765 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 26 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:18:26,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:18:26,766 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:18:26,774 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:18:26,806 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:18:26,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:18:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:26,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:18:27,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {4035#true} call ULTIMATE.init(); {4035#true} is VALID [2018-11-23 13:18:27,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {4035#true} assume true; {4035#true} is VALID [2018-11-23 13:18:27,166 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4035#true} {4035#true} #37#return; {4035#true} is VALID [2018-11-23 13:18:27,166 INFO L256 TraceCheckUtils]: 3: Hoare triple {4035#true} call #t~ret1 := main(); {4035#true} is VALID [2018-11-23 13:18:27,167 INFO L273 TraceCheckUtils]: 4: Hoare triple {4035#true} ~x~0 := 0; {4037#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:27,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {4037#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4037#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:27,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {4037#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4038#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:27,168 INFO L273 TraceCheckUtils]: 7: Hoare triple {4038#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4038#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:27,169 INFO L273 TraceCheckUtils]: 8: Hoare triple {4038#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4039#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:27,169 INFO L273 TraceCheckUtils]: 9: Hoare triple {4039#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {4039#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:27,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {4039#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4040#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:27,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {4040#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4040#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:27,172 INFO L273 TraceCheckUtils]: 12: Hoare triple {4040#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4041#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:27,173 INFO L273 TraceCheckUtils]: 13: Hoare triple {4041#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {4041#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:27,174 INFO L273 TraceCheckUtils]: 14: Hoare triple {4041#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4042#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:27,174 INFO L273 TraceCheckUtils]: 15: Hoare triple {4042#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {4042#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:27,175 INFO L273 TraceCheckUtils]: 16: Hoare triple {4042#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4043#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:27,176 INFO L273 TraceCheckUtils]: 17: Hoare triple {4043#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4043#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:27,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {4043#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4044#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:27,178 INFO L273 TraceCheckUtils]: 19: Hoare triple {4044#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4044#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:27,179 INFO L273 TraceCheckUtils]: 20: Hoare triple {4044#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4045#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:27,179 INFO L273 TraceCheckUtils]: 21: Hoare triple {4045#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {4045#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:27,180 INFO L273 TraceCheckUtils]: 22: Hoare triple {4045#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4046#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:27,181 INFO L273 TraceCheckUtils]: 23: Hoare triple {4046#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {4046#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:27,182 INFO L273 TraceCheckUtils]: 24: Hoare triple {4046#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4047#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:27,183 INFO L273 TraceCheckUtils]: 25: Hoare triple {4047#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4047#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:27,184 INFO L273 TraceCheckUtils]: 26: Hoare triple {4047#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4048#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:27,184 INFO L273 TraceCheckUtils]: 27: Hoare triple {4048#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {4048#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:27,185 INFO L273 TraceCheckUtils]: 28: Hoare triple {4048#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4049#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:27,186 INFO L273 TraceCheckUtils]: 29: Hoare triple {4049#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4049#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:27,187 INFO L273 TraceCheckUtils]: 30: Hoare triple {4049#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4050#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:27,188 INFO L273 TraceCheckUtils]: 31: Hoare triple {4050#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4050#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:27,189 INFO L273 TraceCheckUtils]: 32: Hoare triple {4050#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4051#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:27,189 INFO L273 TraceCheckUtils]: 33: Hoare triple {4051#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4051#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:27,190 INFO L273 TraceCheckUtils]: 34: Hoare triple {4051#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4052#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:27,191 INFO L273 TraceCheckUtils]: 35: Hoare triple {4052#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {4052#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:27,192 INFO L273 TraceCheckUtils]: 36: Hoare triple {4052#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4053#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:27,193 INFO L273 TraceCheckUtils]: 37: Hoare triple {4053#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4053#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:27,194 INFO L273 TraceCheckUtils]: 38: Hoare triple {4053#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4054#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:27,195 INFO L273 TraceCheckUtils]: 39: Hoare triple {4054#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4054#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:27,195 INFO L273 TraceCheckUtils]: 40: Hoare triple {4054#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4055#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:27,196 INFO L273 TraceCheckUtils]: 41: Hoare triple {4055#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4055#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:27,197 INFO L273 TraceCheckUtils]: 42: Hoare triple {4055#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4056#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:27,198 INFO L273 TraceCheckUtils]: 43: Hoare triple {4056#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4056#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:27,199 INFO L273 TraceCheckUtils]: 44: Hoare triple {4056#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4057#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:27,200 INFO L273 TraceCheckUtils]: 45: Hoare triple {4057#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 100000000); {4057#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:27,200 INFO L273 TraceCheckUtils]: 46: Hoare triple {4057#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4058#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:27,201 INFO L273 TraceCheckUtils]: 47: Hoare triple {4058#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {4058#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:27,202 INFO L273 TraceCheckUtils]: 48: Hoare triple {4058#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4059#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:27,203 INFO L273 TraceCheckUtils]: 49: Hoare triple {4059#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4059#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:27,204 INFO L273 TraceCheckUtils]: 50: Hoare triple {4059#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4036#false} is VALID [2018-11-23 13:18:27,204 INFO L273 TraceCheckUtils]: 51: Hoare triple {4036#false} assume !!(~x~0 % 4294967296 < 100000000); {4036#false} is VALID [2018-11-23 13:18:27,204 INFO L273 TraceCheckUtils]: 52: Hoare triple {4036#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4036#false} is VALID [2018-11-23 13:18:27,204 INFO L273 TraceCheckUtils]: 53: Hoare triple {4036#false} assume !!(~x~0 % 4294967296 < 100000000); {4036#false} is VALID [2018-11-23 13:18:27,205 INFO L273 TraceCheckUtils]: 54: Hoare triple {4036#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4036#false} is VALID [2018-11-23 13:18:27,205 INFO L273 TraceCheckUtils]: 55: Hoare triple {4036#false} assume !!(~x~0 % 4294967296 < 100000000); {4036#false} is VALID [2018-11-23 13:18:27,205 INFO L273 TraceCheckUtils]: 56: Hoare triple {4036#false} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4036#false} is VALID [2018-11-23 13:18:27,205 INFO L273 TraceCheckUtils]: 57: Hoare triple {4036#false} assume !(~x~0 % 4294967296 < 100000000); {4036#false} is VALID [2018-11-23 13:18:27,206 INFO L256 TraceCheckUtils]: 58: Hoare triple {4036#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {4036#false} is VALID [2018-11-23 13:18:27,206 INFO L273 TraceCheckUtils]: 59: Hoare triple {4036#false} ~cond := #in~cond; {4036#false} is VALID [2018-11-23 13:18:27,206 INFO L273 TraceCheckUtils]: 60: Hoare triple {4036#false} assume 0 == ~cond; {4036#false} is VALID [2018-11-23 13:18:27,206 INFO L273 TraceCheckUtils]: 61: Hoare triple {4036#false} assume !false; {4036#false} is VALID [2018-11-23 13:18:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 161 proven. 506 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 13:18:27,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:18:27,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 28 [2018-11-23 13:18:27,235 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 62 [2018-11-23 13:18:27,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:18:27,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 13:18:27,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:18:27,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 13:18:27,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 13:18:27,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:18:27,321 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 28 states. [2018-11-23 13:18:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:30,650 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-11-23 13:18:30,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 13:18:30,651 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 62 [2018-11-23 13:18:30,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:18:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:18:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2018-11-23 13:18:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:18:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 71 transitions. [2018-11-23 13:18:30,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 71 transitions. [2018-11-23 13:18:30,772 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:18:30,773 INFO L225 Difference]: With dead ends: 81 [2018-11-23 13:18:30,774 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:18:30,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:18:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:18:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-23 13:18:30,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:18:30,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2018-11-23 13:18:30,854 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 13:18:30,854 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 13:18:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:30,857 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-23 13:18:30,857 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-23 13:18:30,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:30,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:30,858 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 13:18:30,858 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 13:18:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:18:30,860 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-23 13:18:30,860 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-23 13:18:30,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:18:30,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:18:30,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:18:30,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:18:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:18:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-23 13:18:30,862 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 62 [2018-11-23 13:18:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:18:30,862 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-23 13:18:30,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 13:18:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-23 13:18:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 13:18:30,863 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:18:30,864 INFO L402 BasicCegarLoop]: trace histogram [28, 24, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:18:30,864 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:18:30,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:18:30,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1514026076, now seen corresponding path program 11 times [2018-11-23 13:18:30,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:18:30,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:18:30,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:30,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:18:30,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:18:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:18:32,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {4607#true} call ULTIMATE.init(); {4607#true} is VALID [2018-11-23 13:18:32,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {4607#true} assume true; {4607#true} is VALID [2018-11-23 13:18:32,155 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4607#true} {4607#true} #37#return; {4607#true} is VALID [2018-11-23 13:18:32,155 INFO L256 TraceCheckUtils]: 3: Hoare triple {4607#true} call #t~ret1 := main(); {4607#true} is VALID [2018-11-23 13:18:32,155 INFO L273 TraceCheckUtils]: 4: Hoare triple {4607#true} ~x~0 := 0; {4609#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:32,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {4609#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4609#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:18:32,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {4609#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4610#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:32,158 INFO L273 TraceCheckUtils]: 7: Hoare triple {4610#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4610#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:18:32,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {4610#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:32,159 INFO L273 TraceCheckUtils]: 9: Hoare triple {4611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {4611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:18:32,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {4611#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:32,161 INFO L273 TraceCheckUtils]: 11: Hoare triple {4612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:18:32,162 INFO L273 TraceCheckUtils]: 12: Hoare triple {4612#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4613#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:32,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {4613#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 100000000); {4613#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:18:32,164 INFO L273 TraceCheckUtils]: 14: Hoare triple {4613#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:32,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {4614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {4614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:18:32,166 INFO L273 TraceCheckUtils]: 16: Hoare triple {4614#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4615#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:32,166 INFO L273 TraceCheckUtils]: 17: Hoare triple {4615#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4615#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:18:32,167 INFO L273 TraceCheckUtils]: 18: Hoare triple {4615#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:32,168 INFO L273 TraceCheckUtils]: 19: Hoare triple {4616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:18:32,169 INFO L273 TraceCheckUtils]: 20: Hoare triple {4616#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4617#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:32,170 INFO L273 TraceCheckUtils]: 21: Hoare triple {4617#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 100000000); {4617#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:18:32,171 INFO L273 TraceCheckUtils]: 22: Hoare triple {4617#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4618#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:32,172 INFO L273 TraceCheckUtils]: 23: Hoare triple {4618#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 100000000); {4618#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:18:32,173 INFO L273 TraceCheckUtils]: 24: Hoare triple {4618#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4619#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:32,173 INFO L273 TraceCheckUtils]: 25: Hoare triple {4619#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4619#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:18:32,175 INFO L273 TraceCheckUtils]: 26: Hoare triple {4619#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4620#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:32,176 INFO L273 TraceCheckUtils]: 27: Hoare triple {4620#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 100000000); {4620#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:18:32,177 INFO L273 TraceCheckUtils]: 28: Hoare triple {4620#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4621#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:32,178 INFO L273 TraceCheckUtils]: 29: Hoare triple {4621#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4621#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:18:32,179 INFO L273 TraceCheckUtils]: 30: Hoare triple {4621#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4622#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:32,179 INFO L273 TraceCheckUtils]: 31: Hoare triple {4622#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4622#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:18:32,180 INFO L273 TraceCheckUtils]: 32: Hoare triple {4622#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4623#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:32,181 INFO L273 TraceCheckUtils]: 33: Hoare triple {4623#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4623#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:18:32,182 INFO L273 TraceCheckUtils]: 34: Hoare triple {4623#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4624#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:32,183 INFO L273 TraceCheckUtils]: 35: Hoare triple {4624#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {4624#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:18:32,184 INFO L273 TraceCheckUtils]: 36: Hoare triple {4624#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4625#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:32,184 INFO L273 TraceCheckUtils]: 37: Hoare triple {4625#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4625#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:18:32,185 INFO L273 TraceCheckUtils]: 38: Hoare triple {4625#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4626#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:32,186 INFO L273 TraceCheckUtils]: 39: Hoare triple {4626#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4626#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:18:32,187 INFO L273 TraceCheckUtils]: 40: Hoare triple {4626#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4627#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:32,188 INFO L273 TraceCheckUtils]: 41: Hoare triple {4627#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4627#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:18:32,189 INFO L273 TraceCheckUtils]: 42: Hoare triple {4627#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4628#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:32,190 INFO L273 TraceCheckUtils]: 43: Hoare triple {4628#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4628#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:18:32,191 INFO L273 TraceCheckUtils]: 44: Hoare triple {4628#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4629#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:32,191 INFO L273 TraceCheckUtils]: 45: Hoare triple {4629#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 100000000); {4629#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:18:32,192 INFO L273 TraceCheckUtils]: 46: Hoare triple {4629#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4630#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:32,193 INFO L273 TraceCheckUtils]: 47: Hoare triple {4630#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {4630#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:18:32,194 INFO L273 TraceCheckUtils]: 48: Hoare triple {4630#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4631#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:32,195 INFO L273 TraceCheckUtils]: 49: Hoare triple {4631#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4631#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:18:32,196 INFO L273 TraceCheckUtils]: 50: Hoare triple {4631#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4632#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-23 13:18:32,196 INFO L273 TraceCheckUtils]: 51: Hoare triple {4632#(and (<= main_~x~0 23) (<= 23 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4632#(and (<= main_~x~0 23) (<= 23 main_~x~0))} is VALID [2018-11-23 13:18:32,197 INFO L273 TraceCheckUtils]: 52: Hoare triple {4632#(and (<= main_~x~0 23) (<= 23 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post0 := ~x~0;~x~0 := 1 + #t~post0;havoc #t~post0; {4633#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:18:32,198 INFO L273 TraceCheckUtils]: 53: Hoare triple {4633#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4633#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:18:32,199 INFO L273 TraceCheckUtils]: 54: Hoare triple {4633#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4634#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:18:32,200 INFO L273 TraceCheckUtils]: 55: Hoare triple {4634#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4634#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:18:32,201 INFO L273 TraceCheckUtils]: 56: Hoare triple {4634#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4635#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:18:32,201 INFO L273 TraceCheckUtils]: 57: Hoare triple {4635#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4635#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:18:32,203 INFO L273 TraceCheckUtils]: 58: Hoare triple {4635#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4636#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:18:32,203 INFO L273 TraceCheckUtils]: 59: Hoare triple {4636#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~x~0 % 4294967296 < 100000000); {4636#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:18:32,204 INFO L273 TraceCheckUtils]: 60: Hoare triple {4636#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4608#false} is VALID [2018-11-23 13:18:32,205 INFO L273 TraceCheckUtils]: 61: Hoare triple {4608#false} assume !(~x~0 % 4294967296 < 100000000); {4608#false} is VALID [2018-11-23 13:18:32,205 INFO L256 TraceCheckUtils]: 62: Hoare triple {4608#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {4608#false} is VALID [2018-11-23 13:18:32,205 INFO L273 TraceCheckUtils]: 63: Hoare triple {4608#false} ~cond := #in~cond; {4608#false} is VALID [2018-11-23 13:18:32,205 INFO L273 TraceCheckUtils]: 64: Hoare triple {4608#false} assume 0 == ~cond; {4608#false} is VALID [2018-11-23 13:18:32,205 INFO L273 TraceCheckUtils]: 65: Hoare triple {4608#false} assume !false; {4608#false} is VALID [2018-11-23 13:18:32,212 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 28 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:18:32,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:18:32,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:18:32,221 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1