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/loop-acceleration/simple_false-unreach-call4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:06:02,515 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:06:02,517 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:06:02,533 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:06:02,534 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:06:02,535 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:06:02,536 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:06:02,538 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:06:02,548 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:06:02,549 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:06:02,550 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:06:02,550 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:06:02,551 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:06:02,553 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:06:02,554 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:06:02,555 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:06:02,555 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:06:02,557 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:06:02,559 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:06:02,561 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:06:02,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:06:02,563 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:06:02,565 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:06:02,566 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:06:02,566 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:06:02,569 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:06:02,573 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:06:02,574 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:06:02,575 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:06:02,576 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:06:02,576 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:06:02,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:06:02,578 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:06:02,578 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:06:02,579 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:06:02,581 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:06:02,581 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:06:02,612 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:06:02,612 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:06:02,614 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:06:02,614 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:06:02,616 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:06:02,616 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:06:02,617 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:06:02,617 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:06:02,617 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:06:02,617 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:06:02,617 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:06:02,619 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:06:02,619 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:06:02,619 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:06:02,619 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:06:02,620 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:06:02,620 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:06:02,620 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:06:02,620 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:06:02,620 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:06:02,622 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:06:02,622 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:06:02,622 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:06:02,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:06:02,623 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:06:02,623 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:06:02,623 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:06:02,623 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:06:02,623 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:06:02,624 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:06:02,624 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:06:02,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:06:02,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:06:02,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:06:02,696 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:06:02,696 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:06:02,697 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call4.i [2018-11-23 13:06:02,765 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a152f4012/db30402ed07c49d1bbb8b3c56bd6f817/FLAGca7f6a7a0 [2018-11-23 13:06:03,259 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:06:03,260 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call4.i [2018-11-23 13:06:03,268 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a152f4012/db30402ed07c49d1bbb8b3c56bd6f817/FLAGca7f6a7a0 [2018-11-23 13:06:03,632 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a152f4012/db30402ed07c49d1bbb8b3c56bd6f817 [2018-11-23 13:06:03,644 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:06:03,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:06:03,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:03,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:06:03,650 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:06:03,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:03" (1/1) ... [2018-11-23 13:06:03,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2333e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:03, skipping insertion in model container [2018-11-23 13:06:03,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:03" (1/1) ... [2018-11-23 13:06:03,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:06:03,692 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:06:03,897 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:03,903 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:06:03,924 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:03,940 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:06:03,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:03 WrapperNode [2018-11-23 13:06:03,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:03,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:03,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:06:03,942 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:06:03,952 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:06:03" (1/1) ... [2018-11-23 13:06:03,957 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:06:03" (1/1) ... [2018-11-23 13:06:03,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:03,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:06:03,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:06:03,966 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:06:03,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:03" (1/1) ... [2018-11-23 13:06:03,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:03" (1/1) ... [2018-11-23 13:06:03,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:03" (1/1) ... [2018-11-23 13:06:03,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:03" (1/1) ... [2018-11-23 13:06:03,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:03" (1/1) ... [2018-11-23 13:06:03,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:03" (1/1) ... [2018-11-23 13:06:03,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:03" (1/1) ... [2018-11-23 13:06:03,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:06:03,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:06:03,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:06:03,992 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:06:03,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:03" (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:06:04,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:06:04,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:06:04,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:06:04,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:06:04,115 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:06:04,115 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:06:04,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:06:04,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:06:04,499 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:06:04,500 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:06:04,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:04 BoogieIcfgContainer [2018-11-23 13:06:04,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:06:04,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:06:04,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:06:04,505 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:06:04,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:06:03" (1/3) ... [2018-11-23 13:06:04,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569630fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:06:04, skipping insertion in model container [2018-11-23 13:06:04,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:03" (2/3) ... [2018-11-23 13:06:04,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569630fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:06:04, skipping insertion in model container [2018-11-23 13:06:04,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:04" (3/3) ... [2018-11-23 13:06:04,509 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call4.i [2018-11-23 13:06:04,520 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:06:04,530 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:06:04,545 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:06:04,574 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:06:04,575 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:06:04,575 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:06:04,575 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:06:04,575 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:06:04,575 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:06:04,575 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:06:04,576 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:06:04,576 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:06:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 13:06:04,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:06:04,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:04,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:04,605 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:04,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:04,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 13:06:04,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:04,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:04,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:04,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:04,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:04,975 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 13:06:04,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 13:06:04,980 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 13:06:04,980 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret0 := main(); {20#true} is VALID [2018-11-23 13:06:04,991 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~x~0 := 268435441; {22#(and (<= (div main_~x~0 4294967296) 0) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:04,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#(and (<= (div main_~x~0 4294967296) 0) (<= 268435441 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {21#false} is VALID [2018-11-23 13:06:04,997 INFO L256 TraceCheckUtils]: 6: Hoare triple {21#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {21#false} is VALID [2018-11-23 13:06:04,997 INFO L273 TraceCheckUtils]: 7: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2018-11-23 13:06:04,998 INFO L273 TraceCheckUtils]: 8: Hoare triple {21#false} assume 0 == ~cond; {21#false} is VALID [2018-11-23 13:06:04,998 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 13:06:05,002 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:06:05,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:05,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:06:05,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:06:05,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:05,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:06:05,070 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:06:05,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:06:05,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:06:05,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:06:05,084 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-11-23 13:06:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:05,310 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 13:06:05,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:06:05,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:06:05,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:05,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 13:06:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 13:06:05,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 13:06:05,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:05,540 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:06:05,540 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:06:05,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:06:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:06:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:06:05,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:05,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:05,709 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:05,709 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:05,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:05,712 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:06:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:06:05,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:05,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:05,713 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:05,713 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:06:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:05,716 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:06:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:06:05,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:05,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:05,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:05,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:06:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:06:05,720 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 13:06:05,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:05,721 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:06:05,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:06:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:06:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:06:05,722 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:05,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:05,722 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:05,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:05,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 13:06:05,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:05,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:05,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:05,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:05,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:06,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {108#true} is VALID [2018-11-23 13:06:06,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {108#true} assume true; {108#true} is VALID [2018-11-23 13:06:06,025 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {108#true} {108#true} #31#return; {108#true} is VALID [2018-11-23 13:06:06,025 INFO L256 TraceCheckUtils]: 3: Hoare triple {108#true} call #t~ret0 := main(); {108#true} is VALID [2018-11-23 13:06:06,026 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#true} ~x~0 := 268435441; {110#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:06,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {111#(and (<= 268435439 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:06:06,029 INFO L273 TraceCheckUtils]: 6: Hoare triple {111#(and (<= 268435439 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {109#false} is VALID [2018-11-23 13:06:06,029 INFO L256 TraceCheckUtils]: 7: Hoare triple {109#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {109#false} is VALID [2018-11-23 13:06:06,029 INFO L273 TraceCheckUtils]: 8: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2018-11-23 13:06:06,029 INFO L273 TraceCheckUtils]: 9: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2018-11-23 13:06:06,030 INFO L273 TraceCheckUtils]: 10: Hoare triple {109#false} assume !false; {109#false} is VALID [2018-11-23 13:06:06,031 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:06:06,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:06,032 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:06:06,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:06,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:06,309 INFO L256 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {108#true} is VALID [2018-11-23 13:06:06,309 INFO L273 TraceCheckUtils]: 1: Hoare triple {108#true} assume true; {108#true} is VALID [2018-11-23 13:06:06,310 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {108#true} {108#true} #31#return; {108#true} is VALID [2018-11-23 13:06:06,311 INFO L256 TraceCheckUtils]: 3: Hoare triple {108#true} call #t~ret0 := main(); {108#true} is VALID [2018-11-23 13:06:06,313 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#true} ~x~0 := 268435441; {110#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:06,318 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {130#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:06,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {130#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !(~x~0 % 4294967296 > 1); {109#false} is VALID [2018-11-23 13:06:06,320 INFO L256 TraceCheckUtils]: 7: Hoare triple {109#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {109#false} is VALID [2018-11-23 13:06:06,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2018-11-23 13:06:06,321 INFO L273 TraceCheckUtils]: 9: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2018-11-23 13:06:06,321 INFO L273 TraceCheckUtils]: 10: Hoare triple {109#false} assume !false; {109#false} is VALID [2018-11-23 13:06:06,322 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:06:06,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:06,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:06:06,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:06:06,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:06,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:06:06,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:06,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:06:06,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:06:06,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:06:06,418 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2018-11-23 13:06:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:06,719 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:06:06,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:06:06,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:06:06,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:06:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:06:06,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2018-11-23 13:06:06,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:06,961 INFO L225 Difference]: With dead ends: 18 [2018-11-23 13:06:06,962 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:06:06,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:06:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:06:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:06:07,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:07,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:06:07,140 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:06:07,140 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:06:07,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:07,142 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:06:07,142 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:06:07,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:07,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:07,143 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:06:07,143 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:06:07,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:07,145 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:06:07,145 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:06:07,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:07,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:07,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:07,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:06:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:06:07,149 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 13:06:07,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:07,149 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:06:07,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:06:07,149 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:06:07,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:06:07,150 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:07,150 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:07,151 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:07,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:07,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2018-11-23 13:06:07,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:07,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:07,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:07,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:07,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:07,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 13:06:07,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 13:06:07,555 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #31#return; {222#true} is VALID [2018-11-23 13:06:07,555 INFO L256 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret0 := main(); {222#true} is VALID [2018-11-23 13:06:07,556 INFO L273 TraceCheckUtils]: 4: Hoare triple {222#true} ~x~0 := 268435441; {224#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:07,557 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {225#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:07,559 INFO L273 TraceCheckUtils]: 6: Hoare triple {225#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {226#(and (<= 268435437 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:06:07,560 INFO L273 TraceCheckUtils]: 7: Hoare triple {226#(and (<= 268435437 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {223#false} is VALID [2018-11-23 13:06:07,560 INFO L256 TraceCheckUtils]: 8: Hoare triple {223#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {223#false} is VALID [2018-11-23 13:06:07,560 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 13:06:07,561 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 13:06:07,561 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 13:06:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:07,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:07,562 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:06:07,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:06:07,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:06:07,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:07,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:07,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 13:06:07,703 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 13:06:07,704 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #31#return; {222#true} is VALID [2018-11-23 13:06:07,704 INFO L256 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret0 := main(); {222#true} is VALID [2018-11-23 13:06:07,705 INFO L273 TraceCheckUtils]: 4: Hoare triple {222#true} ~x~0 := 268435441; {224#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:07,706 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {225#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:07,709 INFO L273 TraceCheckUtils]: 6: Hoare triple {225#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {248#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:07,713 INFO L273 TraceCheckUtils]: 7: Hoare triple {248#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !(~x~0 % 4294967296 > 1); {223#false} is VALID [2018-11-23 13:06:07,714 INFO L256 TraceCheckUtils]: 8: Hoare triple {223#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {223#false} is VALID [2018-11-23 13:06:07,714 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 13:06:07,714 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 13:06:07,715 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 13:06:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:07,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:07,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:06:07,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:06:07,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:07,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:06:07,750 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:06:07,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:06:07,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:06:07,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:06:07,752 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-11-23 13:06:07,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:07,918 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:06:07,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:06:07,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:06:07,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:06:07,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:06:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:06:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:06:07,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2018-11-23 13:06:07,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:07,964 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:06:07,964 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:06:07,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:06:07,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:06:07,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:06:07,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:07,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:07,994 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:07,994 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:07,996 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:06:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:06:07,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:07,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:07,997 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:07,997 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:06:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:07,998 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:06:07,999 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:06:07,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:07,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:07,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:07,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:08,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:06:08,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:06:08,001 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 13:06:08,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:08,001 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:06:08,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:06:08,002 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:06:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:06:08,002 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:08,003 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:08,003 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:08,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:08,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2018-11-23 13:06:08,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:08,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:08,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:08,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:08,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:08,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2018-11-23 13:06:08,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2018-11-23 13:06:08,199 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #31#return; {346#true} is VALID [2018-11-23 13:06:08,199 INFO L256 TraceCheckUtils]: 3: Hoare triple {346#true} call #t~ret0 := main(); {346#true} is VALID [2018-11-23 13:06:08,200 INFO L273 TraceCheckUtils]: 4: Hoare triple {346#true} ~x~0 := 268435441; {348#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:08,201 INFO L273 TraceCheckUtils]: 5: Hoare triple {348#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {349#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:08,205 INFO L273 TraceCheckUtils]: 6: Hoare triple {349#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {350#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:08,206 INFO L273 TraceCheckUtils]: 7: Hoare triple {350#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {351#(and (<= 268435435 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:06:08,207 INFO L273 TraceCheckUtils]: 8: Hoare triple {351#(and (<= 268435435 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {347#false} is VALID [2018-11-23 13:06:08,207 INFO L256 TraceCheckUtils]: 9: Hoare triple {347#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {347#false} is VALID [2018-11-23 13:06:08,208 INFO L273 TraceCheckUtils]: 10: Hoare triple {347#false} ~cond := #in~cond; {347#false} is VALID [2018-11-23 13:06:08,208 INFO L273 TraceCheckUtils]: 11: Hoare triple {347#false} assume 0 == ~cond; {347#false} is VALID [2018-11-23 13:06:08,208 INFO L273 TraceCheckUtils]: 12: Hoare triple {347#false} assume !false; {347#false} is VALID [2018-11-23 13:06:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:08,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:08,210 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:06:08,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:06:08,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:06:08,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:08,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:08,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2018-11-23 13:06:08,332 INFO L273 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2018-11-23 13:06:08,333 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #31#return; {346#true} is VALID [2018-11-23 13:06:08,333 INFO L256 TraceCheckUtils]: 3: Hoare triple {346#true} call #t~ret0 := main(); {346#true} is VALID [2018-11-23 13:06:08,334 INFO L273 TraceCheckUtils]: 4: Hoare triple {346#true} ~x~0 := 268435441; {348#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:08,335 INFO L273 TraceCheckUtils]: 5: Hoare triple {348#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {349#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:08,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {349#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {350#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:08,337 INFO L273 TraceCheckUtils]: 7: Hoare triple {350#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {376#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:08,338 INFO L273 TraceCheckUtils]: 8: Hoare triple {376#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !(~x~0 % 4294967296 > 1); {347#false} is VALID [2018-11-23 13:06:08,339 INFO L256 TraceCheckUtils]: 9: Hoare triple {347#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {347#false} is VALID [2018-11-23 13:06:08,339 INFO L273 TraceCheckUtils]: 10: Hoare triple {347#false} ~cond := #in~cond; {347#false} is VALID [2018-11-23 13:06:08,340 INFO L273 TraceCheckUtils]: 11: Hoare triple {347#false} assume 0 == ~cond; {347#false} is VALID [2018-11-23 13:06:08,340 INFO L273 TraceCheckUtils]: 12: Hoare triple {347#false} assume !false; {347#false} is VALID [2018-11-23 13:06:08,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:08,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:08,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:06:08,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 13:06:08,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:08,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:06:08,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:08,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:06:08,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:06:08,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:06:08,380 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2018-11-23 13:06:08,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:08,571 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:06:08,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:06:08,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 13:06:08,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:06:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-23 13:06:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:06:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-23 13:06:08,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2018-11-23 13:06:08,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:08,607 INFO L225 Difference]: With dead ends: 20 [2018-11-23 13:06:08,607 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:06:08,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:06:08,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:06:08,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:06:08,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:08,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 13:06:08,626 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:06:08,626 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:06:08,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:08,628 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:06:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:06:08,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:08,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:08,629 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:06:08,629 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:06:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:08,630 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:06:08,630 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:06:08,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:08,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:08,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:08,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:06:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 13:06:08,633 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-11-23 13:06:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:08,633 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 13:06:08,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:06:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:06:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:06:08,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:08,635 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:08,635 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:08,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:08,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2018-11-23 13:06:08,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:08,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:08,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:08,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:08,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:08,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2018-11-23 13:06:08,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {480#true} assume true; {480#true} is VALID [2018-11-23 13:06:08,906 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {480#true} {480#true} #31#return; {480#true} is VALID [2018-11-23 13:06:08,906 INFO L256 TraceCheckUtils]: 3: Hoare triple {480#true} call #t~ret0 := main(); {480#true} is VALID [2018-11-23 13:06:08,907 INFO L273 TraceCheckUtils]: 4: Hoare triple {480#true} ~x~0 := 268435441; {482#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:08,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {482#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {483#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:08,909 INFO L273 TraceCheckUtils]: 6: Hoare triple {483#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {484#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:08,910 INFO L273 TraceCheckUtils]: 7: Hoare triple {484#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {485#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:08,912 INFO L273 TraceCheckUtils]: 8: Hoare triple {485#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {486#(and (<= (div main_~x~0 4294967296) 0) (<= 268435433 main_~x~0))} is VALID [2018-11-23 13:06:08,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {486#(and (<= (div main_~x~0 4294967296) 0) (<= 268435433 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {481#false} is VALID [2018-11-23 13:06:08,914 INFO L256 TraceCheckUtils]: 10: Hoare triple {481#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {481#false} is VALID [2018-11-23 13:06:08,914 INFO L273 TraceCheckUtils]: 11: Hoare triple {481#false} ~cond := #in~cond; {481#false} is VALID [2018-11-23 13:06:08,914 INFO L273 TraceCheckUtils]: 12: Hoare triple {481#false} assume 0 == ~cond; {481#false} is VALID [2018-11-23 13:06:08,915 INFO L273 TraceCheckUtils]: 13: Hoare triple {481#false} assume !false; {481#false} is VALID [2018-11-23 13:06:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:08,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:08,916 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:06:08,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:06:08,942 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:06:08,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:08,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:09,275 INFO L256 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2018-11-23 13:06:09,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {480#true} assume true; {480#true} is VALID [2018-11-23 13:06:09,276 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {480#true} {480#true} #31#return; {480#true} is VALID [2018-11-23 13:06:09,276 INFO L256 TraceCheckUtils]: 3: Hoare triple {480#true} call #t~ret0 := main(); {480#true} is VALID [2018-11-23 13:06:09,276 INFO L273 TraceCheckUtils]: 4: Hoare triple {480#true} ~x~0 := 268435441; {482#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:09,277 INFO L273 TraceCheckUtils]: 5: Hoare triple {482#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {483#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:09,278 INFO L273 TraceCheckUtils]: 6: Hoare triple {483#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {484#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:09,279 INFO L273 TraceCheckUtils]: 7: Hoare triple {484#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {485#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:09,280 INFO L273 TraceCheckUtils]: 8: Hoare triple {485#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {514#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:06:09,286 INFO L273 TraceCheckUtils]: 9: Hoare triple {514#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !(~x~0 % 4294967296 > 1); {481#false} is VALID [2018-11-23 13:06:09,287 INFO L256 TraceCheckUtils]: 10: Hoare triple {481#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {481#false} is VALID [2018-11-23 13:06:09,287 INFO L273 TraceCheckUtils]: 11: Hoare triple {481#false} ~cond := #in~cond; {481#false} is VALID [2018-11-23 13:06:09,287 INFO L273 TraceCheckUtils]: 12: Hoare triple {481#false} assume 0 == ~cond; {481#false} is VALID [2018-11-23 13:06:09,288 INFO L273 TraceCheckUtils]: 13: Hoare triple {481#false} assume !false; {481#false} is VALID [2018-11-23 13:06:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:09,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:09,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:06:09,308 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 13:06:09,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:09,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:06:09,326 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:06:09,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:06:09,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:06:09,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:06:09,327 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-11-23 13:06:09,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:09,531 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:06:09,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:06:09,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 13:06:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:06:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-11-23 13:06:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:06:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-11-23 13:06:09,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2018-11-23 13:06:09,577 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:06:09,578 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:06:09,578 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:06:09,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:06:09,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:06:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:06:09,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:09,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:06:09,605 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:06:09,605 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:06:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:09,607 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:06:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:06:09,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:09,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:09,608 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:06:09,608 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:06:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:09,609 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:06:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:06:09,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:09,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:09,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:09,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:09,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:06:09,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 13:06:09,612 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-23 13:06:09,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:09,613 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 13:06:09,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:06:09,613 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:06:09,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:06:09,614 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:09,614 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:09,614 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:09,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:09,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2018-11-23 13:06:09,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:09,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:09,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:09,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:09,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:09,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {624#true} is VALID [2018-11-23 13:06:09,983 INFO L273 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2018-11-23 13:06:09,983 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #31#return; {624#true} is VALID [2018-11-23 13:06:09,983 INFO L256 TraceCheckUtils]: 3: Hoare triple {624#true} call #t~ret0 := main(); {624#true} is VALID [2018-11-23 13:06:09,984 INFO L273 TraceCheckUtils]: 4: Hoare triple {624#true} ~x~0 := 268435441; {626#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:10,002 INFO L273 TraceCheckUtils]: 5: Hoare triple {626#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {627#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:10,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {627#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {628#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:10,017 INFO L273 TraceCheckUtils]: 7: Hoare triple {628#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {629#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:10,018 INFO L273 TraceCheckUtils]: 8: Hoare triple {629#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {630#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:06:10,019 INFO L273 TraceCheckUtils]: 9: Hoare triple {630#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {631#(and (<= 268435431 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:06:10,022 INFO L273 TraceCheckUtils]: 10: Hoare triple {631#(and (<= 268435431 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {625#false} is VALID [2018-11-23 13:06:10,023 INFO L256 TraceCheckUtils]: 11: Hoare triple {625#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {625#false} is VALID [2018-11-23 13:06:10,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {625#false} ~cond := #in~cond; {625#false} is VALID [2018-11-23 13:06:10,023 INFO L273 TraceCheckUtils]: 13: Hoare triple {625#false} assume 0 == ~cond; {625#false} is VALID [2018-11-23 13:06:10,024 INFO L273 TraceCheckUtils]: 14: Hoare triple {625#false} assume !false; {625#false} is VALID [2018-11-23 13:06:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:10,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:10,025 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:06:10,042 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:06:11,762 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 13:06:11,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:11,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:11,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {624#true} is VALID [2018-11-23 13:06:11,858 INFO L273 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2018-11-23 13:06:11,859 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #31#return; {624#true} is VALID [2018-11-23 13:06:11,859 INFO L256 TraceCheckUtils]: 3: Hoare triple {624#true} call #t~ret0 := main(); {624#true} is VALID [2018-11-23 13:06:11,865 INFO L273 TraceCheckUtils]: 4: Hoare triple {624#true} ~x~0 := 268435441; {626#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:11,866 INFO L273 TraceCheckUtils]: 5: Hoare triple {626#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {627#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:11,867 INFO L273 TraceCheckUtils]: 6: Hoare triple {627#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {628#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:11,867 INFO L273 TraceCheckUtils]: 7: Hoare triple {628#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {629#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:11,868 INFO L273 TraceCheckUtils]: 8: Hoare triple {629#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {630#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:06:11,869 INFO L273 TraceCheckUtils]: 9: Hoare triple {630#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {662#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:06:11,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {662#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !(~x~0 % 4294967296 > 1); {625#false} is VALID [2018-11-23 13:06:11,870 INFO L256 TraceCheckUtils]: 11: Hoare triple {625#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {625#false} is VALID [2018-11-23 13:06:11,871 INFO L273 TraceCheckUtils]: 12: Hoare triple {625#false} ~cond := #in~cond; {625#false} is VALID [2018-11-23 13:06:11,871 INFO L273 TraceCheckUtils]: 13: Hoare triple {625#false} assume 0 == ~cond; {625#false} is VALID [2018-11-23 13:06:11,872 INFO L273 TraceCheckUtils]: 14: Hoare triple {625#false} assume !false; {625#false} is VALID [2018-11-23 13:06:11,873 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:11,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:11,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:06:11,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-11-23 13:06:11,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:11,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:06:11,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:11,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:06:11,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:06:11,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:06:11,912 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2018-11-23 13:06:12,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:12,139 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:06:12,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:06:12,140 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-11-23 13:06:12,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:06:12,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-11-23 13:06:12,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:06:12,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-11-23 13:06:12,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2018-11-23 13:06:12,172 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:06:12,174 INFO L225 Difference]: With dead ends: 22 [2018-11-23 13:06:12,174 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 13:06:12,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:06:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 13:06:12,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 13:06:12,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:12,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 13:06:12,214 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:06:12,214 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:06:12,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:12,216 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 13:06:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:06:12,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:12,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:12,217 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:06:12,217 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:06:12,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:12,218 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 13:06:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:06:12,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:12,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:12,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:12,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:12,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:06:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 13:06:12,221 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-11-23 13:06:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:12,221 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 13:06:12,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:06:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:06:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:06:12,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:12,223 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:12,223 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:12,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:12,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2018-11-23 13:06:12,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:12,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:12,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:12,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:12,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:12,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {778#true} call ULTIMATE.init(); {778#true} is VALID [2018-11-23 13:06:12,593 INFO L273 TraceCheckUtils]: 1: Hoare triple {778#true} assume true; {778#true} is VALID [2018-11-23 13:06:12,593 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {778#true} {778#true} #31#return; {778#true} is VALID [2018-11-23 13:06:12,594 INFO L256 TraceCheckUtils]: 3: Hoare triple {778#true} call #t~ret0 := main(); {778#true} is VALID [2018-11-23 13:06:12,594 INFO L273 TraceCheckUtils]: 4: Hoare triple {778#true} ~x~0 := 268435441; {780#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:12,595 INFO L273 TraceCheckUtils]: 5: Hoare triple {780#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {781#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:12,596 INFO L273 TraceCheckUtils]: 6: Hoare triple {781#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {782#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:12,597 INFO L273 TraceCheckUtils]: 7: Hoare triple {782#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {783#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:12,598 INFO L273 TraceCheckUtils]: 8: Hoare triple {783#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {784#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:06:12,599 INFO L273 TraceCheckUtils]: 9: Hoare triple {784#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {785#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:06:12,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {785#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {786#(and (<= 268435429 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:06:12,602 INFO L273 TraceCheckUtils]: 11: Hoare triple {786#(and (<= 268435429 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {779#false} is VALID [2018-11-23 13:06:12,602 INFO L256 TraceCheckUtils]: 12: Hoare triple {779#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {779#false} is VALID [2018-11-23 13:06:12,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {779#false} ~cond := #in~cond; {779#false} is VALID [2018-11-23 13:06:12,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {779#false} assume 0 == ~cond; {779#false} is VALID [2018-11-23 13:06:12,603 INFO L273 TraceCheckUtils]: 15: Hoare triple {779#false} assume !false; {779#false} is VALID [2018-11-23 13:06:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:12,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:12,605 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:06:12,621 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:06:12,639 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 13:06:12,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:12,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:12,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {778#true} call ULTIMATE.init(); {778#true} is VALID [2018-11-23 13:06:12,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {778#true} assume true; {778#true} is VALID [2018-11-23 13:06:12,789 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {778#true} {778#true} #31#return; {778#true} is VALID [2018-11-23 13:06:12,789 INFO L256 TraceCheckUtils]: 3: Hoare triple {778#true} call #t~ret0 := main(); {778#true} is VALID [2018-11-23 13:06:12,789 INFO L273 TraceCheckUtils]: 4: Hoare triple {778#true} ~x~0 := 268435441; {780#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:12,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {780#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {781#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:12,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {781#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {782#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:12,792 INFO L273 TraceCheckUtils]: 7: Hoare triple {782#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {783#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:12,792 INFO L273 TraceCheckUtils]: 8: Hoare triple {783#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {784#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:06:12,794 INFO L273 TraceCheckUtils]: 9: Hoare triple {784#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {785#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:06:12,795 INFO L273 TraceCheckUtils]: 10: Hoare triple {785#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {820#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:06:12,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {820#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !(~x~0 % 4294967296 > 1); {779#false} is VALID [2018-11-23 13:06:12,796 INFO L256 TraceCheckUtils]: 12: Hoare triple {779#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {779#false} is VALID [2018-11-23 13:06:12,797 INFO L273 TraceCheckUtils]: 13: Hoare triple {779#false} ~cond := #in~cond; {779#false} is VALID [2018-11-23 13:06:12,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {779#false} assume 0 == ~cond; {779#false} is VALID [2018-11-23 13:06:12,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {779#false} assume !false; {779#false} is VALID [2018-11-23 13:06:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:12,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:12,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 13:06:12,818 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 13:06:12,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:12,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:06:12,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:12,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:06:12,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:06:12,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:06:12,856 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-11-23 13:06:13,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:13,073 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:06:13,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:06:13,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 13:06:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:06:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-11-23 13:06:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:06:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-11-23 13:06:13,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2018-11-23 13:06:13,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:13,108 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:06:13,108 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:06:13,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:06:13,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:06:13,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:06:13,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:13,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 13:06:13,138 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:06:13,138 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:06:13,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:13,139 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:06:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:06:13,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:13,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:13,140 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:06:13,140 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:06:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:13,141 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:06:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:06:13,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:13,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:13,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:13,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:13,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:06:13,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 13:06:13,143 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-11-23 13:06:13,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:13,144 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 13:06:13,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:06:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:06:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:06:13,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:13,144 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:13,145 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:13,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:13,145 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2018-11-23 13:06:13,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:13,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:13,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:13,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:13,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:14,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {942#true} call ULTIMATE.init(); {942#true} is VALID [2018-11-23 13:06:14,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {942#true} assume true; {942#true} is VALID [2018-11-23 13:06:14,558 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {942#true} {942#true} #31#return; {942#true} is VALID [2018-11-23 13:06:14,559 INFO L256 TraceCheckUtils]: 3: Hoare triple {942#true} call #t~ret0 := main(); {942#true} is VALID [2018-11-23 13:06:14,559 INFO L273 TraceCheckUtils]: 4: Hoare triple {942#true} ~x~0 := 268435441; {944#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:14,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {944#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {945#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:14,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {945#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {946#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:14,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {946#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {947#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:14,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {947#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {948#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:06:14,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {948#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {949#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:06:14,566 INFO L273 TraceCheckUtils]: 10: Hoare triple {949#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {950#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:06:14,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {950#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {951#(and (<= (div main_~x~0 4294967296) 0) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:06:14,568 INFO L273 TraceCheckUtils]: 12: Hoare triple {951#(and (<= (div main_~x~0 4294967296) 0) (<= 268435427 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {943#false} is VALID [2018-11-23 13:06:14,569 INFO L256 TraceCheckUtils]: 13: Hoare triple {943#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {943#false} is VALID [2018-11-23 13:06:14,569 INFO L273 TraceCheckUtils]: 14: Hoare triple {943#false} ~cond := #in~cond; {943#false} is VALID [2018-11-23 13:06:14,569 INFO L273 TraceCheckUtils]: 15: Hoare triple {943#false} assume 0 == ~cond; {943#false} is VALID [2018-11-23 13:06:14,570 INFO L273 TraceCheckUtils]: 16: Hoare triple {943#false} assume !false; {943#false} is VALID [2018-11-23 13:06:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:14,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:14,572 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:06:14,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:14,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:14,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {942#true} call ULTIMATE.init(); {942#true} is VALID [2018-11-23 13:06:14,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {942#true} assume true; {942#true} is VALID [2018-11-23 13:06:14,697 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {942#true} {942#true} #31#return; {942#true} is VALID [2018-11-23 13:06:14,698 INFO L256 TraceCheckUtils]: 3: Hoare triple {942#true} call #t~ret0 := main(); {942#true} is VALID [2018-11-23 13:06:14,699 INFO L273 TraceCheckUtils]: 4: Hoare triple {942#true} ~x~0 := 268435441; {944#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:14,699 INFO L273 TraceCheckUtils]: 5: Hoare triple {944#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {945#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:14,700 INFO L273 TraceCheckUtils]: 6: Hoare triple {945#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {946#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:14,701 INFO L273 TraceCheckUtils]: 7: Hoare triple {946#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {947#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:14,702 INFO L273 TraceCheckUtils]: 8: Hoare triple {947#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {948#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:06:14,720 INFO L273 TraceCheckUtils]: 9: Hoare triple {948#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {949#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:06:14,721 INFO L273 TraceCheckUtils]: 10: Hoare triple {949#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {950#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:06:14,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {950#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {988#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:06:14,723 INFO L273 TraceCheckUtils]: 12: Hoare triple {988#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {943#false} is VALID [2018-11-23 13:06:14,724 INFO L256 TraceCheckUtils]: 13: Hoare triple {943#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {943#false} is VALID [2018-11-23 13:06:14,724 INFO L273 TraceCheckUtils]: 14: Hoare triple {943#false} ~cond := #in~cond; {943#false} is VALID [2018-11-23 13:06:14,724 INFO L273 TraceCheckUtils]: 15: Hoare triple {943#false} assume 0 == ~cond; {943#false} is VALID [2018-11-23 13:06:14,725 INFO L273 TraceCheckUtils]: 16: Hoare triple {943#false} assume !false; {943#false} is VALID [2018-11-23 13:06:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:14,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:14,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:06:14,747 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-23 13:06:14,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:14,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:06:14,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:14,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:06:14,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:06:14,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:06:14,775 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2018-11-23 13:06:15,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:15,159 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:06:15,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:06:15,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-23 13:06:15,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:15,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:06:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2018-11-23 13:06:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:06:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2018-11-23 13:06:15,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2018-11-23 13:06:15,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:15,237 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:06:15,237 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 13:06:15,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:06:15,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 13:06:15,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 13:06:15,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:15,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 13:06:15,271 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 13:06:15,271 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 13:06:15,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:15,274 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:06:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:06:15,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:15,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:15,275 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 13:06:15,275 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 13:06:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:15,276 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:06:15,276 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:06:15,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:15,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:15,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:15,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:15,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:06:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 13:06:15,278 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-11-23 13:06:15,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:15,278 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-23 13:06:15,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:06:15,278 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:06:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:06:15,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:15,279 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:15,279 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:15,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:15,280 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2018-11-23 13:06:15,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:15,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:15,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:15,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:15,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:15,573 INFO L256 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2018-11-23 13:06:15,574 INFO L273 TraceCheckUtils]: 1: Hoare triple {1116#true} assume true; {1116#true} is VALID [2018-11-23 13:06:15,574 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1116#true} {1116#true} #31#return; {1116#true} is VALID [2018-11-23 13:06:15,574 INFO L256 TraceCheckUtils]: 3: Hoare triple {1116#true} call #t~ret0 := main(); {1116#true} is VALID [2018-11-23 13:06:15,575 INFO L273 TraceCheckUtils]: 4: Hoare triple {1116#true} ~x~0 := 268435441; {1118#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:15,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {1118#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1119#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:15,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {1119#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1120#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:15,577 INFO L273 TraceCheckUtils]: 7: Hoare triple {1120#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1121#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:15,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {1121#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1122#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:06:15,579 INFO L273 TraceCheckUtils]: 9: Hoare triple {1122#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1123#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:06:15,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {1123#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1124#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:06:15,585 INFO L273 TraceCheckUtils]: 11: Hoare triple {1124#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1125#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:06:15,586 INFO L273 TraceCheckUtils]: 12: Hoare triple {1125#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1126#(and (<= (div main_~x~0 4294967296) 0) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:06:15,586 INFO L273 TraceCheckUtils]: 13: Hoare triple {1126#(and (<= (div main_~x~0 4294967296) 0) (<= 268435425 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {1117#false} is VALID [2018-11-23 13:06:15,587 INFO L256 TraceCheckUtils]: 14: Hoare triple {1117#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1117#false} is VALID [2018-11-23 13:06:15,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {1117#false} ~cond := #in~cond; {1117#false} is VALID [2018-11-23 13:06:15,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {1117#false} assume 0 == ~cond; {1117#false} is VALID [2018-11-23 13:06:15,587 INFO L273 TraceCheckUtils]: 17: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2018-11-23 13:06:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:15,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:15,589 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:06:15,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:06:15,609 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:06:15,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:15,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:15,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2018-11-23 13:06:15,783 INFO L273 TraceCheckUtils]: 1: Hoare triple {1116#true} assume true; {1116#true} is VALID [2018-11-23 13:06:15,784 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1116#true} {1116#true} #31#return; {1116#true} is VALID [2018-11-23 13:06:15,784 INFO L256 TraceCheckUtils]: 3: Hoare triple {1116#true} call #t~ret0 := main(); {1116#true} is VALID [2018-11-23 13:06:15,784 INFO L273 TraceCheckUtils]: 4: Hoare triple {1116#true} ~x~0 := 268435441; {1118#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:15,785 INFO L273 TraceCheckUtils]: 5: Hoare triple {1118#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1119#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:15,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {1119#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1120#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:15,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {1120#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1121#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:15,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {1121#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1122#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:06:15,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {1122#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1123#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:06:15,790 INFO L273 TraceCheckUtils]: 10: Hoare triple {1123#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1124#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:06:15,791 INFO L273 TraceCheckUtils]: 11: Hoare triple {1124#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1125#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:06:15,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {1125#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1166#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:06:15,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {1166#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {1117#false} is VALID [2018-11-23 13:06:15,793 INFO L256 TraceCheckUtils]: 14: Hoare triple {1117#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1117#false} is VALID [2018-11-23 13:06:15,793 INFO L273 TraceCheckUtils]: 15: Hoare triple {1117#false} ~cond := #in~cond; {1117#false} is VALID [2018-11-23 13:06:15,794 INFO L273 TraceCheckUtils]: 16: Hoare triple {1117#false} assume 0 == ~cond; {1117#false} is VALID [2018-11-23 13:06:15,794 INFO L273 TraceCheckUtils]: 17: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2018-11-23 13:06:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:15,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:15,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 13:06:15,816 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-23 13:06:15,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:15,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:06:15,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:15,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:06:15,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:06:15,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:06:15,897 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2018-11-23 13:06:16,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:16,523 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 13:06:16,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:06:16,523 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-23 13:06:16,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:06:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2018-11-23 13:06:16,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:06:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2018-11-23 13:06:16,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 25 transitions. [2018-11-23 13:06:16,549 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:06:16,551 INFO L225 Difference]: With dead ends: 25 [2018-11-23 13:06:16,551 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:06:16,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:06:16,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:06:16,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:06:16,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:16,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 13:06:16,578 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:06:16,578 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:06:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:16,580 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:06:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:06:16,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:16,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:16,581 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:06:16,581 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:06:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:16,583 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:06:16,583 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:06:16,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:16,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:16,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:16,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:16,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:06:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-23 13:06:16,585 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-11-23 13:06:16,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:16,585 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-23 13:06:16,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:06:16,585 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:06:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:06:16,586 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:16,586 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:16,586 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:16,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:16,587 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2018-11-23 13:06:16,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:16,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:16,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:16,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:16,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:16,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {1300#true} call ULTIMATE.init(); {1300#true} is VALID [2018-11-23 13:06:16,859 INFO L273 TraceCheckUtils]: 1: Hoare triple {1300#true} assume true; {1300#true} is VALID [2018-11-23 13:06:16,859 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1300#true} {1300#true} #31#return; {1300#true} is VALID [2018-11-23 13:06:16,859 INFO L256 TraceCheckUtils]: 3: Hoare triple {1300#true} call #t~ret0 := main(); {1300#true} is VALID [2018-11-23 13:06:16,860 INFO L273 TraceCheckUtils]: 4: Hoare triple {1300#true} ~x~0 := 268435441; {1302#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:16,861 INFO L273 TraceCheckUtils]: 5: Hoare triple {1302#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1303#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:16,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {1303#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1304#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:16,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {1304#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1305#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:16,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {1305#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1306#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:06:16,864 INFO L273 TraceCheckUtils]: 9: Hoare triple {1306#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1307#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:06:16,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {1307#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1308#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:06:16,868 INFO L273 TraceCheckUtils]: 11: Hoare triple {1308#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1309#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:06:16,872 INFO L273 TraceCheckUtils]: 12: Hoare triple {1309#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1310#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:06:16,875 INFO L273 TraceCheckUtils]: 13: Hoare triple {1310#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1311#(and (<= 268435423 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:06:16,876 INFO L273 TraceCheckUtils]: 14: Hoare triple {1311#(and (<= 268435423 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {1301#false} is VALID [2018-11-23 13:06:16,877 INFO L256 TraceCheckUtils]: 15: Hoare triple {1301#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1301#false} is VALID [2018-11-23 13:06:16,877 INFO L273 TraceCheckUtils]: 16: Hoare triple {1301#false} ~cond := #in~cond; {1301#false} is VALID [2018-11-23 13:06:16,877 INFO L273 TraceCheckUtils]: 17: Hoare triple {1301#false} assume 0 == ~cond; {1301#false} is VALID [2018-11-23 13:06:16,877 INFO L273 TraceCheckUtils]: 18: Hoare triple {1301#false} assume !false; {1301#false} is VALID [2018-11-23 13:06:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:16,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:16,878 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:06:16,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:06:17,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 13:06:17,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:17,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:17,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {1300#true} call ULTIMATE.init(); {1300#true} is VALID [2018-11-23 13:06:17,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {1300#true} assume true; {1300#true} is VALID [2018-11-23 13:06:17,190 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1300#true} {1300#true} #31#return; {1300#true} is VALID [2018-11-23 13:06:17,190 INFO L256 TraceCheckUtils]: 3: Hoare triple {1300#true} call #t~ret0 := main(); {1300#true} is VALID [2018-11-23 13:06:17,191 INFO L273 TraceCheckUtils]: 4: Hoare triple {1300#true} ~x~0 := 268435441; {1302#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:17,192 INFO L273 TraceCheckUtils]: 5: Hoare triple {1302#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1303#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:17,196 INFO L273 TraceCheckUtils]: 6: Hoare triple {1303#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1304#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:17,197 INFO L273 TraceCheckUtils]: 7: Hoare triple {1304#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1305#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:17,197 INFO L273 TraceCheckUtils]: 8: Hoare triple {1305#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1306#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:06:17,198 INFO L273 TraceCheckUtils]: 9: Hoare triple {1306#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1307#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:06:17,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {1307#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1308#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:06:17,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {1308#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1309#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:06:17,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {1309#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1310#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:06:17,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {1310#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1354#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:06:17,202 INFO L273 TraceCheckUtils]: 14: Hoare triple {1354#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !(~x~0 % 4294967296 > 1); {1301#false} is VALID [2018-11-23 13:06:17,203 INFO L256 TraceCheckUtils]: 15: Hoare triple {1301#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1301#false} is VALID [2018-11-23 13:06:17,203 INFO L273 TraceCheckUtils]: 16: Hoare triple {1301#false} ~cond := #in~cond; {1301#false} is VALID [2018-11-23 13:06:17,203 INFO L273 TraceCheckUtils]: 17: Hoare triple {1301#false} assume 0 == ~cond; {1301#false} is VALID [2018-11-23 13:06:17,204 INFO L273 TraceCheckUtils]: 18: Hoare triple {1301#false} assume !false; {1301#false} is VALID [2018-11-23 13:06:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:17,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:17,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 13:06:17,225 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-11-23 13:06:17,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:17,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:06:17,257 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:06:17,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:06:17,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:06:17,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:06:17,258 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2018-11-23 13:06:17,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:17,745 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:06:17,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:06:17,745 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-11-23 13:06:17,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:06:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2018-11-23 13:06:17,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:06:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2018-11-23 13:06:17,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2018-11-23 13:06:17,777 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:06:17,779 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:06:17,779 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 13:06:17,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:06:17,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 13:06:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 13:06:17,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:17,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 13:06:17,799 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:06:17,799 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:06:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:17,800 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:06:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:06:17,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:17,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:17,801 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:06:17,801 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:06:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:17,802 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:06:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:06:17,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:17,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:17,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:17,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:17,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:06:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 13:06:17,804 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-11-23 13:06:17,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:17,804 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 13:06:17,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:06:17,805 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:06:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:06:17,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:17,805 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:17,806 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:17,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:17,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2018-11-23 13:06:17,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:17,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:17,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:17,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:17,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:18,465 INFO L256 TraceCheckUtils]: 0: Hoare triple {1494#true} call ULTIMATE.init(); {1494#true} is VALID [2018-11-23 13:06:18,466 INFO L273 TraceCheckUtils]: 1: Hoare triple {1494#true} assume true; {1494#true} is VALID [2018-11-23 13:06:18,466 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1494#true} {1494#true} #31#return; {1494#true} is VALID [2018-11-23 13:06:18,466 INFO L256 TraceCheckUtils]: 3: Hoare triple {1494#true} call #t~ret0 := main(); {1494#true} is VALID [2018-11-23 13:06:18,467 INFO L273 TraceCheckUtils]: 4: Hoare triple {1494#true} ~x~0 := 268435441; {1496#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:18,468 INFO L273 TraceCheckUtils]: 5: Hoare triple {1496#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1497#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:18,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {1497#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1498#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:18,470 INFO L273 TraceCheckUtils]: 7: Hoare triple {1498#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1499#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:18,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {1499#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1500#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:06:18,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {1500#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1501#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:06:18,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {1501#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1502#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:06:18,473 INFO L273 TraceCheckUtils]: 11: Hoare triple {1502#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1503#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:06:18,474 INFO L273 TraceCheckUtils]: 12: Hoare triple {1503#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1504#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:06:18,475 INFO L273 TraceCheckUtils]: 13: Hoare triple {1504#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1505#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:06:18,476 INFO L273 TraceCheckUtils]: 14: Hoare triple {1505#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1506#(and (<= 268435421 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:06:18,477 INFO L273 TraceCheckUtils]: 15: Hoare triple {1506#(and (<= 268435421 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {1495#false} is VALID [2018-11-23 13:06:18,477 INFO L256 TraceCheckUtils]: 16: Hoare triple {1495#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1495#false} is VALID [2018-11-23 13:06:18,478 INFO L273 TraceCheckUtils]: 17: Hoare triple {1495#false} ~cond := #in~cond; {1495#false} is VALID [2018-11-23 13:06:18,478 INFO L273 TraceCheckUtils]: 18: Hoare triple {1495#false} assume 0 == ~cond; {1495#false} is VALID [2018-11-23 13:06:18,478 INFO L273 TraceCheckUtils]: 19: Hoare triple {1495#false} assume !false; {1495#false} is VALID [2018-11-23 13:06:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:18,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:18,480 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:06:18,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:06:18,499 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:06:18,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:18,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:18,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {1494#true} call ULTIMATE.init(); {1494#true} is VALID [2018-11-23 13:06:18,790 INFO L273 TraceCheckUtils]: 1: Hoare triple {1494#true} assume true; {1494#true} is VALID [2018-11-23 13:06:18,790 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1494#true} {1494#true} #31#return; {1494#true} is VALID [2018-11-23 13:06:18,790 INFO L256 TraceCheckUtils]: 3: Hoare triple {1494#true} call #t~ret0 := main(); {1494#true} is VALID [2018-11-23 13:06:18,791 INFO L273 TraceCheckUtils]: 4: Hoare triple {1494#true} ~x~0 := 268435441; {1496#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:18,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {1496#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1497#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:18,793 INFO L273 TraceCheckUtils]: 6: Hoare triple {1497#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1498#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:18,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {1498#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1499#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:18,795 INFO L273 TraceCheckUtils]: 8: Hoare triple {1499#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1500#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:06:18,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {1500#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1501#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:06:18,798 INFO L273 TraceCheckUtils]: 10: Hoare triple {1501#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1502#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:06:18,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {1502#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1503#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:06:18,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {1503#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1504#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:06:18,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {1504#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1505#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:06:18,808 INFO L273 TraceCheckUtils]: 14: Hoare triple {1505#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1552#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:06:18,809 INFO L273 TraceCheckUtils]: 15: Hoare triple {1552#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !(~x~0 % 4294967296 > 1); {1495#false} is VALID [2018-11-23 13:06:18,809 INFO L256 TraceCheckUtils]: 16: Hoare triple {1495#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1495#false} is VALID [2018-11-23 13:06:18,809 INFO L273 TraceCheckUtils]: 17: Hoare triple {1495#false} ~cond := #in~cond; {1495#false} is VALID [2018-11-23 13:06:18,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {1495#false} assume 0 == ~cond; {1495#false} is VALID [2018-11-23 13:06:18,810 INFO L273 TraceCheckUtils]: 19: Hoare triple {1495#false} assume !false; {1495#false} is VALID [2018-11-23 13:06:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:18,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:18,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 13:06:18,832 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-11-23 13:06:18,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:18,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:06:18,860 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:06:18,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:06:18,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:06:18,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:06:18,862 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2018-11-23 13:06:19,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:19,405 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 13:06:19,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:06:19,406 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-11-23 13:06:19,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:06:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2018-11-23 13:06:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:06:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2018-11-23 13:06:19,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 27 transitions. [2018-11-23 13:06:19,535 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:06:19,536 INFO L225 Difference]: With dead ends: 27 [2018-11-23 13:06:19,536 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:06:19,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:06:19,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:06:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 13:06:19,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:19,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 13:06:19,556 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:06:19,556 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:06:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:19,557 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:06:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:06:19,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:19,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:19,558 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:06:19,558 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:06:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:19,560 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:06:19,560 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:06:19,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:19,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:19,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:19,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:19,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:06:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-23 13:06:19,563 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-11-23 13:06:19,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:19,563 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-23 13:06:19,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:06:19,563 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:06:19,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:06:19,564 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:19,564 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:19,564 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:19,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:19,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2018-11-23 13:06:19,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:19,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:19,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:19,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:19,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:19,842 INFO L256 TraceCheckUtils]: 0: Hoare triple {1698#true} call ULTIMATE.init(); {1698#true} is VALID [2018-11-23 13:06:19,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {1698#true} assume true; {1698#true} is VALID [2018-11-23 13:06:19,842 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1698#true} {1698#true} #31#return; {1698#true} is VALID [2018-11-23 13:06:19,843 INFO L256 TraceCheckUtils]: 3: Hoare triple {1698#true} call #t~ret0 := main(); {1698#true} is VALID [2018-11-23 13:06:19,843 INFO L273 TraceCheckUtils]: 4: Hoare triple {1698#true} ~x~0 := 268435441; {1700#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:19,844 INFO L273 TraceCheckUtils]: 5: Hoare triple {1700#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1701#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:19,845 INFO L273 TraceCheckUtils]: 6: Hoare triple {1701#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1702#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:19,846 INFO L273 TraceCheckUtils]: 7: Hoare triple {1702#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1703#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:19,848 INFO L273 TraceCheckUtils]: 8: Hoare triple {1703#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1704#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:06:19,849 INFO L273 TraceCheckUtils]: 9: Hoare triple {1704#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1705#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:06:19,850 INFO L273 TraceCheckUtils]: 10: Hoare triple {1705#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1706#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:06:19,851 INFO L273 TraceCheckUtils]: 11: Hoare triple {1706#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1707#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:06:19,852 INFO L273 TraceCheckUtils]: 12: Hoare triple {1707#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1708#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:06:19,861 INFO L273 TraceCheckUtils]: 13: Hoare triple {1708#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1709#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:06:19,862 INFO L273 TraceCheckUtils]: 14: Hoare triple {1709#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1710#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:06:19,863 INFO L273 TraceCheckUtils]: 15: Hoare triple {1710#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1711#(and (<= 268435419 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:06:19,864 INFO L273 TraceCheckUtils]: 16: Hoare triple {1711#(and (<= 268435419 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {1699#false} is VALID [2018-11-23 13:06:19,864 INFO L256 TraceCheckUtils]: 17: Hoare triple {1699#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1699#false} is VALID [2018-11-23 13:06:19,864 INFO L273 TraceCheckUtils]: 18: Hoare triple {1699#false} ~cond := #in~cond; {1699#false} is VALID [2018-11-23 13:06:19,864 INFO L273 TraceCheckUtils]: 19: Hoare triple {1699#false} assume 0 == ~cond; {1699#false} is VALID [2018-11-23 13:06:19,864 INFO L273 TraceCheckUtils]: 20: Hoare triple {1699#false} assume !false; {1699#false} is VALID [2018-11-23 13:06:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:19,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:19,865 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:06:19,874 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:06:59,039 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 13:06:59,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:59,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:59,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {1698#true} call ULTIMATE.init(); {1698#true} is VALID [2018-11-23 13:06:59,254 INFO L273 TraceCheckUtils]: 1: Hoare triple {1698#true} assume true; {1698#true} is VALID [2018-11-23 13:06:59,255 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1698#true} {1698#true} #31#return; {1698#true} is VALID [2018-11-23 13:06:59,255 INFO L256 TraceCheckUtils]: 3: Hoare triple {1698#true} call #t~ret0 := main(); {1698#true} is VALID [2018-11-23 13:06:59,255 INFO L273 TraceCheckUtils]: 4: Hoare triple {1698#true} ~x~0 := 268435441; {1700#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:06:59,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {1700#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1701#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:06:59,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {1701#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1702#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:06:59,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {1702#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1703#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:06:59,260 INFO L273 TraceCheckUtils]: 8: Hoare triple {1703#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1704#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:06:59,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {1704#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1705#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:06:59,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {1705#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1706#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:06:59,261 INFO L273 TraceCheckUtils]: 11: Hoare triple {1706#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1707#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:06:59,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {1707#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1708#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:06:59,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {1708#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1709#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:06:59,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {1709#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1710#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:06:59,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {1710#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1760#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:06:59,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {1760#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !(~x~0 % 4294967296 > 1); {1699#false} is VALID [2018-11-23 13:06:59,266 INFO L256 TraceCheckUtils]: 17: Hoare triple {1699#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1699#false} is VALID [2018-11-23 13:06:59,267 INFO L273 TraceCheckUtils]: 18: Hoare triple {1699#false} ~cond := #in~cond; {1699#false} is VALID [2018-11-23 13:06:59,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {1699#false} assume 0 == ~cond; {1699#false} is VALID [2018-11-23 13:06:59,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {1699#false} assume !false; {1699#false} is VALID [2018-11-23 13:06:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:59,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:59,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 13:06:59,289 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 13:06:59,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:59,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:06:59,308 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:59,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:06:59,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:06:59,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:06:59,309 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2018-11-23 13:06:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:59,889 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:06:59,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:06:59,889 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 13:06:59,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:59,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:06:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-11-23 13:06:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:06:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-11-23 13:06:59,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2018-11-23 13:06:59,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:59,922 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:06:59,922 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 13:06:59,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:06:59,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 13:06:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 13:06:59,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:59,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 13:06:59,943 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 13:06:59,943 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 13:06:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:59,944 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:06:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:06:59,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:59,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:59,944 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 13:06:59,945 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 13:06:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:59,945 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:06:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:06:59,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:59,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:59,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:59,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:06:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-23 13:06:59,946 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-11-23 13:06:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:59,947 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-23 13:06:59,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:06:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:06:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:06:59,947 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:59,947 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:59,948 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:59,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:59,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2018-11-23 13:06:59,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:59,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:59,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:59,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:00,890 INFO L256 TraceCheckUtils]: 0: Hoare triple {1912#true} call ULTIMATE.init(); {1912#true} is VALID [2018-11-23 13:07:00,891 INFO L273 TraceCheckUtils]: 1: Hoare triple {1912#true} assume true; {1912#true} is VALID [2018-11-23 13:07:00,891 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1912#true} {1912#true} #31#return; {1912#true} is VALID [2018-11-23 13:07:00,891 INFO L256 TraceCheckUtils]: 3: Hoare triple {1912#true} call #t~ret0 := main(); {1912#true} is VALID [2018-11-23 13:07:00,891 INFO L273 TraceCheckUtils]: 4: Hoare triple {1912#true} ~x~0 := 268435441; {1914#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:07:00,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {1914#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1915#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:07:00,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {1915#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1916#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:07:00,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {1916#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1917#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:07:00,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {1917#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1918#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:07:00,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {1918#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1919#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:07:00,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {1919#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1920#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:07:00,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {1920#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1921#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:07:00,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {1921#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1922#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:07:00,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {1922#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1923#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:07:00,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {1923#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1924#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:07:00,908 INFO L273 TraceCheckUtils]: 15: Hoare triple {1924#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1925#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:07:00,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {1925#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1926#(and (<= 268435417 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:07:00,913 INFO L273 TraceCheckUtils]: 17: Hoare triple {1926#(and (<= 268435417 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {1913#false} is VALID [2018-11-23 13:07:00,914 INFO L256 TraceCheckUtils]: 18: Hoare triple {1913#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1913#false} is VALID [2018-11-23 13:07:00,914 INFO L273 TraceCheckUtils]: 19: Hoare triple {1913#false} ~cond := #in~cond; {1913#false} is VALID [2018-11-23 13:07:00,914 INFO L273 TraceCheckUtils]: 20: Hoare triple {1913#false} assume 0 == ~cond; {1913#false} is VALID [2018-11-23 13:07:00,914 INFO L273 TraceCheckUtils]: 21: Hoare triple {1913#false} assume !false; {1913#false} is VALID [2018-11-23 13:07:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:00,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:00,916 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:07:00,936 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:07:01,058 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:07:01,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:01,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:01,233 INFO L256 TraceCheckUtils]: 0: Hoare triple {1912#true} call ULTIMATE.init(); {1912#true} is VALID [2018-11-23 13:07:01,234 INFO L273 TraceCheckUtils]: 1: Hoare triple {1912#true} assume true; {1912#true} is VALID [2018-11-23 13:07:01,234 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1912#true} {1912#true} #31#return; {1912#true} is VALID [2018-11-23 13:07:01,234 INFO L256 TraceCheckUtils]: 3: Hoare triple {1912#true} call #t~ret0 := main(); {1912#true} is VALID [2018-11-23 13:07:01,234 INFO L273 TraceCheckUtils]: 4: Hoare triple {1912#true} ~x~0 := 268435441; {1914#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:07:01,235 INFO L273 TraceCheckUtils]: 5: Hoare triple {1914#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1915#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:07:01,236 INFO L273 TraceCheckUtils]: 6: Hoare triple {1915#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1916#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:07:01,236 INFO L273 TraceCheckUtils]: 7: Hoare triple {1916#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1917#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:07:01,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {1917#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1918#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:07:01,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {1918#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1919#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:07:01,239 INFO L273 TraceCheckUtils]: 10: Hoare triple {1919#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1920#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:07:01,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {1920#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1921#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:07:01,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {1921#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1922#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:07:01,242 INFO L273 TraceCheckUtils]: 13: Hoare triple {1922#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1923#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:07:01,243 INFO L273 TraceCheckUtils]: 14: Hoare triple {1923#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1924#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:07:01,244 INFO L273 TraceCheckUtils]: 15: Hoare triple {1924#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1925#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:07:01,245 INFO L273 TraceCheckUtils]: 16: Hoare triple {1925#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {1978#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:07:01,246 INFO L273 TraceCheckUtils]: 17: Hoare triple {1978#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !(~x~0 % 4294967296 > 1); {1913#false} is VALID [2018-11-23 13:07:01,246 INFO L256 TraceCheckUtils]: 18: Hoare triple {1913#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1913#false} is VALID [2018-11-23 13:07:01,246 INFO L273 TraceCheckUtils]: 19: Hoare triple {1913#false} ~cond := #in~cond; {1913#false} is VALID [2018-11-23 13:07:01,246 INFO L273 TraceCheckUtils]: 20: Hoare triple {1913#false} assume 0 == ~cond; {1913#false} is VALID [2018-11-23 13:07:01,247 INFO L273 TraceCheckUtils]: 21: Hoare triple {1913#false} assume !false; {1913#false} is VALID [2018-11-23 13:07:01,248 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:01,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:01,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 13:07:01,267 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-23 13:07:01,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:01,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:07:01,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:01,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:07:01,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:07:01,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:07:01,289 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2018-11-23 13:07:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:01,958 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:07:01,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:07:01,959 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-23 13:07:01,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:01,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:07:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2018-11-23 13:07:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:07:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2018-11-23 13:07:01,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 29 transitions. [2018-11-23 13:07:01,995 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:07:01,996 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:07:01,996 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 13:07:01,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:07:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 13:07:02,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 13:07:02,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:02,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 13:07:02,022 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 13:07:02,022 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 13:07:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:02,023 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:07:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:07:02,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:02,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:02,024 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 13:07:02,024 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 13:07:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:02,025 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:07:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:07:02,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:02,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:02,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:02,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:02,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:07:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-23 13:07:02,027 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-11-23 13:07:02,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:02,027 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-23 13:07:02,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:07:02,028 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:07:02,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:07:02,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:02,029 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:02,029 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:02,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:02,029 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2018-11-23 13:07:02,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:02,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:02,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:02,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:02,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:02,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {2136#true} call ULTIMATE.init(); {2136#true} is VALID [2018-11-23 13:07:02,482 INFO L273 TraceCheckUtils]: 1: Hoare triple {2136#true} assume true; {2136#true} is VALID [2018-11-23 13:07:02,482 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2136#true} {2136#true} #31#return; {2136#true} is VALID [2018-11-23 13:07:02,482 INFO L256 TraceCheckUtils]: 3: Hoare triple {2136#true} call #t~ret0 := main(); {2136#true} is VALID [2018-11-23 13:07:02,483 INFO L273 TraceCheckUtils]: 4: Hoare triple {2136#true} ~x~0 := 268435441; {2138#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:07:02,484 INFO L273 TraceCheckUtils]: 5: Hoare triple {2138#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2139#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:07:02,485 INFO L273 TraceCheckUtils]: 6: Hoare triple {2139#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2140#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:07:02,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {2140#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2141#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:07:02,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {2141#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2142#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:07:02,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {2142#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2143#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:07:02,488 INFO L273 TraceCheckUtils]: 10: Hoare triple {2143#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2144#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:07:02,489 INFO L273 TraceCheckUtils]: 11: Hoare triple {2144#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2145#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:07:02,490 INFO L273 TraceCheckUtils]: 12: Hoare triple {2145#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2146#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:07:02,491 INFO L273 TraceCheckUtils]: 13: Hoare triple {2146#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2147#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:07:02,493 INFO L273 TraceCheckUtils]: 14: Hoare triple {2147#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2148#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:07:02,494 INFO L273 TraceCheckUtils]: 15: Hoare triple {2148#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2149#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:07:02,495 INFO L273 TraceCheckUtils]: 16: Hoare triple {2149#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2150#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:07:02,496 INFO L273 TraceCheckUtils]: 17: Hoare triple {2150#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2151#(and (<= (div main_~x~0 4294967296) 0) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:07:02,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {2151#(and (<= (div main_~x~0 4294967296) 0) (<= 268435415 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {2137#false} is VALID [2018-11-23 13:07:02,497 INFO L256 TraceCheckUtils]: 19: Hoare triple {2137#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2137#false} is VALID [2018-11-23 13:07:02,497 INFO L273 TraceCheckUtils]: 20: Hoare triple {2137#false} ~cond := #in~cond; {2137#false} is VALID [2018-11-23 13:07:02,498 INFO L273 TraceCheckUtils]: 21: Hoare triple {2137#false} assume 0 == ~cond; {2137#false} is VALID [2018-11-23 13:07:02,498 INFO L273 TraceCheckUtils]: 22: Hoare triple {2137#false} assume !false; {2137#false} is VALID [2018-11-23 13:07:02,500 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:02,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:02,500 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:07:02,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:02,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:02,632 INFO L256 TraceCheckUtils]: 0: Hoare triple {2136#true} call ULTIMATE.init(); {2136#true} is VALID [2018-11-23 13:07:02,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {2136#true} assume true; {2136#true} is VALID [2018-11-23 13:07:02,633 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2136#true} {2136#true} #31#return; {2136#true} is VALID [2018-11-23 13:07:02,633 INFO L256 TraceCheckUtils]: 3: Hoare triple {2136#true} call #t~ret0 := main(); {2136#true} is VALID [2018-11-23 13:07:02,633 INFO L273 TraceCheckUtils]: 4: Hoare triple {2136#true} ~x~0 := 268435441; {2138#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:07:02,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {2138#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2139#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:07:02,635 INFO L273 TraceCheckUtils]: 6: Hoare triple {2139#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2140#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:07:02,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {2140#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2141#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:07:02,636 INFO L273 TraceCheckUtils]: 8: Hoare triple {2141#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2142#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:07:02,637 INFO L273 TraceCheckUtils]: 9: Hoare triple {2142#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2143#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:07:02,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {2143#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2144#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:07:02,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {2144#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2145#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:07:02,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {2145#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2146#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:07:02,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {2146#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2147#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:07:02,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {2147#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2148#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:07:02,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {2148#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2149#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:07:02,643 INFO L273 TraceCheckUtils]: 16: Hoare triple {2149#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2150#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:07:02,644 INFO L273 TraceCheckUtils]: 17: Hoare triple {2150#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2206#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:07:02,645 INFO L273 TraceCheckUtils]: 18: Hoare triple {2206#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {2137#false} is VALID [2018-11-23 13:07:02,645 INFO L256 TraceCheckUtils]: 19: Hoare triple {2137#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2137#false} is VALID [2018-11-23 13:07:02,645 INFO L273 TraceCheckUtils]: 20: Hoare triple {2137#false} ~cond := #in~cond; {2137#false} is VALID [2018-11-23 13:07:02,646 INFO L273 TraceCheckUtils]: 21: Hoare triple {2137#false} assume 0 == ~cond; {2137#false} is VALID [2018-11-23 13:07:02,646 INFO L273 TraceCheckUtils]: 22: Hoare triple {2137#false} assume !false; {2137#false} is VALID [2018-11-23 13:07:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:02,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:02,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 13:07:02,666 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-23 13:07:02,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:02,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:07:02,688 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:07:02,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:07:02,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:07:02,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:07:02,690 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2018-11-23 13:07:03,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:03,287 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:07:03,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:07:03,287 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-23 13:07:03,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:07:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2018-11-23 13:07:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:07:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2018-11-23 13:07:03,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2018-11-23 13:07:03,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:03,317 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:07:03,317 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:07:03,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:07:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:07:03,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 13:07:03,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:03,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 13:07:03,343 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:07:03,343 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:07:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:03,343 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 13:07:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:07:03,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:03,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:03,344 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:07:03,344 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:07:03,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:03,345 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 13:07:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:07:03,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:03,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:03,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:03,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:07:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-23 13:07:03,347 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-11-23 13:07:03,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:03,347 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-23 13:07:03,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:07:03,347 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:07:03,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:07:03,348 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:03,348 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:03,348 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:03,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:03,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2018-11-23 13:07:03,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:03,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:03,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:03,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:03,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:03,969 INFO L256 TraceCheckUtils]: 0: Hoare triple {2370#true} call ULTIMATE.init(); {2370#true} is VALID [2018-11-23 13:07:03,969 INFO L273 TraceCheckUtils]: 1: Hoare triple {2370#true} assume true; {2370#true} is VALID [2018-11-23 13:07:03,970 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2370#true} {2370#true} #31#return; {2370#true} is VALID [2018-11-23 13:07:03,970 INFO L256 TraceCheckUtils]: 3: Hoare triple {2370#true} call #t~ret0 := main(); {2370#true} is VALID [2018-11-23 13:07:03,983 INFO L273 TraceCheckUtils]: 4: Hoare triple {2370#true} ~x~0 := 268435441; {2372#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:07:03,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {2372#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2373#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:07:04,005 INFO L273 TraceCheckUtils]: 6: Hoare triple {2373#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2374#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:07:04,021 INFO L273 TraceCheckUtils]: 7: Hoare triple {2374#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2375#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:07:04,037 INFO L273 TraceCheckUtils]: 8: Hoare triple {2375#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2376#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:07:04,046 INFO L273 TraceCheckUtils]: 9: Hoare triple {2376#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2377#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:07:04,062 INFO L273 TraceCheckUtils]: 10: Hoare triple {2377#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2378#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:07:04,076 INFO L273 TraceCheckUtils]: 11: Hoare triple {2378#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2379#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:07:04,085 INFO L273 TraceCheckUtils]: 12: Hoare triple {2379#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2380#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:07:04,099 INFO L273 TraceCheckUtils]: 13: Hoare triple {2380#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2381#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:07:04,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {2381#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2382#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:07:04,119 INFO L273 TraceCheckUtils]: 15: Hoare triple {2382#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2383#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:07:04,120 INFO L273 TraceCheckUtils]: 16: Hoare triple {2383#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2384#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:07:04,121 INFO L273 TraceCheckUtils]: 17: Hoare triple {2384#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2385#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:07:04,121 INFO L273 TraceCheckUtils]: 18: Hoare triple {2385#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2386#(and (<= 268435413 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:07:04,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {2386#(and (<= 268435413 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {2371#false} is VALID [2018-11-23 13:07:04,123 INFO L256 TraceCheckUtils]: 20: Hoare triple {2371#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2371#false} is VALID [2018-11-23 13:07:04,123 INFO L273 TraceCheckUtils]: 21: Hoare triple {2371#false} ~cond := #in~cond; {2371#false} is VALID [2018-11-23 13:07:04,123 INFO L273 TraceCheckUtils]: 22: Hoare triple {2371#false} assume 0 == ~cond; {2371#false} is VALID [2018-11-23 13:07:04,124 INFO L273 TraceCheckUtils]: 23: Hoare triple {2371#false} assume !false; {2371#false} is VALID [2018-11-23 13:07:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:04,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:04,125 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:07:04,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:07:04,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:07:04,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:04,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:04,282 INFO L256 TraceCheckUtils]: 0: Hoare triple {2370#true} call ULTIMATE.init(); {2370#true} is VALID [2018-11-23 13:07:04,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {2370#true} assume true; {2370#true} is VALID [2018-11-23 13:07:04,283 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2370#true} {2370#true} #31#return; {2370#true} is VALID [2018-11-23 13:07:04,283 INFO L256 TraceCheckUtils]: 3: Hoare triple {2370#true} call #t~ret0 := main(); {2370#true} is VALID [2018-11-23 13:07:04,284 INFO L273 TraceCheckUtils]: 4: Hoare triple {2370#true} ~x~0 := 268435441; {2372#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:07:04,285 INFO L273 TraceCheckUtils]: 5: Hoare triple {2372#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2373#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:07:04,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {2373#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2374#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:07:04,286 INFO L273 TraceCheckUtils]: 7: Hoare triple {2374#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2375#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:07:04,287 INFO L273 TraceCheckUtils]: 8: Hoare triple {2375#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2376#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:07:04,287 INFO L273 TraceCheckUtils]: 9: Hoare triple {2376#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2377#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:07:04,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {2377#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2378#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:07:04,289 INFO L273 TraceCheckUtils]: 11: Hoare triple {2378#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2379#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:07:04,290 INFO L273 TraceCheckUtils]: 12: Hoare triple {2379#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2380#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:07:04,291 INFO L273 TraceCheckUtils]: 13: Hoare triple {2380#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2381#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:07:04,292 INFO L273 TraceCheckUtils]: 14: Hoare triple {2381#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2382#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:07:04,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {2382#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2383#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:07:04,294 INFO L273 TraceCheckUtils]: 16: Hoare triple {2383#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2384#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:07:04,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {2384#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2385#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:07:04,296 INFO L273 TraceCheckUtils]: 18: Hoare triple {2385#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2444#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2018-11-23 13:07:04,297 INFO L273 TraceCheckUtils]: 19: Hoare triple {2444#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !(~x~0 % 4294967296 > 1); {2371#false} is VALID [2018-11-23 13:07:04,297 INFO L256 TraceCheckUtils]: 20: Hoare triple {2371#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2371#false} is VALID [2018-11-23 13:07:04,297 INFO L273 TraceCheckUtils]: 21: Hoare triple {2371#false} ~cond := #in~cond; {2371#false} is VALID [2018-11-23 13:07:04,297 INFO L273 TraceCheckUtils]: 22: Hoare triple {2371#false} assume 0 == ~cond; {2371#false} is VALID [2018-11-23 13:07:04,297 INFO L273 TraceCheckUtils]: 23: Hoare triple {2371#false} assume !false; {2371#false} is VALID [2018-11-23 13:07:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:04,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:04,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 13:07:04,318 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-11-23 13:07:04,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:04,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 13:07:04,339 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:07:04,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 13:07:04,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:07:04,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:07:04,340 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2018-11-23 13:07:05,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:05,059 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:07:05,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:07:05,059 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-11-23 13:07:05,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:07:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-11-23 13:07:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:07:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-11-23 13:07:05,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2018-11-23 13:07:05,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:05,086 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:07:05,086 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:07:05,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:07:05,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:07:05,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 13:07:05,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:05,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 13:07:05,117 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 13:07:05,117 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 13:07:05,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:05,119 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:07:05,119 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:07:05,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:05,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:05,119 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 13:07:05,119 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 13:07:05,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:05,120 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:07:05,120 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:07:05,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:05,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:05,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:05,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:07:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-23 13:07:05,121 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-11-23 13:07:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:05,121 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-23 13:07:05,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 13:07:05,122 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:07:05,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:07:05,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:05,122 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:05,123 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:05,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:05,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2018-11-23 13:07:05,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:05,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:05,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:05,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:05,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:05,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {2614#true} call ULTIMATE.init(); {2614#true} is VALID [2018-11-23 13:07:05,677 INFO L273 TraceCheckUtils]: 1: Hoare triple {2614#true} assume true; {2614#true} is VALID [2018-11-23 13:07:05,677 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2614#true} {2614#true} #31#return; {2614#true} is VALID [2018-11-23 13:07:05,677 INFO L256 TraceCheckUtils]: 3: Hoare triple {2614#true} call #t~ret0 := main(); {2614#true} is VALID [2018-11-23 13:07:05,688 INFO L273 TraceCheckUtils]: 4: Hoare triple {2614#true} ~x~0 := 268435441; {2616#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:07:05,688 INFO L273 TraceCheckUtils]: 5: Hoare triple {2616#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2617#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:07:05,689 INFO L273 TraceCheckUtils]: 6: Hoare triple {2617#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2618#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:07:05,690 INFO L273 TraceCheckUtils]: 7: Hoare triple {2618#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2619#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:07:05,690 INFO L273 TraceCheckUtils]: 8: Hoare triple {2619#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2620#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:07:05,691 INFO L273 TraceCheckUtils]: 9: Hoare triple {2620#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2621#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:07:05,692 INFO L273 TraceCheckUtils]: 10: Hoare triple {2621#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2622#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:07:05,693 INFO L273 TraceCheckUtils]: 11: Hoare triple {2622#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2623#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:07:05,710 INFO L273 TraceCheckUtils]: 12: Hoare triple {2623#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2624#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:07:05,711 INFO L273 TraceCheckUtils]: 13: Hoare triple {2624#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2625#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:07:05,712 INFO L273 TraceCheckUtils]: 14: Hoare triple {2625#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2626#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:07:05,713 INFO L273 TraceCheckUtils]: 15: Hoare triple {2626#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2627#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:07:05,713 INFO L273 TraceCheckUtils]: 16: Hoare triple {2627#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2628#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:07:05,714 INFO L273 TraceCheckUtils]: 17: Hoare triple {2628#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2629#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:07:05,714 INFO L273 TraceCheckUtils]: 18: Hoare triple {2629#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2630#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2018-11-23 13:07:05,715 INFO L273 TraceCheckUtils]: 19: Hoare triple {2630#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2631#(and (<= (div main_~x~0 4294967296) 0) (<= 268435411 main_~x~0))} is VALID [2018-11-23 13:07:05,716 INFO L273 TraceCheckUtils]: 20: Hoare triple {2631#(and (<= (div main_~x~0 4294967296) 0) (<= 268435411 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {2615#false} is VALID [2018-11-23 13:07:05,716 INFO L256 TraceCheckUtils]: 21: Hoare triple {2615#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2615#false} is VALID [2018-11-23 13:07:05,717 INFO L273 TraceCheckUtils]: 22: Hoare triple {2615#false} ~cond := #in~cond; {2615#false} is VALID [2018-11-23 13:07:05,717 INFO L273 TraceCheckUtils]: 23: Hoare triple {2615#false} assume 0 == ~cond; {2615#false} is VALID [2018-11-23 13:07:05,717 INFO L273 TraceCheckUtils]: 24: Hoare triple {2615#false} assume !false; {2615#false} is VALID [2018-11-23 13:07:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:05,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:05,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:05,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:07:05,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 13:07:05,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:05,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:05,970 INFO L256 TraceCheckUtils]: 0: Hoare triple {2614#true} call ULTIMATE.init(); {2614#true} is VALID [2018-11-23 13:07:05,971 INFO L273 TraceCheckUtils]: 1: Hoare triple {2614#true} assume true; {2614#true} is VALID [2018-11-23 13:07:05,971 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2614#true} {2614#true} #31#return; {2614#true} is VALID [2018-11-23 13:07:05,971 INFO L256 TraceCheckUtils]: 3: Hoare triple {2614#true} call #t~ret0 := main(); {2614#true} is VALID [2018-11-23 13:07:05,972 INFO L273 TraceCheckUtils]: 4: Hoare triple {2614#true} ~x~0 := 268435441; {2616#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:07:05,973 INFO L273 TraceCheckUtils]: 5: Hoare triple {2616#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2617#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:07:05,973 INFO L273 TraceCheckUtils]: 6: Hoare triple {2617#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2618#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:07:05,974 INFO L273 TraceCheckUtils]: 7: Hoare triple {2618#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2619#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:07:05,975 INFO L273 TraceCheckUtils]: 8: Hoare triple {2619#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2620#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:07:05,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {2620#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2621#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:07:05,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {2621#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2622#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:07:05,977 INFO L273 TraceCheckUtils]: 11: Hoare triple {2622#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2623#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:07:05,978 INFO L273 TraceCheckUtils]: 12: Hoare triple {2623#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2624#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:07:05,979 INFO L273 TraceCheckUtils]: 13: Hoare triple {2624#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2625#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:07:05,980 INFO L273 TraceCheckUtils]: 14: Hoare triple {2625#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2626#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:07:05,981 INFO L273 TraceCheckUtils]: 15: Hoare triple {2626#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2627#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:07:05,982 INFO L273 TraceCheckUtils]: 16: Hoare triple {2627#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2628#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:07:05,983 INFO L273 TraceCheckUtils]: 17: Hoare triple {2628#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2629#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:07:05,984 INFO L273 TraceCheckUtils]: 18: Hoare triple {2629#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2630#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2018-11-23 13:07:05,985 INFO L273 TraceCheckUtils]: 19: Hoare triple {2630#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2692#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2018-11-23 13:07:05,986 INFO L273 TraceCheckUtils]: 20: Hoare triple {2692#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {2615#false} is VALID [2018-11-23 13:07:05,986 INFO L256 TraceCheckUtils]: 21: Hoare triple {2615#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2615#false} is VALID [2018-11-23 13:07:05,987 INFO L273 TraceCheckUtils]: 22: Hoare triple {2615#false} ~cond := #in~cond; {2615#false} is VALID [2018-11-23 13:07:05,987 INFO L273 TraceCheckUtils]: 23: Hoare triple {2615#false} assume 0 == ~cond; {2615#false} is VALID [2018-11-23 13:07:05,987 INFO L273 TraceCheckUtils]: 24: Hoare triple {2615#false} assume !false; {2615#false} is VALID [2018-11-23 13:07:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:06,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:06,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 13:07:06,009 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2018-11-23 13:07:06,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:06,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:07:06,030 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:07:06,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:07:06,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:07:06,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:07:06,032 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2018-11-23 13:07:06,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:06,859 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:07:06,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:07:06,859 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2018-11-23 13:07:06,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:07:06,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2018-11-23 13:07:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:07:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2018-11-23 13:07:06,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2018-11-23 13:07:06,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:06,889 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:07:06,889 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 13:07:06,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:07:06,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 13:07:06,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 13:07:06,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:06,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 13:07:06,915 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 13:07:06,915 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 13:07:06,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:06,917 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 13:07:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:07:06,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:06,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:06,918 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 13:07:06,918 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 13:07:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:06,919 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 13:07:06,919 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:07:06,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:06,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:06,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:06,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:07:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 13:07:06,920 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-11-23 13:07:06,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:06,920 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 13:07:06,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:07:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:07:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:07:06,921 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:06,921 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:06,921 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:06,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:06,921 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2018-11-23 13:07:06,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:06,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:06,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:06,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:06,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:07,352 INFO L256 TraceCheckUtils]: 0: Hoare triple {2868#true} call ULTIMATE.init(); {2868#true} is VALID [2018-11-23 13:07:07,352 INFO L273 TraceCheckUtils]: 1: Hoare triple {2868#true} assume true; {2868#true} is VALID [2018-11-23 13:07:07,352 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2868#true} {2868#true} #31#return; {2868#true} is VALID [2018-11-23 13:07:07,352 INFO L256 TraceCheckUtils]: 3: Hoare triple {2868#true} call #t~ret0 := main(); {2868#true} is VALID [2018-11-23 13:07:07,353 INFO L273 TraceCheckUtils]: 4: Hoare triple {2868#true} ~x~0 := 268435441; {2870#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:07:07,354 INFO L273 TraceCheckUtils]: 5: Hoare triple {2870#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2871#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:07:07,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {2871#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2872#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:07:07,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {2872#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2873#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:07:07,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {2873#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2874#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:07:07,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {2874#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2875#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:07:07,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {2875#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2876#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:07:07,358 INFO L273 TraceCheckUtils]: 11: Hoare triple {2876#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2877#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:07:07,359 INFO L273 TraceCheckUtils]: 12: Hoare triple {2877#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2878#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:07:07,360 INFO L273 TraceCheckUtils]: 13: Hoare triple {2878#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2879#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:07:07,361 INFO L273 TraceCheckUtils]: 14: Hoare triple {2879#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2880#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:07:07,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {2880#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2881#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:07:07,363 INFO L273 TraceCheckUtils]: 16: Hoare triple {2881#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2882#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:07:07,364 INFO L273 TraceCheckUtils]: 17: Hoare triple {2882#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2883#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:07:07,365 INFO L273 TraceCheckUtils]: 18: Hoare triple {2883#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2884#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2018-11-23 13:07:07,366 INFO L273 TraceCheckUtils]: 19: Hoare triple {2884#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2885#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2018-11-23 13:07:07,367 INFO L273 TraceCheckUtils]: 20: Hoare triple {2885#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2886#(and (<= (div main_~x~0 4294967296) 0) (<= 268435409 main_~x~0))} is VALID [2018-11-23 13:07:07,368 INFO L273 TraceCheckUtils]: 21: Hoare triple {2886#(and (<= (div main_~x~0 4294967296) 0) (<= 268435409 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {2869#false} is VALID [2018-11-23 13:07:07,368 INFO L256 TraceCheckUtils]: 22: Hoare triple {2869#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2869#false} is VALID [2018-11-23 13:07:07,368 INFO L273 TraceCheckUtils]: 23: Hoare triple {2869#false} ~cond := #in~cond; {2869#false} is VALID [2018-11-23 13:07:07,369 INFO L273 TraceCheckUtils]: 24: Hoare triple {2869#false} assume 0 == ~cond; {2869#false} is VALID [2018-11-23 13:07:07,369 INFO L273 TraceCheckUtils]: 25: Hoare triple {2869#false} assume !false; {2869#false} is VALID [2018-11-23 13:07:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:07,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:07,371 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:07,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:07:07,392 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:07:07,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:07,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:07,520 INFO L256 TraceCheckUtils]: 0: Hoare triple {2868#true} call ULTIMATE.init(); {2868#true} is VALID [2018-11-23 13:07:07,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {2868#true} assume true; {2868#true} is VALID [2018-11-23 13:07:07,521 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2868#true} {2868#true} #31#return; {2868#true} is VALID [2018-11-23 13:07:07,521 INFO L256 TraceCheckUtils]: 3: Hoare triple {2868#true} call #t~ret0 := main(); {2868#true} is VALID [2018-11-23 13:07:07,521 INFO L273 TraceCheckUtils]: 4: Hoare triple {2868#true} ~x~0 := 268435441; {2870#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:07:07,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {2870#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2871#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:07:07,523 INFO L273 TraceCheckUtils]: 6: Hoare triple {2871#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2872#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:07:07,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {2872#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2873#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:07:07,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {2873#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2874#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:07:07,525 INFO L273 TraceCheckUtils]: 9: Hoare triple {2874#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2875#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:07:07,526 INFO L273 TraceCheckUtils]: 10: Hoare triple {2875#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2876#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:07:07,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {2876#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2877#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:07:07,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {2877#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2878#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:07:07,529 INFO L273 TraceCheckUtils]: 13: Hoare triple {2878#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2879#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:07:07,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {2879#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2880#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:07:07,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {2880#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2881#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:07:07,532 INFO L273 TraceCheckUtils]: 16: Hoare triple {2881#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2882#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:07:07,533 INFO L273 TraceCheckUtils]: 17: Hoare triple {2882#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2883#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:07:07,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {2883#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2884#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2018-11-23 13:07:07,535 INFO L273 TraceCheckUtils]: 19: Hoare triple {2884#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2885#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2018-11-23 13:07:07,536 INFO L273 TraceCheckUtils]: 20: Hoare triple {2885#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {2950#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} is VALID [2018-11-23 13:07:07,537 INFO L273 TraceCheckUtils]: 21: Hoare triple {2950#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {2869#false} is VALID [2018-11-23 13:07:07,538 INFO L256 TraceCheckUtils]: 22: Hoare triple {2869#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2869#false} is VALID [2018-11-23 13:07:07,538 INFO L273 TraceCheckUtils]: 23: Hoare triple {2869#false} ~cond := #in~cond; {2869#false} is VALID [2018-11-23 13:07:07,538 INFO L273 TraceCheckUtils]: 24: Hoare triple {2869#false} assume 0 == ~cond; {2869#false} is VALID [2018-11-23 13:07:07,538 INFO L273 TraceCheckUtils]: 25: Hoare triple {2869#false} assume !false; {2869#false} is VALID [2018-11-23 13:07:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:07,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:07,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 13:07:07,559 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-11-23 13:07:07,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:07,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:07:07,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:07,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:07:07,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:07:07,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:07:07,583 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2018-11-23 13:07:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:08,426 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 13:07:08,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:07:08,427 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-11-23 13:07:08,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:07:08,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2018-11-23 13:07:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:07:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2018-11-23 13:07:08,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 33 transitions. [2018-11-23 13:07:08,460 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:07:08,461 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:07:08,462 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:07:08,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:07:08,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:07:08,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:07:08,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:08,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 13:07:08,500 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:07:08,500 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:07:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:08,501 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:07:08,501 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:07:08,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:08,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:08,501 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:07:08,501 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:07:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:08,502 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:07:08,503 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:07:08,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:08,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:08,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:08,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:07:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-23 13:07:08,504 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-11-23 13:07:08,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:08,505 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-23 13:07:08,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:07:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:07:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:07:08,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:08,506 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:08,506 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:08,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:08,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2018-11-23 13:07:08,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:08,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:08,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:08,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:08,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:09,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {3132#true} call ULTIMATE.init(); {3132#true} is VALID [2018-11-23 13:07:09,178 INFO L273 TraceCheckUtils]: 1: Hoare triple {3132#true} assume true; {3132#true} is VALID [2018-11-23 13:07:09,178 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3132#true} {3132#true} #31#return; {3132#true} is VALID [2018-11-23 13:07:09,179 INFO L256 TraceCheckUtils]: 3: Hoare triple {3132#true} call #t~ret0 := main(); {3132#true} is VALID [2018-11-23 13:07:09,179 INFO L273 TraceCheckUtils]: 4: Hoare triple {3132#true} ~x~0 := 268435441; {3134#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:07:09,180 INFO L273 TraceCheckUtils]: 5: Hoare triple {3134#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3135#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:07:09,181 INFO L273 TraceCheckUtils]: 6: Hoare triple {3135#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3136#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:07:09,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {3136#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3137#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:07:09,183 INFO L273 TraceCheckUtils]: 8: Hoare triple {3137#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3138#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:07:09,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {3138#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3139#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:07:09,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {3139#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3140#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:07:09,187 INFO L273 TraceCheckUtils]: 11: Hoare triple {3140#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3141#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:07:09,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {3141#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3142#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:07:09,189 INFO L273 TraceCheckUtils]: 13: Hoare triple {3142#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3143#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:07:09,190 INFO L273 TraceCheckUtils]: 14: Hoare triple {3143#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3144#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:07:09,191 INFO L273 TraceCheckUtils]: 15: Hoare triple {3144#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3145#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:07:09,192 INFO L273 TraceCheckUtils]: 16: Hoare triple {3145#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3146#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:07:09,193 INFO L273 TraceCheckUtils]: 17: Hoare triple {3146#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3147#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:07:09,194 INFO L273 TraceCheckUtils]: 18: Hoare triple {3147#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3148#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2018-11-23 13:07:09,195 INFO L273 TraceCheckUtils]: 19: Hoare triple {3148#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3149#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2018-11-23 13:07:09,196 INFO L273 TraceCheckUtils]: 20: Hoare triple {3149#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3150#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} is VALID [2018-11-23 13:07:09,197 INFO L273 TraceCheckUtils]: 21: Hoare triple {3150#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3151#(and (<= (div main_~x~0 4294967296) 0) (<= 268435407 main_~x~0))} is VALID [2018-11-23 13:07:09,198 INFO L273 TraceCheckUtils]: 22: Hoare triple {3151#(and (<= (div main_~x~0 4294967296) 0) (<= 268435407 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {3133#false} is VALID [2018-11-23 13:07:09,198 INFO L256 TraceCheckUtils]: 23: Hoare triple {3133#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3133#false} is VALID [2018-11-23 13:07:09,199 INFO L273 TraceCheckUtils]: 24: Hoare triple {3133#false} ~cond := #in~cond; {3133#false} is VALID [2018-11-23 13:07:09,199 INFO L273 TraceCheckUtils]: 25: Hoare triple {3133#false} assume 0 == ~cond; {3133#false} is VALID [2018-11-23 13:07:09,199 INFO L273 TraceCheckUtils]: 26: Hoare triple {3133#false} assume !false; {3133#false} is VALID [2018-11-23 13:07:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:09,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:09,214 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:09,225 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:08:25,275 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 13:08:25,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:25,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:25,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {3132#true} call ULTIMATE.init(); {3132#true} is VALID [2018-11-23 13:08:25,737 INFO L273 TraceCheckUtils]: 1: Hoare triple {3132#true} assume true; {3132#true} is VALID [2018-11-23 13:08:25,737 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3132#true} {3132#true} #31#return; {3132#true} is VALID [2018-11-23 13:08:25,737 INFO L256 TraceCheckUtils]: 3: Hoare triple {3132#true} call #t~ret0 := main(); {3132#true} is VALID [2018-11-23 13:08:25,738 INFO L273 TraceCheckUtils]: 4: Hoare triple {3132#true} ~x~0 := 268435441; {3134#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:08:25,739 INFO L273 TraceCheckUtils]: 5: Hoare triple {3134#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3135#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:08:25,742 INFO L273 TraceCheckUtils]: 6: Hoare triple {3135#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3136#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:08:25,742 INFO L273 TraceCheckUtils]: 7: Hoare triple {3136#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3137#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:08:25,744 INFO L273 TraceCheckUtils]: 8: Hoare triple {3137#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3138#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:08:25,744 INFO L273 TraceCheckUtils]: 9: Hoare triple {3138#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3139#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:08:25,746 INFO L273 TraceCheckUtils]: 10: Hoare triple {3139#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3140#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:08:25,748 INFO L273 TraceCheckUtils]: 11: Hoare triple {3140#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3141#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:08:25,748 INFO L273 TraceCheckUtils]: 12: Hoare triple {3141#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3142#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:08:25,750 INFO L273 TraceCheckUtils]: 13: Hoare triple {3142#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3143#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:08:25,750 INFO L273 TraceCheckUtils]: 14: Hoare triple {3143#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3144#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:08:25,752 INFO L273 TraceCheckUtils]: 15: Hoare triple {3144#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3145#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:08:25,753 INFO L273 TraceCheckUtils]: 16: Hoare triple {3145#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3146#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:08:25,754 INFO L273 TraceCheckUtils]: 17: Hoare triple {3146#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3147#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:08:25,755 INFO L273 TraceCheckUtils]: 18: Hoare triple {3147#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3148#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2018-11-23 13:08:25,756 INFO L273 TraceCheckUtils]: 19: Hoare triple {3148#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3149#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2018-11-23 13:08:25,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {3149#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3150#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} is VALID [2018-11-23 13:08:25,758 INFO L273 TraceCheckUtils]: 21: Hoare triple {3150#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3218#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2018-11-23 13:08:25,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {3218#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !(~x~0 % 4294967296 > 1); {3133#false} is VALID [2018-11-23 13:08:25,759 INFO L256 TraceCheckUtils]: 23: Hoare triple {3133#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3133#false} is VALID [2018-11-23 13:08:25,759 INFO L273 TraceCheckUtils]: 24: Hoare triple {3133#false} ~cond := #in~cond; {3133#false} is VALID [2018-11-23 13:08:25,759 INFO L273 TraceCheckUtils]: 25: Hoare triple {3133#false} assume 0 == ~cond; {3133#false} is VALID [2018-11-23 13:08:25,760 INFO L273 TraceCheckUtils]: 26: Hoare triple {3133#false} assume !false; {3133#false} is VALID [2018-11-23 13:08:25,761 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:25,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:25,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 13:08:25,782 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-11-23 13:08:25,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:25,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 13:08:25,806 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:08:25,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:08:25,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:08:25,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:08:25,807 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2018-11-23 13:08:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:26,776 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:08:26,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:08:26,776 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-11-23 13:08:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:08:26,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2018-11-23 13:08:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:08:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2018-11-23 13:08:26,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2018-11-23 13:08:26,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:26,811 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:08:26,812 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:08:26,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:08:26,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:08:26,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 13:08:26,844 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:26,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 13:08:26,844 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:08:26,845 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:08:26,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:26,846 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:08:26,846 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:08:26,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:26,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:26,846 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:08:26,846 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:08:26,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:26,847 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:08:26,847 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:08:26,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:26,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:26,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:26,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:08:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-23 13:08:26,848 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-11-23 13:08:26,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:26,848 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-23 13:08:26,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:08:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:08:26,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:08:26,849 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:26,849 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:26,849 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:26,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:26,849 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2018-11-23 13:08:26,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:26,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:26,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:26,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:26,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:27,454 INFO L256 TraceCheckUtils]: 0: Hoare triple {3406#true} call ULTIMATE.init(); {3406#true} is VALID [2018-11-23 13:08:27,454 INFO L273 TraceCheckUtils]: 1: Hoare triple {3406#true} assume true; {3406#true} is VALID [2018-11-23 13:08:27,455 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3406#true} {3406#true} #31#return; {3406#true} is VALID [2018-11-23 13:08:27,455 INFO L256 TraceCheckUtils]: 3: Hoare triple {3406#true} call #t~ret0 := main(); {3406#true} is VALID [2018-11-23 13:08:27,472 INFO L273 TraceCheckUtils]: 4: Hoare triple {3406#true} ~x~0 := 268435441; {3408#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:08:27,476 INFO L273 TraceCheckUtils]: 5: Hoare triple {3408#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3409#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:08:27,477 INFO L273 TraceCheckUtils]: 6: Hoare triple {3409#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3410#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:08:27,478 INFO L273 TraceCheckUtils]: 7: Hoare triple {3410#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3411#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:08:27,478 INFO L273 TraceCheckUtils]: 8: Hoare triple {3411#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3412#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:08:27,479 INFO L273 TraceCheckUtils]: 9: Hoare triple {3412#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3413#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:08:27,479 INFO L273 TraceCheckUtils]: 10: Hoare triple {3413#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3414#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:08:27,480 INFO L273 TraceCheckUtils]: 11: Hoare triple {3414#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3415#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:08:27,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {3415#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3416#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:08:27,482 INFO L273 TraceCheckUtils]: 13: Hoare triple {3416#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3417#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:08:27,483 INFO L273 TraceCheckUtils]: 14: Hoare triple {3417#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3418#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:08:27,484 INFO L273 TraceCheckUtils]: 15: Hoare triple {3418#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3419#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:08:27,485 INFO L273 TraceCheckUtils]: 16: Hoare triple {3419#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3420#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:08:27,486 INFO L273 TraceCheckUtils]: 17: Hoare triple {3420#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3421#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:08:27,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {3421#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3422#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2018-11-23 13:08:27,488 INFO L273 TraceCheckUtils]: 19: Hoare triple {3422#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3423#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2018-11-23 13:08:27,489 INFO L273 TraceCheckUtils]: 20: Hoare triple {3423#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3424#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} is VALID [2018-11-23 13:08:27,490 INFO L273 TraceCheckUtils]: 21: Hoare triple {3424#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3425#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2018-11-23 13:08:27,491 INFO L273 TraceCheckUtils]: 22: Hoare triple {3425#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3426#(and (<= (div main_~x~0 4294967296) 0) (<= 268435405 main_~x~0))} is VALID [2018-11-23 13:08:27,492 INFO L273 TraceCheckUtils]: 23: Hoare triple {3426#(and (<= (div main_~x~0 4294967296) 0) (<= 268435405 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {3407#false} is VALID [2018-11-23 13:08:27,492 INFO L256 TraceCheckUtils]: 24: Hoare triple {3407#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3407#false} is VALID [2018-11-23 13:08:27,492 INFO L273 TraceCheckUtils]: 25: Hoare triple {3407#false} ~cond := #in~cond; {3407#false} is VALID [2018-11-23 13:08:27,492 INFO L273 TraceCheckUtils]: 26: Hoare triple {3407#false} assume 0 == ~cond; {3407#false} is VALID [2018-11-23 13:08:27,493 INFO L273 TraceCheckUtils]: 27: Hoare triple {3407#false} assume !false; {3407#false} is VALID [2018-11-23 13:08:27,494 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:27,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:27,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:27,503 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:09:08,961 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 13:09:08,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:09,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:09,833 INFO L256 TraceCheckUtils]: 0: Hoare triple {3406#true} call ULTIMATE.init(); {3406#true} is VALID [2018-11-23 13:09:09,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {3406#true} assume true; {3406#true} is VALID [2018-11-23 13:09:09,834 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3406#true} {3406#true} #31#return; {3406#true} is VALID [2018-11-23 13:09:09,834 INFO L256 TraceCheckUtils]: 3: Hoare triple {3406#true} call #t~ret0 := main(); {3406#true} is VALID [2018-11-23 13:09:09,835 INFO L273 TraceCheckUtils]: 4: Hoare triple {3406#true} ~x~0 := 268435441; {3408#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:09:09,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {3408#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3409#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:09:09,836 INFO L273 TraceCheckUtils]: 6: Hoare triple {3409#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3410#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:09:09,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {3410#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3411#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:09:09,837 INFO L273 TraceCheckUtils]: 8: Hoare triple {3411#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3412#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:09:09,838 INFO L273 TraceCheckUtils]: 9: Hoare triple {3412#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3413#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:09:09,839 INFO L273 TraceCheckUtils]: 10: Hoare triple {3413#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3414#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:09:09,840 INFO L273 TraceCheckUtils]: 11: Hoare triple {3414#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3415#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:09:09,841 INFO L273 TraceCheckUtils]: 12: Hoare triple {3415#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3416#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:09:09,842 INFO L273 TraceCheckUtils]: 13: Hoare triple {3416#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3417#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:09:09,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {3417#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3418#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:09:09,844 INFO L273 TraceCheckUtils]: 15: Hoare triple {3418#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3419#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:09:09,845 INFO L273 TraceCheckUtils]: 16: Hoare triple {3419#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3420#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:09:09,846 INFO L273 TraceCheckUtils]: 17: Hoare triple {3420#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3421#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:09:09,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {3421#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3422#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2018-11-23 13:09:09,848 INFO L273 TraceCheckUtils]: 19: Hoare triple {3422#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3423#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2018-11-23 13:09:09,849 INFO L273 TraceCheckUtils]: 20: Hoare triple {3423#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3424#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} is VALID [2018-11-23 13:09:09,850 INFO L273 TraceCheckUtils]: 21: Hoare triple {3424#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3425#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2018-11-23 13:09:09,851 INFO L273 TraceCheckUtils]: 22: Hoare triple {3425#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3496#(and (<= 268435405 main_~x~0) (<= main_~x~0 268435405))} is VALID [2018-11-23 13:09:09,852 INFO L273 TraceCheckUtils]: 23: Hoare triple {3496#(and (<= 268435405 main_~x~0) (<= main_~x~0 268435405))} assume !(~x~0 % 4294967296 > 1); {3407#false} is VALID [2018-11-23 13:09:09,853 INFO L256 TraceCheckUtils]: 24: Hoare triple {3407#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3407#false} is VALID [2018-11-23 13:09:09,853 INFO L273 TraceCheckUtils]: 25: Hoare triple {3407#false} ~cond := #in~cond; {3407#false} is VALID [2018-11-23 13:09:09,853 INFO L273 TraceCheckUtils]: 26: Hoare triple {3407#false} assume 0 == ~cond; {3407#false} is VALID [2018-11-23 13:09:09,853 INFO L273 TraceCheckUtils]: 27: Hoare triple {3407#false} assume !false; {3407#false} is VALID [2018-11-23 13:09:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:09,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:09,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 13:09:09,875 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-11-23 13:09:09,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:09,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:09:09,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:09,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:09:09,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:09:09,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:09:09,902 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2018-11-23 13:09:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:10,889 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 13:09:10,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:09:10,889 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-11-23 13:09:10,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:10,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:09:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2018-11-23 13:09:10,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:09:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2018-11-23 13:09:10,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 35 transitions. [2018-11-23 13:09:11,345 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:09:11,346 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:09:11,346 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:09:11,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:09:11,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:09:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 13:09:11,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:11,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 13:09:11,450 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 13:09:11,450 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 13:09:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:11,451 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:09:11,451 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:09:11,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:11,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:11,452 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 13:09:11,452 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 13:09:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:11,452 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:09:11,453 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:09:11,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:11,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:11,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:11,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:09:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-23 13:09:11,454 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-11-23 13:09:11,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:11,454 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-23 13:09:11,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:09:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:09:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:09:11,455 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:11,455 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:11,455 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:11,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:11,456 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2018-11-23 13:09:11,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:11,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:11,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:11,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:11,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:12,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {3690#true} call ULTIMATE.init(); {3690#true} is VALID [2018-11-23 13:09:12,050 INFO L273 TraceCheckUtils]: 1: Hoare triple {3690#true} assume true; {3690#true} is VALID [2018-11-23 13:09:12,050 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3690#true} {3690#true} #31#return; {3690#true} is VALID [2018-11-23 13:09:12,051 INFO L256 TraceCheckUtils]: 3: Hoare triple {3690#true} call #t~ret0 := main(); {3690#true} is VALID [2018-11-23 13:09:12,051 INFO L273 TraceCheckUtils]: 4: Hoare triple {3690#true} ~x~0 := 268435441; {3692#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:09:12,052 INFO L273 TraceCheckUtils]: 5: Hoare triple {3692#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3693#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:09:12,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {3693#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3694#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:09:12,053 INFO L273 TraceCheckUtils]: 7: Hoare triple {3694#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3695#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:09:12,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {3695#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3696#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:09:12,054 INFO L273 TraceCheckUtils]: 9: Hoare triple {3696#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3697#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:09:12,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {3697#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3698#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:09:12,056 INFO L273 TraceCheckUtils]: 11: Hoare triple {3698#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3699#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:09:12,057 INFO L273 TraceCheckUtils]: 12: Hoare triple {3699#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3700#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:09:12,058 INFO L273 TraceCheckUtils]: 13: Hoare triple {3700#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3701#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:09:12,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {3701#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3702#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:09:12,060 INFO L273 TraceCheckUtils]: 15: Hoare triple {3702#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3703#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:09:12,061 INFO L273 TraceCheckUtils]: 16: Hoare triple {3703#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3704#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:09:12,062 INFO L273 TraceCheckUtils]: 17: Hoare triple {3704#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3705#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:09:12,063 INFO L273 TraceCheckUtils]: 18: Hoare triple {3705#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3706#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2018-11-23 13:09:12,064 INFO L273 TraceCheckUtils]: 19: Hoare triple {3706#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3707#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2018-11-23 13:09:12,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {3707#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3708#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} is VALID [2018-11-23 13:09:12,066 INFO L273 TraceCheckUtils]: 21: Hoare triple {3708#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3709#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2018-11-23 13:09:12,067 INFO L273 TraceCheckUtils]: 22: Hoare triple {3709#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3710#(and (<= 268435405 main_~x~0) (<= main_~x~0 268435405))} is VALID [2018-11-23 13:09:12,068 INFO L273 TraceCheckUtils]: 23: Hoare triple {3710#(and (<= 268435405 main_~x~0) (<= main_~x~0 268435405))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3711#(and (<= (div main_~x~0 4294967296) 0) (<= 268435403 main_~x~0))} is VALID [2018-11-23 13:09:12,069 INFO L273 TraceCheckUtils]: 24: Hoare triple {3711#(and (<= (div main_~x~0 4294967296) 0) (<= 268435403 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {3691#false} is VALID [2018-11-23 13:09:12,069 INFO L256 TraceCheckUtils]: 25: Hoare triple {3691#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3691#false} is VALID [2018-11-23 13:09:12,070 INFO L273 TraceCheckUtils]: 26: Hoare triple {3691#false} ~cond := #in~cond; {3691#false} is VALID [2018-11-23 13:09:12,070 INFO L273 TraceCheckUtils]: 27: Hoare triple {3691#false} assume 0 == ~cond; {3691#false} is VALID [2018-11-23 13:09:12,070 INFO L273 TraceCheckUtils]: 28: Hoare triple {3691#false} assume !false; {3691#false} is VALID [2018-11-23 13:09:12,072 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:12,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:12,072 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:12,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:12,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:12,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {3690#true} call ULTIMATE.init(); {3690#true} is VALID [2018-11-23 13:09:12,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {3690#true} assume true; {3690#true} is VALID [2018-11-23 13:09:12,274 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3690#true} {3690#true} #31#return; {3690#true} is VALID [2018-11-23 13:09:12,274 INFO L256 TraceCheckUtils]: 3: Hoare triple {3690#true} call #t~ret0 := main(); {3690#true} is VALID [2018-11-23 13:09:12,275 INFO L273 TraceCheckUtils]: 4: Hoare triple {3690#true} ~x~0 := 268435441; {3692#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:09:12,275 INFO L273 TraceCheckUtils]: 5: Hoare triple {3692#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3693#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:09:12,276 INFO L273 TraceCheckUtils]: 6: Hoare triple {3693#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3694#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:09:12,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {3694#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3695#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:09:12,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {3695#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3696#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:09:12,278 INFO L273 TraceCheckUtils]: 9: Hoare triple {3696#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3697#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:09:12,279 INFO L273 TraceCheckUtils]: 10: Hoare triple {3697#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3698#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:09:12,280 INFO L273 TraceCheckUtils]: 11: Hoare triple {3698#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3699#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:09:12,281 INFO L273 TraceCheckUtils]: 12: Hoare triple {3699#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3700#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:09:12,282 INFO L273 TraceCheckUtils]: 13: Hoare triple {3700#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3701#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:09:12,283 INFO L273 TraceCheckUtils]: 14: Hoare triple {3701#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3702#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:09:12,284 INFO L273 TraceCheckUtils]: 15: Hoare triple {3702#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3703#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:09:12,285 INFO L273 TraceCheckUtils]: 16: Hoare triple {3703#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3704#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:09:12,286 INFO L273 TraceCheckUtils]: 17: Hoare triple {3704#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3705#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:09:12,287 INFO L273 TraceCheckUtils]: 18: Hoare triple {3705#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3706#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2018-11-23 13:09:12,288 INFO L273 TraceCheckUtils]: 19: Hoare triple {3706#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3707#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2018-11-23 13:09:12,289 INFO L273 TraceCheckUtils]: 20: Hoare triple {3707#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3708#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} is VALID [2018-11-23 13:09:12,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {3708#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3709#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2018-11-23 13:09:12,291 INFO L273 TraceCheckUtils]: 22: Hoare triple {3709#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3710#(and (<= 268435405 main_~x~0) (<= main_~x~0 268435405))} is VALID [2018-11-23 13:09:12,292 INFO L273 TraceCheckUtils]: 23: Hoare triple {3710#(and (<= 268435405 main_~x~0) (<= main_~x~0 268435405))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3784#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2018-11-23 13:09:12,293 INFO L273 TraceCheckUtils]: 24: Hoare triple {3784#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !(~x~0 % 4294967296 > 1); {3691#false} is VALID [2018-11-23 13:09:12,293 INFO L256 TraceCheckUtils]: 25: Hoare triple {3691#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3691#false} is VALID [2018-11-23 13:09:12,294 INFO L273 TraceCheckUtils]: 26: Hoare triple {3691#false} ~cond := #in~cond; {3691#false} is VALID [2018-11-23 13:09:12,294 INFO L273 TraceCheckUtils]: 27: Hoare triple {3691#false} assume 0 == ~cond; {3691#false} is VALID [2018-11-23 13:09:12,294 INFO L273 TraceCheckUtils]: 28: Hoare triple {3691#false} assume !false; {3691#false} is VALID [2018-11-23 13:09:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:12,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:12,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 13:09:12,316 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-11-23 13:09:12,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:12,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:09:12,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:12,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:09:12,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:09:12,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:09:12,343 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2018-11-23 13:09:14,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:14,037 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:09:14,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:09:14,038 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-11-23 13:09:14,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:14,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:09:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2018-11-23 13:09:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:09:14,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2018-11-23 13:09:14,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2018-11-23 13:09:14,082 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:14,082 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:09:14,083 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:09:14,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:09:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:09:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 13:09:14,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:14,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 13:09:14,113 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 13:09:14,113 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 13:09:14,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:14,115 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:09:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:09:14,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:14,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:14,115 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 13:09:14,115 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 13:09:14,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:14,116 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:09:14,117 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:09:14,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:14,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:14,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:14,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:14,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:09:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-23 13:09:14,118 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-11-23 13:09:14,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:14,118 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-23 13:09:14,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:09:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:09:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:09:14,119 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:14,119 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:14,120 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:14,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:14,120 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2018-11-23 13:09:14,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:14,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:14,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:14,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:14,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:15,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {3984#true} call ULTIMATE.init(); {3984#true} is VALID [2018-11-23 13:09:15,003 INFO L273 TraceCheckUtils]: 1: Hoare triple {3984#true} assume true; {3984#true} is VALID [2018-11-23 13:09:15,003 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3984#true} {3984#true} #31#return; {3984#true} is VALID [2018-11-23 13:09:15,003 INFO L256 TraceCheckUtils]: 3: Hoare triple {3984#true} call #t~ret0 := main(); {3984#true} is VALID [2018-11-23 13:09:15,003 INFO L273 TraceCheckUtils]: 4: Hoare triple {3984#true} ~x~0 := 268435441; {3986#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:09:15,004 INFO L273 TraceCheckUtils]: 5: Hoare triple {3986#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3987#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:09:15,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {3987#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3988#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:09:15,026 INFO L273 TraceCheckUtils]: 7: Hoare triple {3988#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3989#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:09:15,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {3989#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3990#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:09:15,050 INFO L273 TraceCheckUtils]: 9: Hoare triple {3990#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3991#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:09:15,062 INFO L273 TraceCheckUtils]: 10: Hoare triple {3991#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3992#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:09:15,079 INFO L273 TraceCheckUtils]: 11: Hoare triple {3992#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3993#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:09:15,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {3993#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3994#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:09:15,097 INFO L273 TraceCheckUtils]: 13: Hoare triple {3994#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3995#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:09:15,109 INFO L273 TraceCheckUtils]: 14: Hoare triple {3995#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3996#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:09:15,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {3996#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3997#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:09:15,111 INFO L273 TraceCheckUtils]: 16: Hoare triple {3997#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3998#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:09:15,111 INFO L273 TraceCheckUtils]: 17: Hoare triple {3998#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3999#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:09:15,112 INFO L273 TraceCheckUtils]: 18: Hoare triple {3999#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4000#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2018-11-23 13:09:15,112 INFO L273 TraceCheckUtils]: 19: Hoare triple {4000#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4001#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2018-11-23 13:09:15,113 INFO L273 TraceCheckUtils]: 20: Hoare triple {4001#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4002#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} is VALID [2018-11-23 13:09:15,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {4002#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4003#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2018-11-23 13:09:15,115 INFO L273 TraceCheckUtils]: 22: Hoare triple {4003#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4004#(and (<= 268435405 main_~x~0) (<= main_~x~0 268435405))} is VALID [2018-11-23 13:09:15,116 INFO L273 TraceCheckUtils]: 23: Hoare triple {4004#(and (<= 268435405 main_~x~0) (<= main_~x~0 268435405))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4005#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2018-11-23 13:09:15,117 INFO L273 TraceCheckUtils]: 24: Hoare triple {4005#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4006#(and (<= 268435401 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:09:15,118 INFO L273 TraceCheckUtils]: 25: Hoare triple {4006#(and (<= 268435401 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {3985#false} is VALID [2018-11-23 13:09:15,118 INFO L256 TraceCheckUtils]: 26: Hoare triple {3985#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3985#false} is VALID [2018-11-23 13:09:15,118 INFO L273 TraceCheckUtils]: 27: Hoare triple {3985#false} ~cond := #in~cond; {3985#false} is VALID [2018-11-23 13:09:15,118 INFO L273 TraceCheckUtils]: 28: Hoare triple {3985#false} assume 0 == ~cond; {3985#false} is VALID [2018-11-23 13:09:15,119 INFO L273 TraceCheckUtils]: 29: Hoare triple {3985#false} assume !false; {3985#false} is VALID [2018-11-23 13:09:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:15,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:15,121 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:15,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:09:15,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:09:15,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:15,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:15,295 INFO L256 TraceCheckUtils]: 0: Hoare triple {3984#true} call ULTIMATE.init(); {3984#true} is VALID [2018-11-23 13:09:15,295 INFO L273 TraceCheckUtils]: 1: Hoare triple {3984#true} assume true; {3984#true} is VALID [2018-11-23 13:09:15,295 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3984#true} {3984#true} #31#return; {3984#true} is VALID [2018-11-23 13:09:15,296 INFO L256 TraceCheckUtils]: 3: Hoare triple {3984#true} call #t~ret0 := main(); {3984#true} is VALID [2018-11-23 13:09:15,296 INFO L273 TraceCheckUtils]: 4: Hoare triple {3984#true} ~x~0 := 268435441; {3986#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:09:15,297 INFO L273 TraceCheckUtils]: 5: Hoare triple {3986#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3987#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:09:15,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {3987#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3988#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:09:15,298 INFO L273 TraceCheckUtils]: 7: Hoare triple {3988#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3989#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:09:15,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {3989#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3990#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:09:15,299 INFO L273 TraceCheckUtils]: 9: Hoare triple {3990#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3991#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:09:15,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {3991#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3992#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:09:15,301 INFO L273 TraceCheckUtils]: 11: Hoare triple {3992#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3993#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:09:15,302 INFO L273 TraceCheckUtils]: 12: Hoare triple {3993#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3994#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:09:15,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {3994#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3995#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:09:15,304 INFO L273 TraceCheckUtils]: 14: Hoare triple {3995#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3996#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:09:15,305 INFO L273 TraceCheckUtils]: 15: Hoare triple {3996#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3997#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:09:15,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {3997#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3998#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:09:15,307 INFO L273 TraceCheckUtils]: 17: Hoare triple {3998#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {3999#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:09:15,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {3999#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4000#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2018-11-23 13:09:15,309 INFO L273 TraceCheckUtils]: 19: Hoare triple {4000#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4001#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2018-11-23 13:09:15,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {4001#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4002#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} is VALID [2018-11-23 13:09:15,311 INFO L273 TraceCheckUtils]: 21: Hoare triple {4002#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4003#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2018-11-23 13:09:15,312 INFO L273 TraceCheckUtils]: 22: Hoare triple {4003#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4004#(and (<= 268435405 main_~x~0) (<= main_~x~0 268435405))} is VALID [2018-11-23 13:09:15,313 INFO L273 TraceCheckUtils]: 23: Hoare triple {4004#(and (<= 268435405 main_~x~0) (<= main_~x~0 268435405))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4005#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2018-11-23 13:09:15,314 INFO L273 TraceCheckUtils]: 24: Hoare triple {4005#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4082#(and (<= 268435401 main_~x~0) (<= main_~x~0 268435401))} is VALID [2018-11-23 13:09:15,315 INFO L273 TraceCheckUtils]: 25: Hoare triple {4082#(and (<= 268435401 main_~x~0) (<= main_~x~0 268435401))} assume !(~x~0 % 4294967296 > 1); {3985#false} is VALID [2018-11-23 13:09:15,315 INFO L256 TraceCheckUtils]: 26: Hoare triple {3985#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3985#false} is VALID [2018-11-23 13:09:15,315 INFO L273 TraceCheckUtils]: 27: Hoare triple {3985#false} ~cond := #in~cond; {3985#false} is VALID [2018-11-23 13:09:15,315 INFO L273 TraceCheckUtils]: 28: Hoare triple {3985#false} assume 0 == ~cond; {3985#false} is VALID [2018-11-23 13:09:15,315 INFO L273 TraceCheckUtils]: 29: Hoare triple {3985#false} assume !false; {3985#false} is VALID [2018-11-23 13:09:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:15,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:15,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 13:09:15,337 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-11-23 13:09:15,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:15,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 13:09:15,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:15,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 13:09:15,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 13:09:15,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:09:15,365 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2018-11-23 13:09:16,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:16,659 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-23 13:09:16,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:09:16,659 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-11-23 13:09:16,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:16,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:09:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2018-11-23 13:09:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:09:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2018-11-23 13:09:16,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 37 transitions. [2018-11-23 13:09:17,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:17,123 INFO L225 Difference]: With dead ends: 37 [2018-11-23 13:09:17,123 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:09:17,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:09:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:09:17,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 13:09:17,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:17,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 13:09:17,192 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 13:09:17,192 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 13:09:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:17,193 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:09:17,194 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:09:17,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:17,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:17,194 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 13:09:17,194 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 13:09:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:17,195 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:09:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:09:17,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:17,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:17,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:17,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:09:17,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-23 13:09:17,197 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-11-23 13:09:17,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:17,197 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-23 13:09:17,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 13:09:17,198 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:09:17,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 13:09:17,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:17,198 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:17,198 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:17,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:17,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2018-11-23 13:09:17,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:17,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:17,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:17,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:17,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:17,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {4288#true} call ULTIMATE.init(); {4288#true} is VALID [2018-11-23 13:09:17,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {4288#true} assume true; {4288#true} is VALID [2018-11-23 13:09:17,874 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4288#true} {4288#true} #31#return; {4288#true} is VALID [2018-11-23 13:09:17,874 INFO L256 TraceCheckUtils]: 3: Hoare triple {4288#true} call #t~ret0 := main(); {4288#true} is VALID [2018-11-23 13:09:17,875 INFO L273 TraceCheckUtils]: 4: Hoare triple {4288#true} ~x~0 := 268435441; {4290#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} is VALID [2018-11-23 13:09:17,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {4290#(and (<= main_~x~0 268435441) (<= 268435441 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4291#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} is VALID [2018-11-23 13:09:17,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {4291#(and (<= 268435439 main_~x~0) (<= main_~x~0 268435439))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4292#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} is VALID [2018-11-23 13:09:17,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {4292#(and (<= 268435437 main_~x~0) (<= main_~x~0 268435437))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4293#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} is VALID [2018-11-23 13:09:17,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {4293#(and (<= 268435435 main_~x~0) (<= main_~x~0 268435435))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4294#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} is VALID [2018-11-23 13:09:17,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {4294#(and (<= 268435433 main_~x~0) (<= main_~x~0 268435433))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4295#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} is VALID [2018-11-23 13:09:17,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {4295#(and (<= 268435431 main_~x~0) (<= main_~x~0 268435431))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4296#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} is VALID [2018-11-23 13:09:17,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {4296#(and (<= 268435429 main_~x~0) (<= main_~x~0 268435429))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4297#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} is VALID [2018-11-23 13:09:17,881 INFO L273 TraceCheckUtils]: 12: Hoare triple {4297#(and (<= main_~x~0 268435427) (<= 268435427 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4298#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} is VALID [2018-11-23 13:09:17,882 INFO L273 TraceCheckUtils]: 13: Hoare triple {4298#(and (<= main_~x~0 268435425) (<= 268435425 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4299#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} is VALID [2018-11-23 13:09:17,883 INFO L273 TraceCheckUtils]: 14: Hoare triple {4299#(and (<= 268435423 main_~x~0) (<= main_~x~0 268435423))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4300#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} is VALID [2018-11-23 13:09:17,884 INFO L273 TraceCheckUtils]: 15: Hoare triple {4300#(and (<= 268435421 main_~x~0) (<= main_~x~0 268435421))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4301#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} is VALID [2018-11-23 13:09:17,885 INFO L273 TraceCheckUtils]: 16: Hoare triple {4301#(and (<= 268435419 main_~x~0) (<= main_~x~0 268435419))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4302#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} is VALID [2018-11-23 13:09:17,886 INFO L273 TraceCheckUtils]: 17: Hoare triple {4302#(and (<= 268435417 main_~x~0) (<= main_~x~0 268435417))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4303#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} is VALID [2018-11-23 13:09:17,887 INFO L273 TraceCheckUtils]: 18: Hoare triple {4303#(and (<= main_~x~0 268435415) (<= 268435415 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4304#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} is VALID [2018-11-23 13:09:17,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {4304#(and (<= 268435413 main_~x~0) (<= main_~x~0 268435413))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4305#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} is VALID [2018-11-23 13:09:17,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {4305#(and (<= main_~x~0 268435411) (<= 268435411 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4306#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} is VALID [2018-11-23 13:09:17,890 INFO L273 TraceCheckUtils]: 21: Hoare triple {4306#(and (<= main_~x~0 268435409) (<= 268435409 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4307#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} is VALID [2018-11-23 13:09:17,891 INFO L273 TraceCheckUtils]: 22: Hoare triple {4307#(and (<= 268435407 main_~x~0) (<= main_~x~0 268435407))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4308#(and (<= 268435405 main_~x~0) (<= main_~x~0 268435405))} is VALID [2018-11-23 13:09:17,892 INFO L273 TraceCheckUtils]: 23: Hoare triple {4308#(and (<= 268435405 main_~x~0) (<= main_~x~0 268435405))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4309#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} is VALID [2018-11-23 13:09:17,893 INFO L273 TraceCheckUtils]: 24: Hoare triple {4309#(and (<= main_~x~0 268435403) (<= 268435403 main_~x~0))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4310#(and (<= 268435401 main_~x~0) (<= main_~x~0 268435401))} is VALID [2018-11-23 13:09:17,894 INFO L273 TraceCheckUtils]: 25: Hoare triple {4310#(and (<= 268435401 main_~x~0) (<= main_~x~0 268435401))} assume !!(~x~0 % 4294967296 > 1);~x~0 := ~x~0 - 2; {4311#(and (<= 268435399 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:09:17,895 INFO L273 TraceCheckUtils]: 26: Hoare triple {4311#(and (<= 268435399 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 1); {4289#false} is VALID [2018-11-23 13:09:17,895 INFO L256 TraceCheckUtils]: 27: Hoare triple {4289#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4289#false} is VALID [2018-11-23 13:09:17,895 INFO L273 TraceCheckUtils]: 28: Hoare triple {4289#false} ~cond := #in~cond; {4289#false} is VALID [2018-11-23 13:09:17,896 INFO L273 TraceCheckUtils]: 29: Hoare triple {4289#false} assume 0 == ~cond; {4289#false} is VALID [2018-11-23 13:09:17,896 INFO L273 TraceCheckUtils]: 30: Hoare triple {4289#false} assume !false; {4289#false} is VALID [2018-11-23 13:09:17,898 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:17,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:17,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:17,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2