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/diamond_false-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:04:53,498 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:04:53,500 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:04:53,512 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:04:53,512 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:04:53,513 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:04:53,514 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:04:53,516 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:04:53,518 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:04:53,519 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:04:53,520 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:04:53,520 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:04:53,521 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:04:53,522 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:04:53,523 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:04:53,524 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:04:53,525 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:04:53,527 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:04:53,529 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:04:53,531 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:04:53,532 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:04:53,533 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:04:53,536 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:04:53,536 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:04:53,536 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:04:53,537 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:04:53,538 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:04:53,539 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:04:53,540 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:04:53,541 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:04:53,541 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:04:53,542 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:04:53,543 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:04:53,543 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:04:53,544 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:04:53,545 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:04:53,545 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:04:53,561 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:04:53,561 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:04:53,562 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:04:53,562 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:04:53,563 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:04:53,563 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:04:53,563 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:04:53,564 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:04:53,564 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:04:53,564 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:04:53,564 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:04:53,565 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:04:53,565 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:04:53,565 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:04:53,565 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:04:53,565 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:04:53,566 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:04:53,566 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:04:53,566 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:04:53,566 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:04:53,566 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:04:53,567 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:04:53,567 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:04:53,567 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:53,567 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:04:53,567 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:04:53,568 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:04:53,568 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:04:53,568 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:04:53,568 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:04:53,569 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:04:53,610 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:04:53,633 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:04:53,636 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:04:53,638 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:04:53,638 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:04:53,639 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_false-unreach-call1.i [2018-11-23 13:04:53,694 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2e7c34ee/98b3cec86c9f45f5b40ae2dad317386e/FLAG568737d54 [2018-11-23 13:04:54,156 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:04:54,157 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_false-unreach-call1.i [2018-11-23 13:04:54,165 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2e7c34ee/98b3cec86c9f45f5b40ae2dad317386e/FLAG568737d54 [2018-11-23 13:04:54,500 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2e7c34ee/98b3cec86c9f45f5b40ae2dad317386e [2018-11-23 13:04:54,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:04:54,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:04:54,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:54,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:04:54,520 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:04:54,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:54" (1/1) ... [2018-11-23 13:04:54,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@724b713c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:54, skipping insertion in model container [2018-11-23 13:04:54,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:54" (1/1) ... [2018-11-23 13:04:54,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:04:54,560 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:04:54,795 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:54,801 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:04:54,822 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:54,841 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:04:54,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:54 WrapperNode [2018-11-23 13:04:54,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:54,842 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:54,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:04:54,843 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:04:54,853 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:04:54" (1/1) ... [2018-11-23 13:04:54,860 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:04:54" (1/1) ... [2018-11-23 13:04:54,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:54,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:04:54,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:04:54,870 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:04:54,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:54" (1/1) ... [2018-11-23 13:04:54,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:54" (1/1) ... [2018-11-23 13:04:54,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:54" (1/1) ... [2018-11-23 13:04:54,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:54" (1/1) ... [2018-11-23 13:04:54,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:54" (1/1) ... [2018-11-23 13:04:54,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:54" (1/1) ... [2018-11-23 13:04:54,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:54" (1/1) ... [2018-11-23 13:04:54,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:04:54,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:04:54,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:04:54,897 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:04:54,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:54" (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:04:55,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:04:55,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:04:55,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:04:55,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:04:55,029 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:04:55,029 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:04:55,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:04:55,030 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:04:55,671 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:04:55,672 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:04:55,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:55 BoogieIcfgContainer [2018-11-23 13:04:55,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:04:55,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:04:55,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:04:55,677 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:04:55,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:04:54" (1/3) ... [2018-11-23 13:04:55,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5100ab79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:55, skipping insertion in model container [2018-11-23 13:04:55,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:54" (2/3) ... [2018-11-23 13:04:55,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5100ab79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:55, skipping insertion in model container [2018-11-23 13:04:55,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:55" (3/3) ... [2018-11-23 13:04:55,682 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_false-unreach-call1.i [2018-11-23 13:04:55,693 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:04:55,702 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:04:55,721 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:04:55,755 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:04:55,756 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:04:55,756 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:04:55,757 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:04:55,758 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:04:55,758 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:04:55,758 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:04:55,759 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:04:55,759 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:04:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 13:04:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:04:55,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:55,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:55,787 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:55,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:55,794 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-23 13:04:55,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:55,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:55,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:55,934 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-23 13:04:55,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-23 13:04:55,939 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #37#return; {21#true} is VALID [2018-11-23 13:04:55,939 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret2 := main(); {21#true} is VALID [2018-11-23 13:04:55,940 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {21#true} is VALID [2018-11-23 13:04:55,953 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-23 13:04:55,954 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22#false} is VALID [2018-11-23 13:04:55,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-23 13:04:55,955 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2018-11-23 13:04:55,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-23 13:04:55,958 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:04:55,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:55,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:04:55,967 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:04:55,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:55,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:04:56,028 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:04:56,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:04:56,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:04:56,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:56,039 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 13:04:56,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:56,122 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 13:04:56,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:04:56,122 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:04:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-23 13:04:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2018-11-23 13:04:56,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 33 transitions. [2018-11-23 13:04:56,356 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:04:56,371 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:04:56,371 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:04:56,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:56,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:04:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:04:56,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:56,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:04:56,495 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:04:56,495 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:04:56,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:56,498 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 13:04:56,499 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:04:56,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:56,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:56,500 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:04:56,500 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:04:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:56,503 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-23 13:04:56,503 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:04:56,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:56,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:56,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:56,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:04:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-23 13:04:56,508 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-11-23 13:04:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:56,508 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-23 13:04:56,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:04:56,509 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:04:56,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:04:56,509 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:56,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:56,510 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:56,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:56,510 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2018-11-23 13:04:56,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:56,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:56,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:56,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:56,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:56,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {106#true} is VALID [2018-11-23 13:04:56,826 INFO L273 TraceCheckUtils]: 1: Hoare triple {106#true} assume true; {106#true} is VALID [2018-11-23 13:04:56,826 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} #37#return; {106#true} is VALID [2018-11-23 13:04:56,826 INFO L256 TraceCheckUtils]: 3: Hoare triple {106#true} call #t~ret2 := main(); {106#true} is VALID [2018-11-23 13:04:56,827 INFO L273 TraceCheckUtils]: 4: Hoare triple {106#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:56,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {107#false} is VALID [2018-11-23 13:04:56,829 INFO L256 TraceCheckUtils]: 6: Hoare triple {107#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {107#false} is VALID [2018-11-23 13:04:56,829 INFO L273 TraceCheckUtils]: 7: Hoare triple {107#false} ~cond := #in~cond; {107#false} is VALID [2018-11-23 13:04:56,830 INFO L273 TraceCheckUtils]: 8: Hoare triple {107#false} assume 0 == ~cond; {107#false} is VALID [2018-11-23 13:04:56,830 INFO L273 TraceCheckUtils]: 9: Hoare triple {107#false} assume !false; {107#false} is VALID [2018-11-23 13:04:56,831 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:04:56,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:56,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:04:56,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:04:56,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:56,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:04:56,869 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:04:56,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:04:56,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:04:56,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:56,870 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2018-11-23 13:04:57,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,016 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 13:04:57,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:04:57,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:04:57,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-11-23 13:04:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2018-11-23 13:04:57,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2018-11-23 13:04:57,158 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:04:57,160 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:04:57,160 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:04:57,161 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:04:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:04:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-23 13:04:57,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:57,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 13 states. [2018-11-23 13:04:57,194 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 13 states. [2018-11-23 13:04:57,194 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 13 states. [2018-11-23 13:04:57,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,196 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 13:04:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 13:04:57,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:57,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:57,197 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 14 states. [2018-11-23 13:04:57,197 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 14 states. [2018-11-23 13:04:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,199 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-23 13:04:57,199 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-11-23 13:04:57,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:57,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:57,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:57,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:04:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 13:04:57,202 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 13:04:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:57,203 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 13:04:57,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:04:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:04:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:04:57,204 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:57,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:57,204 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:57,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:57,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2018-11-23 13:04:57,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:57,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:57,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:57,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:57,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:57,503 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-23 13:04:57,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-23 13:04:57,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-23 13:04:57,536 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #37#return; {189#true} is VALID [2018-11-23 13:04:57,536 INFO L256 TraceCheckUtils]: 3: Hoare triple {189#true} call #t~ret2 := main(); {189#true} is VALID [2018-11-23 13:04:57,542 INFO L273 TraceCheckUtils]: 4: Hoare triple {189#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {191#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:57,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {191#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {191#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:57,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {191#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {192#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:04:57,545 INFO L273 TraceCheckUtils]: 7: Hoare triple {192#(and (<= main_~x~0 1) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {190#false} is VALID [2018-11-23 13:04:57,545 INFO L256 TraceCheckUtils]: 8: Hoare triple {190#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {190#false} is VALID [2018-11-23 13:04:57,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {190#false} ~cond := #in~cond; {190#false} is VALID [2018-11-23 13:04:57,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {190#false} assume 0 == ~cond; {190#false} is VALID [2018-11-23 13:04:57,546 INFO L273 TraceCheckUtils]: 11: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-23 13:04:57,549 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:04:57,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:57,549 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:04:57,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:57,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:58,151 INFO L256 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2018-11-23 13:04:58,152 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2018-11-23 13:04:58,152 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #37#return; {189#true} is VALID [2018-11-23 13:04:58,152 INFO L256 TraceCheckUtils]: 3: Hoare triple {189#true} call #t~ret2 := main(); {189#true} is VALID [2018-11-23 13:04:58,165 INFO L273 TraceCheckUtils]: 4: Hoare triple {189#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {191#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:58,179 INFO L273 TraceCheckUtils]: 5: Hoare triple {191#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {191#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:58,192 INFO L273 TraceCheckUtils]: 6: Hoare triple {191#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {214#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:58,205 INFO L273 TraceCheckUtils]: 7: Hoare triple {214#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {190#false} is VALID [2018-11-23 13:04:58,206 INFO L256 TraceCheckUtils]: 8: Hoare triple {190#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {190#false} is VALID [2018-11-23 13:04:58,206 INFO L273 TraceCheckUtils]: 9: Hoare triple {190#false} ~cond := #in~cond; {190#false} is VALID [2018-11-23 13:04:58,207 INFO L273 TraceCheckUtils]: 10: Hoare triple {190#false} assume 0 == ~cond; {190#false} is VALID [2018-11-23 13:04:58,207 INFO L273 TraceCheckUtils]: 11: Hoare triple {190#false} assume !false; {190#false} is VALID [2018-11-23 13:04:58,208 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:04:58,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:58,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:04:58,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:04:58,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:58,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:04:58,347 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:04:58,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:04:58,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:04:58,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:58,348 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2018-11-23 13:04:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:58,576 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 13:04:58,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:04:58,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:04:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:58,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-23 13:04:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:58,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-23 13:04:58,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2018-11-23 13:04:58,621 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:04:58,623 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:04:58,623 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:04:58,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:58,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:04:58,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 13:04:58,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:58,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-23 13:04:58,721 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-23 13:04:58,721 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-23 13:04:58,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:58,725 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-11-23 13:04:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2018-11-23 13:04:58,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:58,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:58,727 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-23 13:04:58,727 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-23 13:04:58,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:58,733 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-11-23 13:04:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2018-11-23 13:04:58,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:58,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:58,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:58,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:04:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-23 13:04:58,743 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2018-11-23 13:04:58,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:58,743 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-23 13:04:58,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:04:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 13:04:58,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:04:58,744 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:58,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:58,747 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:58,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:58,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1025597645, now seen corresponding path program 1 times [2018-11-23 13:04:58,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:58,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:58,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:58,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:58,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:58,964 INFO L256 TraceCheckUtils]: 0: Hoare triple {317#true} call ULTIMATE.init(); {317#true} is VALID [2018-11-23 13:04:58,964 INFO L273 TraceCheckUtils]: 1: Hoare triple {317#true} assume true; {317#true} is VALID [2018-11-23 13:04:58,964 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {317#true} {317#true} #37#return; {317#true} is VALID [2018-11-23 13:04:58,965 INFO L256 TraceCheckUtils]: 3: Hoare triple {317#true} call #t~ret2 := main(); {317#true} is VALID [2018-11-23 13:04:58,966 INFO L273 TraceCheckUtils]: 4: Hoare triple {317#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {319#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:58,968 INFO L273 TraceCheckUtils]: 5: Hoare triple {319#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {319#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:58,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {319#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {320#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:04:58,974 INFO L273 TraceCheckUtils]: 7: Hoare triple {320#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {318#false} is VALID [2018-11-23 13:04:58,974 INFO L256 TraceCheckUtils]: 8: Hoare triple {318#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {318#false} is VALID [2018-11-23 13:04:58,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {318#false} ~cond := #in~cond; {318#false} is VALID [2018-11-23 13:04:58,975 INFO L273 TraceCheckUtils]: 10: Hoare triple {318#false} assume 0 == ~cond; {318#false} is VALID [2018-11-23 13:04:58,975 INFO L273 TraceCheckUtils]: 11: Hoare triple {318#false} assume !false; {318#false} is VALID [2018-11-23 13:04:58,976 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:04:58,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:58,976 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:04:58,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:59,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:59,170 INFO L256 TraceCheckUtils]: 0: Hoare triple {317#true} call ULTIMATE.init(); {317#true} is VALID [2018-11-23 13:04:59,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {317#true} assume true; {317#true} is VALID [2018-11-23 13:04:59,171 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {317#true} {317#true} #37#return; {317#true} is VALID [2018-11-23 13:04:59,171 INFO L256 TraceCheckUtils]: 3: Hoare triple {317#true} call #t~ret2 := main(); {317#true} is VALID [2018-11-23 13:04:59,175 INFO L273 TraceCheckUtils]: 4: Hoare triple {317#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {319#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:59,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {319#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {319#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:59,178 INFO L273 TraceCheckUtils]: 6: Hoare triple {319#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {342#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:59,183 INFO L273 TraceCheckUtils]: 7: Hoare triple {342#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {318#false} is VALID [2018-11-23 13:04:59,183 INFO L256 TraceCheckUtils]: 8: Hoare triple {318#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {318#false} is VALID [2018-11-23 13:04:59,183 INFO L273 TraceCheckUtils]: 9: Hoare triple {318#false} ~cond := #in~cond; {318#false} is VALID [2018-11-23 13:04:59,183 INFO L273 TraceCheckUtils]: 10: Hoare triple {318#false} assume 0 == ~cond; {318#false} is VALID [2018-11-23 13:04:59,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {318#false} assume !false; {318#false} is VALID [2018-11-23 13:04:59,184 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:04:59,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:59,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:04:59,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:04:59,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:59,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:04:59,220 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:04:59,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:04:59,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:04:59,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:59,221 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 5 states. [2018-11-23 13:04:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,377 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 13:04:59,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:04:59,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:04:59,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-23 13:04:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:59,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-23 13:04:59,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2018-11-23 13:04:59,445 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:04:59,446 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:04:59,446 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:04:59,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:59,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:04:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-11-23 13:04:59,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:59,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 15 states. [2018-11-23 13:04:59,471 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 15 states. [2018-11-23 13:04:59,471 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 15 states. [2018-11-23 13:04:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,473 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2018-11-23 13:04:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2018-11-23 13:04:59,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:59,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:59,474 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 18 states. [2018-11-23 13:04:59,474 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 18 states. [2018-11-23 13:04:59,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:59,476 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2018-11-23 13:04:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2018-11-23 13:04:59,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:59,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:59,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:59,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:04:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-11-23 13:04:59,479 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2018-11-23 13:04:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:59,479 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-23 13:04:59,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:04:59,480 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 13:04:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:04:59,480 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:59,481 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:59,481 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:59,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:59,481 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2018-11-23 13:04:59,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:59,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:59,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:59,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:59,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:59,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {452#true} call ULTIMATE.init(); {452#true} is VALID [2018-11-23 13:04:59,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {452#true} assume true; {452#true} is VALID [2018-11-23 13:04:59,738 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {452#true} {452#true} #37#return; {452#true} is VALID [2018-11-23 13:04:59,738 INFO L256 TraceCheckUtils]: 3: Hoare triple {452#true} call #t~ret2 := main(); {452#true} is VALID [2018-11-23 13:04:59,739 INFO L273 TraceCheckUtils]: 4: Hoare triple {452#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {454#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:59,740 INFO L273 TraceCheckUtils]: 5: Hoare triple {454#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {454#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:59,741 INFO L273 TraceCheckUtils]: 6: Hoare triple {454#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {455#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:59,742 INFO L273 TraceCheckUtils]: 7: Hoare triple {455#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {455#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:59,743 INFO L273 TraceCheckUtils]: 8: Hoare triple {455#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {456#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:04:59,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {456#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {453#false} is VALID [2018-11-23 13:04:59,745 INFO L256 TraceCheckUtils]: 10: Hoare triple {453#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {453#false} is VALID [2018-11-23 13:04:59,745 INFO L273 TraceCheckUtils]: 11: Hoare triple {453#false} ~cond := #in~cond; {453#false} is VALID [2018-11-23 13:04:59,746 INFO L273 TraceCheckUtils]: 12: Hoare triple {453#false} assume 0 == ~cond; {453#false} is VALID [2018-11-23 13:04:59,747 INFO L273 TraceCheckUtils]: 13: Hoare triple {453#false} assume !false; {453#false} is VALID [2018-11-23 13:04:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:59,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:59,749 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:04:59,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:04:59,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:04:59,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:59,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:59,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {452#true} call ULTIMATE.init(); {452#true} is VALID [2018-11-23 13:04:59,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {452#true} assume true; {452#true} is VALID [2018-11-23 13:04:59,874 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {452#true} {452#true} #37#return; {452#true} is VALID [2018-11-23 13:04:59,874 INFO L256 TraceCheckUtils]: 3: Hoare triple {452#true} call #t~ret2 := main(); {452#true} is VALID [2018-11-23 13:04:59,875 INFO L273 TraceCheckUtils]: 4: Hoare triple {452#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {454#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:59,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {454#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {454#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:04:59,876 INFO L273 TraceCheckUtils]: 6: Hoare triple {454#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {455#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:59,877 INFO L273 TraceCheckUtils]: 7: Hoare triple {455#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {455#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:04:59,878 INFO L273 TraceCheckUtils]: 8: Hoare triple {455#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:04:59,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {484#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {453#false} is VALID [2018-11-23 13:04:59,879 INFO L256 TraceCheckUtils]: 10: Hoare triple {453#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {453#false} is VALID [2018-11-23 13:04:59,879 INFO L273 TraceCheckUtils]: 11: Hoare triple {453#false} ~cond := #in~cond; {453#false} is VALID [2018-11-23 13:04:59,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {453#false} assume 0 == ~cond; {453#false} is VALID [2018-11-23 13:04:59,880 INFO L273 TraceCheckUtils]: 13: Hoare triple {453#false} assume !false; {453#false} is VALID [2018-11-23 13:04:59,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:59,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:59,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:04:59,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:04:59,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:59,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:04:59,920 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:04:59,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:04:59,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:04:59,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:04:59,922 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 6 states. [2018-11-23 13:05:00,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:00,306 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 13:05:00,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:05:00,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:05:00,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:05:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-23 13:05:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:05:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-23 13:05:00,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2018-11-23 13:05:00,363 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:05:00,364 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:05:00,364 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 13:05:00,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:05:00,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 13:05:00,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-23 13:05:00,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:00,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 17 states. [2018-11-23 13:05:00,385 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 17 states. [2018-11-23 13:05:00,386 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 17 states. [2018-11-23 13:05:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:00,388 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-11-23 13:05:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-11-23 13:05:00,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:00,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:00,389 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 19 states. [2018-11-23 13:05:00,389 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 19 states. [2018-11-23 13:05:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:00,391 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-11-23 13:05:00,391 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-11-23 13:05:00,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:00,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:00,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:00,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:05:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-11-23 13:05:00,393 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2018-11-23 13:05:00,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:00,394 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 13:05:00,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:05:00,394 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2018-11-23 13:05:00,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:05:00,394 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:00,395 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:00,395 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:00,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:00,395 INFO L82 PathProgramCache]: Analyzing trace with hash -109889104, now seen corresponding path program 1 times [2018-11-23 13:05:00,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:00,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:00,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:00,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:00,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:00,559 INFO L256 TraceCheckUtils]: 0: Hoare triple {601#true} call ULTIMATE.init(); {601#true} is VALID [2018-11-23 13:05:00,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {601#true} assume true; {601#true} is VALID [2018-11-23 13:05:00,560 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {601#true} {601#true} #37#return; {601#true} is VALID [2018-11-23 13:05:00,560 INFO L256 TraceCheckUtils]: 3: Hoare triple {601#true} call #t~ret2 := main(); {601#true} is VALID [2018-11-23 13:05:00,561 INFO L273 TraceCheckUtils]: 4: Hoare triple {601#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {603#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:00,562 INFO L273 TraceCheckUtils]: 5: Hoare triple {603#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {603#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:00,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {603#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {604#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:00,563 INFO L273 TraceCheckUtils]: 7: Hoare triple {604#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {604#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:00,565 INFO L273 TraceCheckUtils]: 8: Hoare triple {604#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {605#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:00,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {605#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {602#false} is VALID [2018-11-23 13:05:00,572 INFO L256 TraceCheckUtils]: 10: Hoare triple {602#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {602#false} is VALID [2018-11-23 13:05:00,572 INFO L273 TraceCheckUtils]: 11: Hoare triple {602#false} ~cond := #in~cond; {602#false} is VALID [2018-11-23 13:05:00,573 INFO L273 TraceCheckUtils]: 12: Hoare triple {602#false} assume 0 == ~cond; {602#false} is VALID [2018-11-23 13:05:00,573 INFO L273 TraceCheckUtils]: 13: Hoare triple {602#false} assume !false; {602#false} is VALID [2018-11-23 13:05:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:00,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:00,574 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:05:00,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:00,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:00,887 INFO L256 TraceCheckUtils]: 0: Hoare triple {601#true} call ULTIMATE.init(); {601#true} is VALID [2018-11-23 13:05:00,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {601#true} assume true; {601#true} is VALID [2018-11-23 13:05:00,888 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {601#true} {601#true} #37#return; {601#true} is VALID [2018-11-23 13:05:00,888 INFO L256 TraceCheckUtils]: 3: Hoare triple {601#true} call #t~ret2 := main(); {601#true} is VALID [2018-11-23 13:05:00,888 INFO L273 TraceCheckUtils]: 4: Hoare triple {601#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {601#true} is VALID [2018-11-23 13:05:00,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {601#true} assume !!(~x~0 % 4294967296 < 99); {601#true} is VALID [2018-11-23 13:05:00,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {601#true} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {627#(<= (mod main_~y~0 2) 0)} is VALID [2018-11-23 13:05:00,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {627#(<= (mod main_~y~0 2) 0)} assume !!(~x~0 % 4294967296 < 99); {627#(<= (mod main_~y~0 2) 0)} is VALID [2018-11-23 13:05:00,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {627#(<= (mod main_~y~0 2) 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {602#false} is VALID [2018-11-23 13:05:00,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {602#false} assume !(~x~0 % 4294967296 < 99); {602#false} is VALID [2018-11-23 13:05:00,895 INFO L256 TraceCheckUtils]: 10: Hoare triple {602#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {602#false} is VALID [2018-11-23 13:05:00,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {602#false} ~cond := #in~cond; {602#false} is VALID [2018-11-23 13:05:00,896 INFO L273 TraceCheckUtils]: 12: Hoare triple {602#false} assume 0 == ~cond; {602#false} is VALID [2018-11-23 13:05:00,896 INFO L273 TraceCheckUtils]: 13: Hoare triple {602#false} assume !false; {602#false} is VALID [2018-11-23 13:05:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:00,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:05:00,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-23 13:05:00,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:05:00,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:00,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:05:00,979 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:05:00,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:05:00,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:05:00,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:05:00,980 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 6 states. [2018-11-23 13:05:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:01,204 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2018-11-23 13:05:01,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:05:01,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:05:01,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:01,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:05:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-11-23 13:05:01,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:05:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-11-23 13:05:01,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2018-11-23 13:05:01,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:01,265 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:05:01,266 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 13:05:01,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:05:01,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 13:05:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-11-23 13:05:01,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:01,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 20 states. [2018-11-23 13:05:01,363 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 20 states. [2018-11-23 13:05:01,363 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 20 states. [2018-11-23 13:05:01,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:01,366 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 13:05:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 13:05:01,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:01,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:01,367 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 23 states. [2018-11-23 13:05:01,367 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 23 states. [2018-11-23 13:05:01,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:01,369 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-11-23 13:05:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-23 13:05:01,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:01,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:01,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:01,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:05:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-23 13:05:01,372 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2018-11-23 13:05:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:01,372 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 13:05:01,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:05:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 13:05:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:05:01,373 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:01,374 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:01,374 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:01,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:01,374 INFO L82 PathProgramCache]: Analyzing trace with hash -976494032, now seen corresponding path program 2 times [2018-11-23 13:05:01,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:01,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:01,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:01,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:01,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:01,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {778#true} call ULTIMATE.init(); {778#true} is VALID [2018-11-23 13:05:01,718 INFO L273 TraceCheckUtils]: 1: Hoare triple {778#true} assume true; {778#true} is VALID [2018-11-23 13:05:01,718 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {778#true} {778#true} #37#return; {778#true} is VALID [2018-11-23 13:05:01,719 INFO L256 TraceCheckUtils]: 3: Hoare triple {778#true} call #t~ret2 := main(); {778#true} is VALID [2018-11-23 13:05:01,722 INFO L273 TraceCheckUtils]: 4: Hoare triple {778#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {780#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:01,723 INFO L273 TraceCheckUtils]: 5: Hoare triple {780#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {780#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:01,724 INFO L273 TraceCheckUtils]: 6: Hoare triple {780#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {781#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:01,725 INFO L273 TraceCheckUtils]: 7: Hoare triple {781#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {781#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:01,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {781#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {782#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:01,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {782#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {779#false} is VALID [2018-11-23 13:05:01,727 INFO L256 TraceCheckUtils]: 10: Hoare triple {779#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {779#false} is VALID [2018-11-23 13:05:01,728 INFO L273 TraceCheckUtils]: 11: Hoare triple {779#false} ~cond := #in~cond; {779#false} is VALID [2018-11-23 13:05:01,728 INFO L273 TraceCheckUtils]: 12: Hoare triple {779#false} assume 0 == ~cond; {779#false} is VALID [2018-11-23 13:05:01,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {779#false} assume !false; {779#false} is VALID [2018-11-23 13:05:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:01,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:01,730 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:05:01,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:01,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:01,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:01,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:01,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {778#true} call ULTIMATE.init(); {778#true} is VALID [2018-11-23 13:05:01,835 INFO L273 TraceCheckUtils]: 1: Hoare triple {778#true} assume true; {778#true} is VALID [2018-11-23 13:05:01,836 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {778#true} {778#true} #37#return; {778#true} is VALID [2018-11-23 13:05:01,836 INFO L256 TraceCheckUtils]: 3: Hoare triple {778#true} call #t~ret2 := main(); {778#true} is VALID [2018-11-23 13:05:01,836 INFO L273 TraceCheckUtils]: 4: Hoare triple {778#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {778#true} is VALID [2018-11-23 13:05:01,837 INFO L273 TraceCheckUtils]: 5: Hoare triple {778#true} assume !!(~x~0 % 4294967296 < 99); {778#true} is VALID [2018-11-23 13:05:01,837 INFO L273 TraceCheckUtils]: 6: Hoare triple {778#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {804#(not (= (mod main_~y~0 2) 0))} is VALID [2018-11-23 13:05:01,838 INFO L273 TraceCheckUtils]: 7: Hoare triple {804#(not (= (mod main_~y~0 2) 0))} assume !!(~x~0 % 4294967296 < 99); {804#(not (= (mod main_~y~0 2) 0))} is VALID [2018-11-23 13:05:01,839 INFO L273 TraceCheckUtils]: 8: Hoare triple {804#(not (= (mod main_~y~0 2) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {779#false} is VALID [2018-11-23 13:05:01,839 INFO L273 TraceCheckUtils]: 9: Hoare triple {779#false} assume !(~x~0 % 4294967296 < 99); {779#false} is VALID [2018-11-23 13:05:01,839 INFO L256 TraceCheckUtils]: 10: Hoare triple {779#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {779#false} is VALID [2018-11-23 13:05:01,839 INFO L273 TraceCheckUtils]: 11: Hoare triple {779#false} ~cond := #in~cond; {779#false} is VALID [2018-11-23 13:05:01,840 INFO L273 TraceCheckUtils]: 12: Hoare triple {779#false} assume 0 == ~cond; {779#false} is VALID [2018-11-23 13:05:01,840 INFO L273 TraceCheckUtils]: 13: Hoare triple {779#false} assume !false; {779#false} is VALID [2018-11-23 13:05:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:01,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:05:01,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-23 13:05:01,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:05:01,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:01,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:05:01,895 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:05:01,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:05:01,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:05:01,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:05:01,896 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 6 states. [2018-11-23 13:05:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:02,125 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 13:05:02,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:05:02,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:05:02,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:05:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2018-11-23 13:05:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:05:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2018-11-23 13:05:02,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2018-11-23 13:05:02,177 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:05:02,178 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:05:02,179 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:05:02,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:05:02,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:05:02,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-23 13:05:02,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:02,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 20 states. [2018-11-23 13:05:02,205 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 20 states. [2018-11-23 13:05:02,206 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 20 states. [2018-11-23 13:05:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:02,208 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:05:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:05:02,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:02,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:02,209 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states. [2018-11-23 13:05:02,209 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states. [2018-11-23 13:05:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:02,211 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 13:05:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:05:02,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:02,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:02,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:02,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:05:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 13:05:02,213 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 14 [2018-11-23 13:05:02,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:02,214 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 13:05:02,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:05:02,214 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 13:05:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:05:02,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:02,215 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:02,215 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:02,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:02,216 INFO L82 PathProgramCache]: Analyzing trace with hash -919235730, now seen corresponding path program 2 times [2018-11-23 13:05:02,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:02,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:02,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:02,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:02,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:03,100 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-11-23 13:05:03,111 INFO L256 TraceCheckUtils]: 0: Hoare triple {949#true} call ULTIMATE.init(); {949#true} is VALID [2018-11-23 13:05:03,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {949#true} assume true; {949#true} is VALID [2018-11-23 13:05:03,111 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {949#true} {949#true} #37#return; {949#true} is VALID [2018-11-23 13:05:03,111 INFO L256 TraceCheckUtils]: 3: Hoare triple {949#true} call #t~ret2 := main(); {949#true} is VALID [2018-11-23 13:05:03,112 INFO L273 TraceCheckUtils]: 4: Hoare triple {949#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {951#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:03,112 INFO L273 TraceCheckUtils]: 5: Hoare triple {951#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {951#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:03,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {951#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {952#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:03,128 INFO L273 TraceCheckUtils]: 7: Hoare triple {952#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {952#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:03,141 INFO L273 TraceCheckUtils]: 8: Hoare triple {952#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {953#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:03,142 INFO L273 TraceCheckUtils]: 9: Hoare triple {953#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {950#false} is VALID [2018-11-23 13:05:03,142 INFO L256 TraceCheckUtils]: 10: Hoare triple {950#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {950#false} is VALID [2018-11-23 13:05:03,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {950#false} ~cond := #in~cond; {950#false} is VALID [2018-11-23 13:05:03,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {950#false} assume 0 == ~cond; {950#false} is VALID [2018-11-23 13:05:03,143 INFO L273 TraceCheckUtils]: 13: Hoare triple {950#false} assume !false; {950#false} is VALID [2018-11-23 13:05:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:03,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:03,144 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:05:03,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:03,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:03,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:03,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:03,228 INFO L256 TraceCheckUtils]: 0: Hoare triple {949#true} call ULTIMATE.init(); {949#true} is VALID [2018-11-23 13:05:03,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {949#true} assume true; {949#true} is VALID [2018-11-23 13:05:03,229 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {949#true} {949#true} #37#return; {949#true} is VALID [2018-11-23 13:05:03,229 INFO L256 TraceCheckUtils]: 3: Hoare triple {949#true} call #t~ret2 := main(); {949#true} is VALID [2018-11-23 13:05:03,230 INFO L273 TraceCheckUtils]: 4: Hoare triple {949#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {951#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:03,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {951#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {951#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:03,232 INFO L273 TraceCheckUtils]: 6: Hoare triple {951#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {952#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:03,233 INFO L273 TraceCheckUtils]: 7: Hoare triple {952#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {952#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:03,234 INFO L273 TraceCheckUtils]: 8: Hoare triple {952#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {981#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:03,236 INFO L273 TraceCheckUtils]: 9: Hoare triple {981#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 99); {950#false} is VALID [2018-11-23 13:05:03,236 INFO L256 TraceCheckUtils]: 10: Hoare triple {950#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {950#false} is VALID [2018-11-23 13:05:03,236 INFO L273 TraceCheckUtils]: 11: Hoare triple {950#false} ~cond := #in~cond; {950#false} is VALID [2018-11-23 13:05:03,237 INFO L273 TraceCheckUtils]: 12: Hoare triple {950#false} assume 0 == ~cond; {950#false} is VALID [2018-11-23 13:05:03,237 INFO L273 TraceCheckUtils]: 13: Hoare triple {950#false} assume !false; {950#false} is VALID [2018-11-23 13:05:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:03,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:03,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:05:03,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:05:03,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:03,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:05:03,285 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:05:03,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:05:03,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:05:03,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:05:03,286 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2018-11-23 13:05:03,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:03,496 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-11-23 13:05:03,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:05:03,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-23 13:05:03,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:03,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:05:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-23 13:05:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:05:03,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-23 13:05:03,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2018-11-23 13:05:03,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:05:03,536 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:05:03,537 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 13:05:03,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:05:03,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 13:05:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-23 13:05:03,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:03,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2018-11-23 13:05:03,562 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2018-11-23 13:05:03,563 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2018-11-23 13:05:03,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:03,564 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 13:05:03,564 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 13:05:03,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:03,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:03,565 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2018-11-23 13:05:03,566 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2018-11-23 13:05:03,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:03,567 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 13:05:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 13:05:03,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:03,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:03,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:03,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:03,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:05:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 13:05:03,570 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2018-11-23 13:05:03,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:03,570 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 13:05:03,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:05:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 13:05:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:05:03,571 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:03,571 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:03,571 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:03,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:03,572 INFO L82 PathProgramCache]: Analyzing trace with hash -639535185, now seen corresponding path program 3 times [2018-11-23 13:05:03,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:03,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:03,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:03,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:03,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:03,849 INFO L256 TraceCheckUtils]: 0: Hoare triple {1120#true} call ULTIMATE.init(); {1120#true} is VALID [2018-11-23 13:05:03,850 INFO L273 TraceCheckUtils]: 1: Hoare triple {1120#true} assume true; {1120#true} is VALID [2018-11-23 13:05:03,850 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1120#true} {1120#true} #37#return; {1120#true} is VALID [2018-11-23 13:05:03,850 INFO L256 TraceCheckUtils]: 3: Hoare triple {1120#true} call #t~ret2 := main(); {1120#true} is VALID [2018-11-23 13:05:03,850 INFO L273 TraceCheckUtils]: 4: Hoare triple {1120#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1122#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:03,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {1122#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1122#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:03,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {1122#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1123#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:03,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {1123#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1123#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:03,855 INFO L273 TraceCheckUtils]: 8: Hoare triple {1123#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1124#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:03,855 INFO L273 TraceCheckUtils]: 9: Hoare triple {1124#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1124#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:03,856 INFO L273 TraceCheckUtils]: 10: Hoare triple {1124#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1125#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:03,857 INFO L273 TraceCheckUtils]: 11: Hoare triple {1125#(and (<= main_~x~0 3) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {1121#false} is VALID [2018-11-23 13:05:03,857 INFO L256 TraceCheckUtils]: 12: Hoare triple {1121#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1121#false} is VALID [2018-11-23 13:05:03,858 INFO L273 TraceCheckUtils]: 13: Hoare triple {1121#false} ~cond := #in~cond; {1121#false} is VALID [2018-11-23 13:05:03,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {1121#false} assume 0 == ~cond; {1121#false} is VALID [2018-11-23 13:05:03,858 INFO L273 TraceCheckUtils]: 15: Hoare triple {1121#false} assume !false; {1121#false} is VALID [2018-11-23 13:05:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:03,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:03,860 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:05:03,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:03,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:05:03,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:03,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:03,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {1120#true} call ULTIMATE.init(); {1120#true} is VALID [2018-11-23 13:05:03,968 INFO L273 TraceCheckUtils]: 1: Hoare triple {1120#true} assume true; {1120#true} is VALID [2018-11-23 13:05:03,968 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1120#true} {1120#true} #37#return; {1120#true} is VALID [2018-11-23 13:05:03,968 INFO L256 TraceCheckUtils]: 3: Hoare triple {1120#true} call #t~ret2 := main(); {1120#true} is VALID [2018-11-23 13:05:03,969 INFO L273 TraceCheckUtils]: 4: Hoare triple {1120#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1122#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:03,970 INFO L273 TraceCheckUtils]: 5: Hoare triple {1122#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1122#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:03,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {1122#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1123#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:03,979 INFO L273 TraceCheckUtils]: 7: Hoare triple {1123#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1123#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:03,980 INFO L273 TraceCheckUtils]: 8: Hoare triple {1123#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1124#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:03,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {1124#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1124#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:03,981 INFO L273 TraceCheckUtils]: 10: Hoare triple {1124#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1159#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:03,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {1159#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {1121#false} is VALID [2018-11-23 13:05:03,983 INFO L256 TraceCheckUtils]: 12: Hoare triple {1121#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1121#false} is VALID [2018-11-23 13:05:03,984 INFO L273 TraceCheckUtils]: 13: Hoare triple {1121#false} ~cond := #in~cond; {1121#false} is VALID [2018-11-23 13:05:03,984 INFO L273 TraceCheckUtils]: 14: Hoare triple {1121#false} assume 0 == ~cond; {1121#false} is VALID [2018-11-23 13:05:03,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {1121#false} assume !false; {1121#false} is VALID [2018-11-23 13:05:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:04,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:04,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:05:04,007 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:05:04,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:04,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:05:04,067 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:05:04,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:05:04,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:05:04,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:05:04,068 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 7 states. [2018-11-23 13:05:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:04,289 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-23 13:05:04,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:05:04,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:05:04,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:05:04,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2018-11-23 13:05:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:05:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2018-11-23 13:05:04,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2018-11-23 13:05:04,354 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:05:04,356 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:05:04,356 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:05:04,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 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:05:04,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:05:04,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 13:05:04,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:04,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 24 states. [2018-11-23 13:05:04,389 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 24 states. [2018-11-23 13:05:04,389 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 24 states. [2018-11-23 13:05:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:04,392 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 13:05:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 13:05:04,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:04,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:04,393 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states. [2018-11-23 13:05:04,393 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states. [2018-11-23 13:05:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:04,394 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 13:05:04,394 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 13:05:04,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:04,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:04,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:04,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:05:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 13:05:04,397 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 16 [2018-11-23 13:05:04,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:04,397 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 13:05:04,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:05:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 13:05:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:05:04,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:04,398 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:04,398 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:04,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:04,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1784650519, now seen corresponding path program 3 times [2018-11-23 13:05:04,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:04,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:04,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:04,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:04,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:04,595 INFO L256 TraceCheckUtils]: 0: Hoare triple {1308#true} call ULTIMATE.init(); {1308#true} is VALID [2018-11-23 13:05:04,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {1308#true} assume true; {1308#true} is VALID [2018-11-23 13:05:04,596 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1308#true} {1308#true} #37#return; {1308#true} is VALID [2018-11-23 13:05:04,596 INFO L256 TraceCheckUtils]: 3: Hoare triple {1308#true} call #t~ret2 := main(); {1308#true} is VALID [2018-11-23 13:05:04,597 INFO L273 TraceCheckUtils]: 4: Hoare triple {1308#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1310#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:04,598 INFO L273 TraceCheckUtils]: 5: Hoare triple {1310#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1310#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:04,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {1310#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1311#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:04,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {1311#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1311#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:04,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {1311#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1312#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:04,601 INFO L273 TraceCheckUtils]: 9: Hoare triple {1312#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {1312#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:04,602 INFO L273 TraceCheckUtils]: 10: Hoare triple {1312#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1313#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:04,603 INFO L273 TraceCheckUtils]: 11: Hoare triple {1313#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {1309#false} is VALID [2018-11-23 13:05:04,604 INFO L256 TraceCheckUtils]: 12: Hoare triple {1309#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1309#false} is VALID [2018-11-23 13:05:04,604 INFO L273 TraceCheckUtils]: 13: Hoare triple {1309#false} ~cond := #in~cond; {1309#false} is VALID [2018-11-23 13:05:04,604 INFO L273 TraceCheckUtils]: 14: Hoare triple {1309#false} assume 0 == ~cond; {1309#false} is VALID [2018-11-23 13:05:04,605 INFO L273 TraceCheckUtils]: 15: Hoare triple {1309#false} assume !false; {1309#false} is VALID [2018-11-23 13:05:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:04,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:04,606 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:05:04,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:04,631 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:05:04,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:04,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:04,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {1308#true} call ULTIMATE.init(); {1308#true} is VALID [2018-11-23 13:05:04,754 INFO L273 TraceCheckUtils]: 1: Hoare triple {1308#true} assume true; {1308#true} is VALID [2018-11-23 13:05:04,754 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1308#true} {1308#true} #37#return; {1308#true} is VALID [2018-11-23 13:05:04,754 INFO L256 TraceCheckUtils]: 3: Hoare triple {1308#true} call #t~ret2 := main(); {1308#true} is VALID [2018-11-23 13:05:04,755 INFO L273 TraceCheckUtils]: 4: Hoare triple {1308#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1310#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:04,757 INFO L273 TraceCheckUtils]: 5: Hoare triple {1310#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1310#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:04,758 INFO L273 TraceCheckUtils]: 6: Hoare triple {1310#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1311#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:04,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {1311#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1311#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:04,760 INFO L273 TraceCheckUtils]: 8: Hoare triple {1311#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1312#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:04,760 INFO L273 TraceCheckUtils]: 9: Hoare triple {1312#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {1312#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:04,761 INFO L273 TraceCheckUtils]: 10: Hoare triple {1312#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1347#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:04,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {1347#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {1309#false} is VALID [2018-11-23 13:05:04,763 INFO L256 TraceCheckUtils]: 12: Hoare triple {1309#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1309#false} is VALID [2018-11-23 13:05:04,763 INFO L273 TraceCheckUtils]: 13: Hoare triple {1309#false} ~cond := #in~cond; {1309#false} is VALID [2018-11-23 13:05:04,763 INFO L273 TraceCheckUtils]: 14: Hoare triple {1309#false} assume 0 == ~cond; {1309#false} is VALID [2018-11-23 13:05:04,764 INFO L273 TraceCheckUtils]: 15: Hoare triple {1309#false} assume !false; {1309#false} is VALID [2018-11-23 13:05:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:04,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:04,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:05:04,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:05:04,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:04,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:05:04,805 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:05:04,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:05:04,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:05:04,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:05:04,807 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2018-11-23 13:05:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:05,053 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 13:05:05,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:05:05,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 13:05:05,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:05:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-11-23 13:05:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:05:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-11-23 13:05:05,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2018-11-23 13:05:05,133 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:05:05,135 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:05:05,135 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 13:05:05,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:05:05,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 13:05:05,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 13:05:05,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:05,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 13:05:05,182 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 13:05:05,182 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 13:05:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:05,183 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 13:05:05,184 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 13:05:05,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:05,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:05,184 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 13:05:05,185 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 13:05:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:05,187 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 13:05:05,187 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 13:05:05,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:05,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:05,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:05,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:05,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:05:05,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 13:05:05,189 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2018-11-23 13:05:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:05,189 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 13:05:05,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:05:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 13:05:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:05:05,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:05,190 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:05,190 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:05,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:05,190 INFO L82 PathProgramCache]: Analyzing trace with hash 662342572, now seen corresponding path program 4 times [2018-11-23 13:05:05,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:05,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:05,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:05,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:05,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:05,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {1506#true} call ULTIMATE.init(); {1506#true} is VALID [2018-11-23 13:05:05,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {1506#true} assume true; {1506#true} is VALID [2018-11-23 13:05:05,542 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1506#true} {1506#true} #37#return; {1506#true} is VALID [2018-11-23 13:05:05,542 INFO L256 TraceCheckUtils]: 3: Hoare triple {1506#true} call #t~ret2 := main(); {1506#true} is VALID [2018-11-23 13:05:05,543 INFO L273 TraceCheckUtils]: 4: Hoare triple {1506#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1508#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:05,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {1508#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1508#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:05,553 INFO L273 TraceCheckUtils]: 6: Hoare triple {1508#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1509#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:05,554 INFO L273 TraceCheckUtils]: 7: Hoare triple {1509#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1509#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:05,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {1509#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1510#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:05,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {1510#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1510#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:05,559 INFO L273 TraceCheckUtils]: 10: Hoare triple {1510#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1511#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:05,563 INFO L273 TraceCheckUtils]: 11: Hoare triple {1511#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1511#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:05,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {1511#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1512#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:05,568 INFO L273 TraceCheckUtils]: 13: Hoare triple {1512#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {1507#false} is VALID [2018-11-23 13:05:05,568 INFO L256 TraceCheckUtils]: 14: Hoare triple {1507#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1507#false} is VALID [2018-11-23 13:05:05,568 INFO L273 TraceCheckUtils]: 15: Hoare triple {1507#false} ~cond := #in~cond; {1507#false} is VALID [2018-11-23 13:05:05,569 INFO L273 TraceCheckUtils]: 16: Hoare triple {1507#false} assume 0 == ~cond; {1507#false} is VALID [2018-11-23 13:05:05,569 INFO L273 TraceCheckUtils]: 17: Hoare triple {1507#false} assume !false; {1507#false} is VALID [2018-11-23 13:05:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:05,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:05,570 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:05:05,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:05,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:05,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:05,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:05,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {1506#true} call ULTIMATE.init(); {1506#true} is VALID [2018-11-23 13:05:05,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {1506#true} assume true; {1506#true} is VALID [2018-11-23 13:05:05,927 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1506#true} {1506#true} #37#return; {1506#true} is VALID [2018-11-23 13:05:05,928 INFO L256 TraceCheckUtils]: 3: Hoare triple {1506#true} call #t~ret2 := main(); {1506#true} is VALID [2018-11-23 13:05:05,928 INFO L273 TraceCheckUtils]: 4: Hoare triple {1506#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1508#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:05,929 INFO L273 TraceCheckUtils]: 5: Hoare triple {1508#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1508#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:05,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {1508#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1509#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:05,930 INFO L273 TraceCheckUtils]: 7: Hoare triple {1509#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1509#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:05,931 INFO L273 TraceCheckUtils]: 8: Hoare triple {1509#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1510#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:05,931 INFO L273 TraceCheckUtils]: 9: Hoare triple {1510#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1510#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:05,942 INFO L273 TraceCheckUtils]: 10: Hoare triple {1510#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1511#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:05,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {1511#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1511#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:05,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {1511#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1552#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:05,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {1552#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 99); {1507#false} is VALID [2018-11-23 13:05:05,944 INFO L256 TraceCheckUtils]: 14: Hoare triple {1507#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1507#false} is VALID [2018-11-23 13:05:05,945 INFO L273 TraceCheckUtils]: 15: Hoare triple {1507#false} ~cond := #in~cond; {1507#false} is VALID [2018-11-23 13:05:05,945 INFO L273 TraceCheckUtils]: 16: Hoare triple {1507#false} assume 0 == ~cond; {1507#false} is VALID [2018-11-23 13:05:05,945 INFO L273 TraceCheckUtils]: 17: Hoare triple {1507#false} assume !false; {1507#false} is VALID [2018-11-23 13:05:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:05,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:05,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:05:05,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:05:05,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:05,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:05:05,991 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:05:05,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:05:05,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:05:05,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:05:05,992 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2018-11-23 13:05:06,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:06,533 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 13:05:06,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:05:06,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:05:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:05:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2018-11-23 13:05:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:05:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2018-11-23 13:05:06,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2018-11-23 13:05:06,577 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:05:06,579 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:05:06,579 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:05:06,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:05:06,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:05:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 13:05:06,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:06,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 13:05:06,609 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 13:05:06,609 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 13:05:06,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:06,611 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 13:05:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 13:05:06,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:06,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:06,612 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 13:05:06,613 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 13:05:06,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:06,614 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 13:05:06,614 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 13:05:06,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:06,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:06,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:06,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:06,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:05:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 13:05:06,616 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 18 [2018-11-23 13:05:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:06,616 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 13:05:06,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:05:06,616 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 13:05:06,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:05:06,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:06,617 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:06,617 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:06,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:06,618 INFO L82 PathProgramCache]: Analyzing trace with hash -224607324, now seen corresponding path program 4 times [2018-11-23 13:05:06,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:06,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:06,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:06,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:06,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:06,790 INFO L256 TraceCheckUtils]: 0: Hoare triple {1721#true} call ULTIMATE.init(); {1721#true} is VALID [2018-11-23 13:05:06,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {1721#true} assume true; {1721#true} is VALID [2018-11-23 13:05:06,791 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1721#true} {1721#true} #37#return; {1721#true} is VALID [2018-11-23 13:05:06,791 INFO L256 TraceCheckUtils]: 3: Hoare triple {1721#true} call #t~ret2 := main(); {1721#true} is VALID [2018-11-23 13:05:06,792 INFO L273 TraceCheckUtils]: 4: Hoare triple {1721#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1723#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:06,793 INFO L273 TraceCheckUtils]: 5: Hoare triple {1723#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1723#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:06,794 INFO L273 TraceCheckUtils]: 6: Hoare triple {1723#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:06,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:06,795 INFO L273 TraceCheckUtils]: 8: Hoare triple {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1725#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:06,796 INFO L273 TraceCheckUtils]: 9: Hoare triple {1725#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {1725#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:06,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {1725#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1726#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:06,798 INFO L273 TraceCheckUtils]: 11: Hoare triple {1726#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1726#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:06,800 INFO L273 TraceCheckUtils]: 12: Hoare triple {1726#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1727#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:06,801 INFO L273 TraceCheckUtils]: 13: Hoare triple {1727#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {1722#false} is VALID [2018-11-23 13:05:06,801 INFO L256 TraceCheckUtils]: 14: Hoare triple {1722#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1722#false} is VALID [2018-11-23 13:05:06,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {1722#false} ~cond := #in~cond; {1722#false} is VALID [2018-11-23 13:05:06,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {1722#false} assume 0 == ~cond; {1722#false} is VALID [2018-11-23 13:05:06,801 INFO L273 TraceCheckUtils]: 17: Hoare triple {1722#false} assume !false; {1722#false} is VALID [2018-11-23 13:05:06,802 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:06,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:06,803 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:05:06,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:06,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:06,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:06,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:07,003 INFO L256 TraceCheckUtils]: 0: Hoare triple {1721#true} call ULTIMATE.init(); {1721#true} is VALID [2018-11-23 13:05:07,003 INFO L273 TraceCheckUtils]: 1: Hoare triple {1721#true} assume true; {1721#true} is VALID [2018-11-23 13:05:07,004 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1721#true} {1721#true} #37#return; {1721#true} is VALID [2018-11-23 13:05:07,004 INFO L256 TraceCheckUtils]: 3: Hoare triple {1721#true} call #t~ret2 := main(); {1721#true} is VALID [2018-11-23 13:05:07,004 INFO L273 TraceCheckUtils]: 4: Hoare triple {1721#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1723#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:07,005 INFO L273 TraceCheckUtils]: 5: Hoare triple {1723#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1723#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:07,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {1723#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:07,006 INFO L273 TraceCheckUtils]: 7: Hoare triple {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:07,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {1724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1725#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:07,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {1725#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {1725#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:07,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {1725#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1726#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:07,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {1726#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1726#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:07,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {1726#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {1767#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:07,013 INFO L273 TraceCheckUtils]: 13: Hoare triple {1767#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 99); {1722#false} is VALID [2018-11-23 13:05:07,013 INFO L256 TraceCheckUtils]: 14: Hoare triple {1722#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1722#false} is VALID [2018-11-23 13:05:07,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {1722#false} ~cond := #in~cond; {1722#false} is VALID [2018-11-23 13:05:07,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {1722#false} assume 0 == ~cond; {1722#false} is VALID [2018-11-23 13:05:07,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {1722#false} assume !false; {1722#false} is VALID [2018-11-23 13:05:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:07,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:07,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:05:07,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:05:07,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:07,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:05:07,053 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:05:07,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:05:07,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:05:07,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:05:07,055 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2018-11-23 13:05:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:07,312 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 13:05:07,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:05:07,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 13:05:07,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:05:07,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-11-23 13:05:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:05:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2018-11-23 13:05:07,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2018-11-23 13:05:07,363 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:05:07,364 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:05:07,364 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:05:07,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:05:07,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:05:07,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 13:05:07,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:07,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 13:05:07,427 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 13:05:07,427 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 13:05:07,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:07,428 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 13:05:07,429 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 13:05:07,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:07,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:07,429 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 13:05:07,429 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 13:05:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:07,431 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 13:05:07,431 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 13:05:07,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:07,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:07,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:07,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:05:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-23 13:05:07,433 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2018-11-23 13:05:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:07,434 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-23 13:05:07,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:05:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 13:05:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:05:07,434 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:07,434 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:07,435 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:07,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:07,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1931383913, now seen corresponding path program 5 times [2018-11-23 13:05:07,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:07,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:07,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:07,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:07,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:07,617 INFO L256 TraceCheckUtils]: 0: Hoare triple {1946#true} call ULTIMATE.init(); {1946#true} is VALID [2018-11-23 13:05:07,617 INFO L273 TraceCheckUtils]: 1: Hoare triple {1946#true} assume true; {1946#true} is VALID [2018-11-23 13:05:07,617 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1946#true} {1946#true} #37#return; {1946#true} is VALID [2018-11-23 13:05:07,617 INFO L256 TraceCheckUtils]: 3: Hoare triple {1946#true} call #t~ret2 := main(); {1946#true} is VALID [2018-11-23 13:05:07,618 INFO L273 TraceCheckUtils]: 4: Hoare triple {1946#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1948#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:07,618 INFO L273 TraceCheckUtils]: 5: Hoare triple {1948#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1948#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:07,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {1948#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1949#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:07,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {1949#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1949#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:07,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {1949#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1950#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:07,621 INFO L273 TraceCheckUtils]: 9: Hoare triple {1950#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1950#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:07,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {1950#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1951#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:07,629 INFO L273 TraceCheckUtils]: 11: Hoare triple {1951#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1951#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:07,630 INFO L273 TraceCheckUtils]: 12: Hoare triple {1951#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1952#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:07,630 INFO L273 TraceCheckUtils]: 13: Hoare triple {1952#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {1952#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:07,631 INFO L273 TraceCheckUtils]: 14: Hoare triple {1952#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1953#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:07,632 INFO L273 TraceCheckUtils]: 15: Hoare triple {1953#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 99); {1947#false} is VALID [2018-11-23 13:05:07,632 INFO L256 TraceCheckUtils]: 16: Hoare triple {1947#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1947#false} is VALID [2018-11-23 13:05:07,632 INFO L273 TraceCheckUtils]: 17: Hoare triple {1947#false} ~cond := #in~cond; {1947#false} is VALID [2018-11-23 13:05:07,632 INFO L273 TraceCheckUtils]: 18: Hoare triple {1947#false} assume 0 == ~cond; {1947#false} is VALID [2018-11-23 13:05:07,632 INFO L273 TraceCheckUtils]: 19: Hoare triple {1947#false} assume !false; {1947#false} is VALID [2018-11-23 13:05:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:07,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:07,633 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:05:07,644 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:05:07,672 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:05:07,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:07,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:07,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {1946#true} call ULTIMATE.init(); {1946#true} is VALID [2018-11-23 13:05:07,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {1946#true} assume true; {1946#true} is VALID [2018-11-23 13:05:07,780 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1946#true} {1946#true} #37#return; {1946#true} is VALID [2018-11-23 13:05:07,780 INFO L256 TraceCheckUtils]: 3: Hoare triple {1946#true} call #t~ret2 := main(); {1946#true} is VALID [2018-11-23 13:05:07,780 INFO L273 TraceCheckUtils]: 4: Hoare triple {1946#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {1948#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:07,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {1948#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1948#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:07,781 INFO L273 TraceCheckUtils]: 6: Hoare triple {1948#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1949#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:07,782 INFO L273 TraceCheckUtils]: 7: Hoare triple {1949#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1949#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:07,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {1949#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1950#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:07,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {1950#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1950#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:07,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {1950#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1951#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:07,792 INFO L273 TraceCheckUtils]: 11: Hoare triple {1951#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1951#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:07,793 INFO L273 TraceCheckUtils]: 12: Hoare triple {1951#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1952#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:07,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {1952#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {1952#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:07,794 INFO L273 TraceCheckUtils]: 14: Hoare triple {1952#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {1999#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:07,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {1999#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 99); {1947#false} is VALID [2018-11-23 13:05:07,797 INFO L256 TraceCheckUtils]: 16: Hoare triple {1947#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1947#false} is VALID [2018-11-23 13:05:07,797 INFO L273 TraceCheckUtils]: 17: Hoare triple {1947#false} ~cond := #in~cond; {1947#false} is VALID [2018-11-23 13:05:07,797 INFO L273 TraceCheckUtils]: 18: Hoare triple {1947#false} assume 0 == ~cond; {1947#false} is VALID [2018-11-23 13:05:07,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {1947#false} assume !false; {1947#false} is VALID [2018-11-23 13:05:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:07,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:07,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:05:07,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-23 13:05:07,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:07,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:05:07,839 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:05:07,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:05:07,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:05:07,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:05:07,840 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2018-11-23 13:05:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:08,164 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-23 13:05:08,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:05:08,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-23 13:05:08,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:05:08,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2018-11-23 13:05:08,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:05:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2018-11-23 13:05:08,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2018-11-23 13:05:08,210 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:05:08,212 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:05:08,212 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:05:08,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:05:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:05:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 13:05:08,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:08,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-23 13:05:08,255 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-23 13:05:08,256 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-23 13:05:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:08,257 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 13:05:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 13:05:08,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:08,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:08,259 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-23 13:05:08,259 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-23 13:05:08,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:08,260 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 13:05:08,260 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 13:05:08,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:08,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:08,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:08,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:08,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:05:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 13:05:08,262 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 20 [2018-11-23 13:05:08,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:08,262 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 13:05:08,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:05:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 13:05:08,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:05:08,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:08,263 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:08,263 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:08,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:08,263 INFO L82 PathProgramCache]: Analyzing trace with hash 33316767, now seen corresponding path program 5 times [2018-11-23 13:05:08,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:08,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:08,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:08,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:08,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:08,610 INFO L256 TraceCheckUtils]: 0: Hoare triple {2188#true} call ULTIMATE.init(); {2188#true} is VALID [2018-11-23 13:05:08,610 INFO L273 TraceCheckUtils]: 1: Hoare triple {2188#true} assume true; {2188#true} is VALID [2018-11-23 13:05:08,610 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2188#true} {2188#true} #37#return; {2188#true} is VALID [2018-11-23 13:05:08,611 INFO L256 TraceCheckUtils]: 3: Hoare triple {2188#true} call #t~ret2 := main(); {2188#true} is VALID [2018-11-23 13:05:08,611 INFO L273 TraceCheckUtils]: 4: Hoare triple {2188#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2190#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:08,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {2190#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2190#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:08,613 INFO L273 TraceCheckUtils]: 6: Hoare triple {2190#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2191#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:08,613 INFO L273 TraceCheckUtils]: 7: Hoare triple {2191#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2191#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:08,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {2191#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2192#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:08,615 INFO L273 TraceCheckUtils]: 9: Hoare triple {2192#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2192#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:08,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {2192#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2193#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:08,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {2193#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2193#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:08,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {2193#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2194#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:08,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {2194#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {2194#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:08,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {2194#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2195#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:08,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {2195#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {2189#false} is VALID [2018-11-23 13:05:08,626 INFO L256 TraceCheckUtils]: 16: Hoare triple {2189#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2189#false} is VALID [2018-11-23 13:05:08,627 INFO L273 TraceCheckUtils]: 17: Hoare triple {2189#false} ~cond := #in~cond; {2189#false} is VALID [2018-11-23 13:05:08,627 INFO L273 TraceCheckUtils]: 18: Hoare triple {2189#false} assume 0 == ~cond; {2189#false} is VALID [2018-11-23 13:05:08,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {2189#false} assume !false; {2189#false} is VALID [2018-11-23 13:05:08,628 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:08,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:08,628 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:05:08,639 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:05:08,736 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:05:08,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:08,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:08,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {2188#true} call ULTIMATE.init(); {2188#true} is VALID [2018-11-23 13:05:08,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {2188#true} assume true; {2188#true} is VALID [2018-11-23 13:05:08,830 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2188#true} {2188#true} #37#return; {2188#true} is VALID [2018-11-23 13:05:08,830 INFO L256 TraceCheckUtils]: 3: Hoare triple {2188#true} call #t~ret2 := main(); {2188#true} is VALID [2018-11-23 13:05:08,834 INFO L273 TraceCheckUtils]: 4: Hoare triple {2188#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2190#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:08,834 INFO L273 TraceCheckUtils]: 5: Hoare triple {2190#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2190#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:08,835 INFO L273 TraceCheckUtils]: 6: Hoare triple {2190#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2191#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:08,836 INFO L273 TraceCheckUtils]: 7: Hoare triple {2191#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2191#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:08,839 INFO L273 TraceCheckUtils]: 8: Hoare triple {2191#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2192#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:08,840 INFO L273 TraceCheckUtils]: 9: Hoare triple {2192#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2192#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:08,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {2192#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2193#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:08,841 INFO L273 TraceCheckUtils]: 11: Hoare triple {2193#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2193#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:08,842 INFO L273 TraceCheckUtils]: 12: Hoare triple {2193#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2194#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:08,842 INFO L273 TraceCheckUtils]: 13: Hoare triple {2194#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {2194#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:08,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {2194#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2241#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:08,844 INFO L273 TraceCheckUtils]: 15: Hoare triple {2241#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {2189#false} is VALID [2018-11-23 13:05:08,844 INFO L256 TraceCheckUtils]: 16: Hoare triple {2189#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2189#false} is VALID [2018-11-23 13:05:08,844 INFO L273 TraceCheckUtils]: 17: Hoare triple {2189#false} ~cond := #in~cond; {2189#false} is VALID [2018-11-23 13:05:08,844 INFO L273 TraceCheckUtils]: 18: Hoare triple {2189#false} assume 0 == ~cond; {2189#false} is VALID [2018-11-23 13:05:08,844 INFO L273 TraceCheckUtils]: 19: Hoare triple {2189#false} assume !false; {2189#false} is VALID [2018-11-23 13:05:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:08,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:08,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:05:08,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-23 13:05:08,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:08,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:05:08,890 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:05:08,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:05:08,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:05:08,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:05:08,891 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 9 states. [2018-11-23 13:05:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:09,205 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 13:05:09,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:05:09,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-23 13:05:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:05:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2018-11-23 13:05:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:05:09,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2018-11-23 13:05:09,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 33 transitions. [2018-11-23 13:05:09,248 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:05:09,249 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:05:09,249 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 13:05:09,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 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:05:09,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 13:05:09,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 13:05:09,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:09,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-23 13:05:09,287 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-23 13:05:09,287 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-23 13:05:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:09,289 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 13:05:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 13:05:09,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:09,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:09,290 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-23 13:05:09,290 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-23 13:05:09,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:09,291 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 13:05:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 13:05:09,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:09,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:09,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:09,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:05:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-23 13:05:09,292 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 20 [2018-11-23 13:05:09,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:09,293 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-23 13:05:09,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:05:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 13:05:09,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:05:09,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:09,294 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:09,294 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:09,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:09,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1709400550, now seen corresponding path program 6 times [2018-11-23 13:05:09,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:09,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:09,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:09,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:09,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:09,687 INFO L256 TraceCheckUtils]: 0: Hoare triple {2440#true} call ULTIMATE.init(); {2440#true} is VALID [2018-11-23 13:05:09,688 INFO L273 TraceCheckUtils]: 1: Hoare triple {2440#true} assume true; {2440#true} is VALID [2018-11-23 13:05:09,688 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2440#true} {2440#true} #37#return; {2440#true} is VALID [2018-11-23 13:05:09,688 INFO L256 TraceCheckUtils]: 3: Hoare triple {2440#true} call #t~ret2 := main(); {2440#true} is VALID [2018-11-23 13:05:09,688 INFO L273 TraceCheckUtils]: 4: Hoare triple {2440#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2442#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:09,689 INFO L273 TraceCheckUtils]: 5: Hoare triple {2442#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2442#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:09,690 INFO L273 TraceCheckUtils]: 6: Hoare triple {2442#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2443#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:09,690 INFO L273 TraceCheckUtils]: 7: Hoare triple {2443#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2443#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:09,691 INFO L273 TraceCheckUtils]: 8: Hoare triple {2443#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2444#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:09,691 INFO L273 TraceCheckUtils]: 9: Hoare triple {2444#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2444#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:09,692 INFO L273 TraceCheckUtils]: 10: Hoare triple {2444#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2445#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:09,693 INFO L273 TraceCheckUtils]: 11: Hoare triple {2445#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2445#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:09,694 INFO L273 TraceCheckUtils]: 12: Hoare triple {2445#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2446#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:09,695 INFO L273 TraceCheckUtils]: 13: Hoare triple {2446#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2446#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:09,696 INFO L273 TraceCheckUtils]: 14: Hoare triple {2446#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2447#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:09,697 INFO L273 TraceCheckUtils]: 15: Hoare triple {2447#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {2447#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:09,698 INFO L273 TraceCheckUtils]: 16: Hoare triple {2447#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2448#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:09,699 INFO L273 TraceCheckUtils]: 17: Hoare triple {2448#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {2441#false} is VALID [2018-11-23 13:05:09,699 INFO L256 TraceCheckUtils]: 18: Hoare triple {2441#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2441#false} is VALID [2018-11-23 13:05:09,699 INFO L273 TraceCheckUtils]: 19: Hoare triple {2441#false} ~cond := #in~cond; {2441#false} is VALID [2018-11-23 13:05:09,700 INFO L273 TraceCheckUtils]: 20: Hoare triple {2441#false} assume 0 == ~cond; {2441#false} is VALID [2018-11-23 13:05:09,700 INFO L273 TraceCheckUtils]: 21: Hoare triple {2441#false} assume !false; {2441#false} is VALID [2018-11-23 13:05:09,702 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:05:09,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:09,702 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:05:09,719 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:05:09,750 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:05:09,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:09,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:09,843 INFO L256 TraceCheckUtils]: 0: Hoare triple {2440#true} call ULTIMATE.init(); {2440#true} is VALID [2018-11-23 13:05:09,844 INFO L273 TraceCheckUtils]: 1: Hoare triple {2440#true} assume true; {2440#true} is VALID [2018-11-23 13:05:09,844 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2440#true} {2440#true} #37#return; {2440#true} is VALID [2018-11-23 13:05:09,844 INFO L256 TraceCheckUtils]: 3: Hoare triple {2440#true} call #t~ret2 := main(); {2440#true} is VALID [2018-11-23 13:05:09,848 INFO L273 TraceCheckUtils]: 4: Hoare triple {2440#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2442#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:09,848 INFO L273 TraceCheckUtils]: 5: Hoare triple {2442#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2442#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:09,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {2442#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2443#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:09,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {2443#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2443#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:09,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {2443#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2444#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:09,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {2444#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2444#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:09,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {2444#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2445#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:09,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {2445#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2445#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:09,854 INFO L273 TraceCheckUtils]: 12: Hoare triple {2445#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2446#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:09,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {2446#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2446#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:09,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {2446#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2447#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:09,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {2447#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {2447#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:09,858 INFO L273 TraceCheckUtils]: 16: Hoare triple {2447#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2500#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:09,859 INFO L273 TraceCheckUtils]: 17: Hoare triple {2500#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {2441#false} is VALID [2018-11-23 13:05:09,859 INFO L256 TraceCheckUtils]: 18: Hoare triple {2441#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2441#false} is VALID [2018-11-23 13:05:09,859 INFO L273 TraceCheckUtils]: 19: Hoare triple {2441#false} ~cond := #in~cond; {2441#false} is VALID [2018-11-23 13:05:09,859 INFO L273 TraceCheckUtils]: 20: Hoare triple {2441#false} assume 0 == ~cond; {2441#false} is VALID [2018-11-23 13:05:09,860 INFO L273 TraceCheckUtils]: 21: Hoare triple {2441#false} assume !false; {2441#false} is VALID [2018-11-23 13:05:09,861 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:05:09,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:09,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 13:05:09,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-23 13:05:09,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:09,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:05:09,905 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:05:09,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:05:09,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:05:09,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:05:09,906 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 10 states. [2018-11-23 13:05:10,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:10,389 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 13:05:10,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:05:10,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-23 13:05:10,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:05:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2018-11-23 13:05:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:05:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2018-11-23 13:05:10,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2018-11-23 13:05:10,429 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:05:10,430 INFO L225 Difference]: With dead ends: 42 [2018-11-23 13:05:10,431 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 13:05:10,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 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:05:10,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 13:05:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-23 13:05:10,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:10,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2018-11-23 13:05:10,470 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2018-11-23 13:05:10,470 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2018-11-23 13:05:10,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:10,471 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 13:05:10,471 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-23 13:05:10,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:10,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:10,472 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2018-11-23 13:05:10,472 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2018-11-23 13:05:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:10,473 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 13:05:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-23 13:05:10,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:10,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:10,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:10,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:05:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-23 13:05:10,475 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 22 [2018-11-23 13:05:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:10,475 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-23 13:05:10,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:05:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 13:05:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:05:10,476 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:10,476 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:10,476 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:10,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:10,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1209734950, now seen corresponding path program 6 times [2018-11-23 13:05:10,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:10,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:10,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:10,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:10,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:11,013 INFO L256 TraceCheckUtils]: 0: Hoare triple {2709#true} call ULTIMATE.init(); {2709#true} is VALID [2018-11-23 13:05:11,013 INFO L273 TraceCheckUtils]: 1: Hoare triple {2709#true} assume true; {2709#true} is VALID [2018-11-23 13:05:11,013 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2709#true} {2709#true} #37#return; {2709#true} is VALID [2018-11-23 13:05:11,014 INFO L256 TraceCheckUtils]: 3: Hoare triple {2709#true} call #t~ret2 := main(); {2709#true} is VALID [2018-11-23 13:05:11,014 INFO L273 TraceCheckUtils]: 4: Hoare triple {2709#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2711#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:11,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {2711#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2711#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:11,016 INFO L273 TraceCheckUtils]: 6: Hoare triple {2711#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2712#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:11,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {2712#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2712#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:11,018 INFO L273 TraceCheckUtils]: 8: Hoare triple {2712#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2713#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:11,018 INFO L273 TraceCheckUtils]: 9: Hoare triple {2713#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2713#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:11,020 INFO L273 TraceCheckUtils]: 10: Hoare triple {2713#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2714#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:11,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {2714#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2714#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:11,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {2714#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2715#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:11,022 INFO L273 TraceCheckUtils]: 13: Hoare triple {2715#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {2715#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:11,024 INFO L273 TraceCheckUtils]: 14: Hoare triple {2715#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2716#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:11,024 INFO L273 TraceCheckUtils]: 15: Hoare triple {2716#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2716#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:11,026 INFO L273 TraceCheckUtils]: 16: Hoare triple {2716#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2717#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:11,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {2717#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {2710#false} is VALID [2018-11-23 13:05:11,026 INFO L256 TraceCheckUtils]: 18: Hoare triple {2710#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2710#false} is VALID [2018-11-23 13:05:11,027 INFO L273 TraceCheckUtils]: 19: Hoare triple {2710#false} ~cond := #in~cond; {2710#false} is VALID [2018-11-23 13:05:11,027 INFO L273 TraceCheckUtils]: 20: Hoare triple {2710#false} assume 0 == ~cond; {2710#false} is VALID [2018-11-23 13:05:11,027 INFO L273 TraceCheckUtils]: 21: Hoare triple {2710#false} assume !false; {2710#false} is VALID [2018-11-23 13:05:11,028 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:05:11,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:11,028 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:05:11,037 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:05:11,078 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:05:11,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:11,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:11,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {2709#true} call ULTIMATE.init(); {2709#true} is VALID [2018-11-23 13:05:11,168 INFO L273 TraceCheckUtils]: 1: Hoare triple {2709#true} assume true; {2709#true} is VALID [2018-11-23 13:05:11,168 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2709#true} {2709#true} #37#return; {2709#true} is VALID [2018-11-23 13:05:11,169 INFO L256 TraceCheckUtils]: 3: Hoare triple {2709#true} call #t~ret2 := main(); {2709#true} is VALID [2018-11-23 13:05:11,169 INFO L273 TraceCheckUtils]: 4: Hoare triple {2709#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2711#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:11,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {2711#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2711#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:11,170 INFO L273 TraceCheckUtils]: 6: Hoare triple {2711#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2712#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:11,171 INFO L273 TraceCheckUtils]: 7: Hoare triple {2712#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2712#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:11,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {2712#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2713#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:11,172 INFO L273 TraceCheckUtils]: 9: Hoare triple {2713#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2713#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:11,172 INFO L273 TraceCheckUtils]: 10: Hoare triple {2713#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2714#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:11,173 INFO L273 TraceCheckUtils]: 11: Hoare triple {2714#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2714#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:11,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {2714#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2715#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:11,180 INFO L273 TraceCheckUtils]: 13: Hoare triple {2715#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {2715#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:11,198 INFO L273 TraceCheckUtils]: 14: Hoare triple {2715#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2716#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:11,200 INFO L273 TraceCheckUtils]: 15: Hoare triple {2716#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2716#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:11,201 INFO L273 TraceCheckUtils]: 16: Hoare triple {2716#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {2769#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:11,201 INFO L273 TraceCheckUtils]: 17: Hoare triple {2769#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {2710#false} is VALID [2018-11-23 13:05:11,201 INFO L256 TraceCheckUtils]: 18: Hoare triple {2710#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2710#false} is VALID [2018-11-23 13:05:11,201 INFO L273 TraceCheckUtils]: 19: Hoare triple {2710#false} ~cond := #in~cond; {2710#false} is VALID [2018-11-23 13:05:11,202 INFO L273 TraceCheckUtils]: 20: Hoare triple {2710#false} assume 0 == ~cond; {2710#false} is VALID [2018-11-23 13:05:11,202 INFO L273 TraceCheckUtils]: 21: Hoare triple {2710#false} assume !false; {2710#false} is VALID [2018-11-23 13:05:11,202 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:05:11,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:11,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 13:05:11,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-23 13:05:11,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:11,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:05:11,248 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:05:11,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:05:11,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:05:11,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:05:11,249 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-11-23 13:05:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:11,936 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 13:05:11,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:05:11,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-23 13:05:11,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:05:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2018-11-23 13:05:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:05:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2018-11-23 13:05:11,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 35 transitions. [2018-11-23 13:05:11,993 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:05:11,994 INFO L225 Difference]: With dead ends: 44 [2018-11-23 13:05:11,994 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:05:11,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:05:11,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:05:12,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-23 13:05:12,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:12,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-23 13:05:12,054 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-23 13:05:12,054 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-23 13:05:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:12,056 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 13:05:12,056 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 13:05:12,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:12,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:12,057 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-23 13:05:12,057 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-23 13:05:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:12,058 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 13:05:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 13:05:12,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:12,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:12,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:12,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:05:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-23 13:05:12,060 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 22 [2018-11-23 13:05:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:12,060 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-23 13:05:12,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:05:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 13:05:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:05:12,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:12,061 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:12,062 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:12,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:12,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1163213789, now seen corresponding path program 7 times [2018-11-23 13:05:12,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:12,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:12,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:12,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:12,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:12,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {2988#true} call ULTIMATE.init(); {2988#true} is VALID [2018-11-23 13:05:12,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {2988#true} assume true; {2988#true} is VALID [2018-11-23 13:05:12,272 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2988#true} {2988#true} #37#return; {2988#true} is VALID [2018-11-23 13:05:12,273 INFO L256 TraceCheckUtils]: 3: Hoare triple {2988#true} call #t~ret2 := main(); {2988#true} is VALID [2018-11-23 13:05:12,273 INFO L273 TraceCheckUtils]: 4: Hoare triple {2988#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2990#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:12,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {2990#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2990#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:12,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {2990#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2991#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:12,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {2991#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2991#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:12,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {2991#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2992#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:12,277 INFO L273 TraceCheckUtils]: 9: Hoare triple {2992#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2992#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:12,278 INFO L273 TraceCheckUtils]: 10: Hoare triple {2992#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2993#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:12,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {2993#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2993#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:12,280 INFO L273 TraceCheckUtils]: 12: Hoare triple {2993#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2994#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:12,281 INFO L273 TraceCheckUtils]: 13: Hoare triple {2994#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2994#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:12,282 INFO L273 TraceCheckUtils]: 14: Hoare triple {2994#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2995#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:12,283 INFO L273 TraceCheckUtils]: 15: Hoare triple {2995#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {2995#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:12,284 INFO L273 TraceCheckUtils]: 16: Hoare triple {2995#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2996#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:12,285 INFO L273 TraceCheckUtils]: 17: Hoare triple {2996#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2996#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:12,286 INFO L273 TraceCheckUtils]: 18: Hoare triple {2996#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2997#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:12,287 INFO L273 TraceCheckUtils]: 19: Hoare triple {2997#(and (<= main_~x~0 7) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {2989#false} is VALID [2018-11-23 13:05:12,287 INFO L256 TraceCheckUtils]: 20: Hoare triple {2989#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2989#false} is VALID [2018-11-23 13:05:12,288 INFO L273 TraceCheckUtils]: 21: Hoare triple {2989#false} ~cond := #in~cond; {2989#false} is VALID [2018-11-23 13:05:12,288 INFO L273 TraceCheckUtils]: 22: Hoare triple {2989#false} assume 0 == ~cond; {2989#false} is VALID [2018-11-23 13:05:12,288 INFO L273 TraceCheckUtils]: 23: Hoare triple {2989#false} assume !false; {2989#false} is VALID [2018-11-23 13:05:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:12,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:12,290 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:05:12,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:12,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:12,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {2988#true} call ULTIMATE.init(); {2988#true} is VALID [2018-11-23 13:05:12,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {2988#true} assume true; {2988#true} is VALID [2018-11-23 13:05:12,421 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2988#true} {2988#true} #37#return; {2988#true} is VALID [2018-11-23 13:05:12,421 INFO L256 TraceCheckUtils]: 3: Hoare triple {2988#true} call #t~ret2 := main(); {2988#true} is VALID [2018-11-23 13:05:12,435 INFO L273 TraceCheckUtils]: 4: Hoare triple {2988#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {2990#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:12,436 INFO L273 TraceCheckUtils]: 5: Hoare triple {2990#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2990#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:12,437 INFO L273 TraceCheckUtils]: 6: Hoare triple {2990#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2991#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:12,437 INFO L273 TraceCheckUtils]: 7: Hoare triple {2991#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2991#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:12,438 INFO L273 TraceCheckUtils]: 8: Hoare triple {2991#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2992#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:12,439 INFO L273 TraceCheckUtils]: 9: Hoare triple {2992#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {2992#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:12,439 INFO L273 TraceCheckUtils]: 10: Hoare triple {2992#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2993#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:12,440 INFO L273 TraceCheckUtils]: 11: Hoare triple {2993#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2993#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:12,441 INFO L273 TraceCheckUtils]: 12: Hoare triple {2993#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2994#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:12,442 INFO L273 TraceCheckUtils]: 13: Hoare triple {2994#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {2994#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:12,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {2994#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2995#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:12,444 INFO L273 TraceCheckUtils]: 15: Hoare triple {2995#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {2995#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:12,445 INFO L273 TraceCheckUtils]: 16: Hoare triple {2995#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {2996#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:12,446 INFO L273 TraceCheckUtils]: 17: Hoare triple {2996#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {2996#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:12,448 INFO L273 TraceCheckUtils]: 18: Hoare triple {2996#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3055#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:12,449 INFO L273 TraceCheckUtils]: 19: Hoare triple {3055#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {2989#false} is VALID [2018-11-23 13:05:12,449 INFO L256 TraceCheckUtils]: 20: Hoare triple {2989#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2989#false} is VALID [2018-11-23 13:05:12,449 INFO L273 TraceCheckUtils]: 21: Hoare triple {2989#false} ~cond := #in~cond; {2989#false} is VALID [2018-11-23 13:05:12,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {2989#false} assume 0 == ~cond; {2989#false} is VALID [2018-11-23 13:05:12,450 INFO L273 TraceCheckUtils]: 23: Hoare triple {2989#false} assume !false; {2989#false} is VALID [2018-11-23 13:05:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:12,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:12,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:05:12,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:05:12,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:12,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:05:12,527 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:05:12,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:05:12,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:05:12,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:05:12,528 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 11 states. [2018-11-23 13:05:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,258 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 13:05:13,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:05:13,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:05:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:13,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:05:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 38 transitions. [2018-11-23 13:05:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:05:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 38 transitions. [2018-11-23 13:05:13,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 38 transitions. [2018-11-23 13:05:13,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:13,305 INFO L225 Difference]: With dead ends: 46 [2018-11-23 13:05:13,305 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 13:05:13,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:05:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 13:05:13,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-23 13:05:13,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:13,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 40 states. [2018-11-23 13:05:13,346 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 40 states. [2018-11-23 13:05:13,346 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 40 states. [2018-11-23 13:05:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,348 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-23 13:05:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-23 13:05:13,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:13,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:13,348 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 41 states. [2018-11-23 13:05:13,348 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 41 states. [2018-11-23 13:05:13,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,350 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-23 13:05:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-23 13:05:13,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:13,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:13,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:13,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:05:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-23 13:05:13,352 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 24 [2018-11-23 13:05:13,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:13,352 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-23 13:05:13,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:05:13,352 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 13:05:13,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:05:13,353 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:13,353 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:13,353 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:13,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:13,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1781526699, now seen corresponding path program 7 times [2018-11-23 13:05:13,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:13,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:13,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:13,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:13,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:14,003 INFO L256 TraceCheckUtils]: 0: Hoare triple {3284#true} call ULTIMATE.init(); {3284#true} is VALID [2018-11-23 13:05:14,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {3284#true} assume true; {3284#true} is VALID [2018-11-23 13:05:14,004 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3284#true} {3284#true} #37#return; {3284#true} is VALID [2018-11-23 13:05:14,004 INFO L256 TraceCheckUtils]: 3: Hoare triple {3284#true} call #t~ret2 := main(); {3284#true} is VALID [2018-11-23 13:05:14,005 INFO L273 TraceCheckUtils]: 4: Hoare triple {3284#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {3286#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:14,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {3286#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3286#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:14,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {3286#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3287#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:14,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {3287#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3287#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:14,009 INFO L273 TraceCheckUtils]: 8: Hoare triple {3287#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3288#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:14,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {3288#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3288#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:14,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {3288#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3289#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:14,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {3289#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3289#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:14,013 INFO L273 TraceCheckUtils]: 12: Hoare triple {3289#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3290#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:14,013 INFO L273 TraceCheckUtils]: 13: Hoare triple {3290#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {3290#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:14,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {3290#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:14,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:14,016 INFO L273 TraceCheckUtils]: 16: Hoare triple {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3292#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:14,017 INFO L273 TraceCheckUtils]: 17: Hoare triple {3292#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3292#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:14,019 INFO L273 TraceCheckUtils]: 18: Hoare triple {3292#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3293#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:14,019 INFO L273 TraceCheckUtils]: 19: Hoare triple {3293#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {3285#false} is VALID [2018-11-23 13:05:14,020 INFO L256 TraceCheckUtils]: 20: Hoare triple {3285#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3285#false} is VALID [2018-11-23 13:05:14,020 INFO L273 TraceCheckUtils]: 21: Hoare triple {3285#false} ~cond := #in~cond; {3285#false} is VALID [2018-11-23 13:05:14,020 INFO L273 TraceCheckUtils]: 22: Hoare triple {3285#false} assume 0 == ~cond; {3285#false} is VALID [2018-11-23 13:05:14,020 INFO L273 TraceCheckUtils]: 23: Hoare triple {3285#false} assume !false; {3285#false} is VALID [2018-11-23 13:05:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:14,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:14,022 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:05:14,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:14,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:14,185 INFO L256 TraceCheckUtils]: 0: Hoare triple {3284#true} call ULTIMATE.init(); {3284#true} is VALID [2018-11-23 13:05:14,185 INFO L273 TraceCheckUtils]: 1: Hoare triple {3284#true} assume true; {3284#true} is VALID [2018-11-23 13:05:14,185 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3284#true} {3284#true} #37#return; {3284#true} is VALID [2018-11-23 13:05:14,185 INFO L256 TraceCheckUtils]: 3: Hoare triple {3284#true} call #t~ret2 := main(); {3284#true} is VALID [2018-11-23 13:05:14,186 INFO L273 TraceCheckUtils]: 4: Hoare triple {3284#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {3286#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:14,187 INFO L273 TraceCheckUtils]: 5: Hoare triple {3286#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3286#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:14,188 INFO L273 TraceCheckUtils]: 6: Hoare triple {3286#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3287#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:14,188 INFO L273 TraceCheckUtils]: 7: Hoare triple {3287#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3287#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:14,189 INFO L273 TraceCheckUtils]: 8: Hoare triple {3287#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3288#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:14,189 INFO L273 TraceCheckUtils]: 9: Hoare triple {3288#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3288#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:14,190 INFO L273 TraceCheckUtils]: 10: Hoare triple {3288#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3289#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:14,190 INFO L273 TraceCheckUtils]: 11: Hoare triple {3289#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3289#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:14,192 INFO L273 TraceCheckUtils]: 12: Hoare triple {3289#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3290#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:14,192 INFO L273 TraceCheckUtils]: 13: Hoare triple {3290#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {3290#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:14,194 INFO L273 TraceCheckUtils]: 14: Hoare triple {3290#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:14,194 INFO L273 TraceCheckUtils]: 15: Hoare triple {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:14,195 INFO L273 TraceCheckUtils]: 16: Hoare triple {3291#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3292#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:14,196 INFO L273 TraceCheckUtils]: 17: Hoare triple {3292#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3292#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:14,197 INFO L273 TraceCheckUtils]: 18: Hoare triple {3292#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3351#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:14,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {3351#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {3285#false} is VALID [2018-11-23 13:05:14,199 INFO L256 TraceCheckUtils]: 20: Hoare triple {3285#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3285#false} is VALID [2018-11-23 13:05:14,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {3285#false} ~cond := #in~cond; {3285#false} is VALID [2018-11-23 13:05:14,199 INFO L273 TraceCheckUtils]: 22: Hoare triple {3285#false} assume 0 == ~cond; {3285#false} is VALID [2018-11-23 13:05:14,199 INFO L273 TraceCheckUtils]: 23: Hoare triple {3285#false} assume !false; {3285#false} is VALID [2018-11-23 13:05:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:14,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:14,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:05:14,220 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:05:14,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:14,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:05:14,247 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:05:14,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:05:14,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:05:14,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:05:14,248 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 11 states. [2018-11-23 13:05:14,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:14,846 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-23 13:05:14,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:05:14,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-11-23 13:05:14,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:14,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:05:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2018-11-23 13:05:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:05:14,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2018-11-23 13:05:14,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 37 transitions. [2018-11-23 13:05:14,891 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:05:14,892 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:05:14,892 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 13:05:14,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:05:14,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 13:05:14,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 13:05:14,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:14,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-23 13:05:14,951 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-23 13:05:14,951 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-23 13:05:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:14,952 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 13:05:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 13:05:14,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:14,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:14,953 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-23 13:05:14,953 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-23 13:05:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:14,955 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 13:05:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-11-23 13:05:14,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:14,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:14,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:14,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 13:05:14,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-11-23 13:05:14,956 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 24 [2018-11-23 13:05:14,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:14,956 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-11-23 13:05:14,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:05:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-11-23 13:05:14,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:05:14,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:14,957 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:14,957 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:14,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:14,958 INFO L82 PathProgramCache]: Analyzing trace with hash -81622240, now seen corresponding path program 8 times [2018-11-23 13:05:14,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:14,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:14,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:14,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:14,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:15,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {3590#true} call ULTIMATE.init(); {3590#true} is VALID [2018-11-23 13:05:15,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-23 13:05:15,218 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3590#true} {3590#true} #37#return; {3590#true} is VALID [2018-11-23 13:05:15,218 INFO L256 TraceCheckUtils]: 3: Hoare triple {3590#true} call #t~ret2 := main(); {3590#true} is VALID [2018-11-23 13:05:15,219 INFO L273 TraceCheckUtils]: 4: Hoare triple {3590#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {3592#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:15,220 INFO L273 TraceCheckUtils]: 5: Hoare triple {3592#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3592#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:15,221 INFO L273 TraceCheckUtils]: 6: Hoare triple {3592#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3593#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:15,221 INFO L273 TraceCheckUtils]: 7: Hoare triple {3593#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3593#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:15,222 INFO L273 TraceCheckUtils]: 8: Hoare triple {3593#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3594#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:15,222 INFO L273 TraceCheckUtils]: 9: Hoare triple {3594#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3594#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:15,223 INFO L273 TraceCheckUtils]: 10: Hoare triple {3594#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3595#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:15,224 INFO L273 TraceCheckUtils]: 11: Hoare triple {3595#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3595#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:15,224 INFO L273 TraceCheckUtils]: 12: Hoare triple {3595#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3596#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:15,225 INFO L273 TraceCheckUtils]: 13: Hoare triple {3596#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3596#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:15,226 INFO L273 TraceCheckUtils]: 14: Hoare triple {3596#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3597#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:15,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {3597#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {3597#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:15,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {3597#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3598#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:15,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {3598#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3598#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:15,230 INFO L273 TraceCheckUtils]: 18: Hoare triple {3598#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3599#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:15,231 INFO L273 TraceCheckUtils]: 19: Hoare triple {3599#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3599#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:15,232 INFO L273 TraceCheckUtils]: 20: Hoare triple {3599#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3600#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:15,233 INFO L273 TraceCheckUtils]: 21: Hoare triple {3600#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {3591#false} is VALID [2018-11-23 13:05:15,233 INFO L256 TraceCheckUtils]: 22: Hoare triple {3591#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3591#false} is VALID [2018-11-23 13:05:15,234 INFO L273 TraceCheckUtils]: 23: Hoare triple {3591#false} ~cond := #in~cond; {3591#false} is VALID [2018-11-23 13:05:15,234 INFO L273 TraceCheckUtils]: 24: Hoare triple {3591#false} assume 0 == ~cond; {3591#false} is VALID [2018-11-23 13:05:15,234 INFO L273 TraceCheckUtils]: 25: Hoare triple {3591#false} assume !false; {3591#false} is VALID [2018-11-23 13:05:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:15,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:15,236 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:05:15,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:15,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:15,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:15,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:15,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {3590#true} call ULTIMATE.init(); {3590#true} is VALID [2018-11-23 13:05:15,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {3590#true} assume true; {3590#true} is VALID [2018-11-23 13:05:15,439 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3590#true} {3590#true} #37#return; {3590#true} is VALID [2018-11-23 13:05:15,439 INFO L256 TraceCheckUtils]: 3: Hoare triple {3590#true} call #t~ret2 := main(); {3590#true} is VALID [2018-11-23 13:05:15,439 INFO L273 TraceCheckUtils]: 4: Hoare triple {3590#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {3592#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:15,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {3592#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3592#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:15,440 INFO L273 TraceCheckUtils]: 6: Hoare triple {3592#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3593#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:15,441 INFO L273 TraceCheckUtils]: 7: Hoare triple {3593#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3593#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:15,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {3593#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3594#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:15,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {3594#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3594#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:15,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {3594#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3595#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:15,444 INFO L273 TraceCheckUtils]: 11: Hoare triple {3595#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3595#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:15,445 INFO L273 TraceCheckUtils]: 12: Hoare triple {3595#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3596#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:15,446 INFO L273 TraceCheckUtils]: 13: Hoare triple {3596#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3596#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:15,447 INFO L273 TraceCheckUtils]: 14: Hoare triple {3596#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3597#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:15,448 INFO L273 TraceCheckUtils]: 15: Hoare triple {3597#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {3597#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:15,449 INFO L273 TraceCheckUtils]: 16: Hoare triple {3597#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3598#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:15,450 INFO L273 TraceCheckUtils]: 17: Hoare triple {3598#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3598#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:15,451 INFO L273 TraceCheckUtils]: 18: Hoare triple {3598#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3599#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:15,452 INFO L273 TraceCheckUtils]: 19: Hoare triple {3599#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3599#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:15,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {3599#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {3664#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:15,454 INFO L273 TraceCheckUtils]: 21: Hoare triple {3664#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 99); {3591#false} is VALID [2018-11-23 13:05:15,454 INFO L256 TraceCheckUtils]: 22: Hoare triple {3591#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3591#false} is VALID [2018-11-23 13:05:15,454 INFO L273 TraceCheckUtils]: 23: Hoare triple {3591#false} ~cond := #in~cond; {3591#false} is VALID [2018-11-23 13:05:15,455 INFO L273 TraceCheckUtils]: 24: Hoare triple {3591#false} assume 0 == ~cond; {3591#false} is VALID [2018-11-23 13:05:15,455 INFO L273 TraceCheckUtils]: 25: Hoare triple {3591#false} assume !false; {3591#false} is VALID [2018-11-23 13:05:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:15,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:15,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 13:05:15,475 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 13:05:15,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:15,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:05:15,507 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:05:15,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:05:15,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:05:15,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:05:15,508 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 12 states. [2018-11-23 13:05:16,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:16,176 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 13:05:16,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:05:16,176 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 13:05:16,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:16,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:05:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2018-11-23 13:05:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:05:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2018-11-23 13:05:16,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 41 transitions. [2018-11-23 13:05:16,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:16,238 INFO L225 Difference]: With dead ends: 50 [2018-11-23 13:05:16,238 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 13:05:16,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:05:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 13:05:16,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 13:05:16,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:16,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 44 states. [2018-11-23 13:05:16,358 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 44 states. [2018-11-23 13:05:16,358 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 44 states. [2018-11-23 13:05:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:16,360 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-23 13:05:16,360 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-23 13:05:16,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:16,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:16,361 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 45 states. [2018-11-23 13:05:16,361 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 45 states. [2018-11-23 13:05:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:16,363 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-23 13:05:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-23 13:05:16,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:16,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:16,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:16,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:16,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:05:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-23 13:05:16,364 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 26 [2018-11-23 13:05:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:16,365 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-23 13:05:16,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:05:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-23 13:05:16,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:05:16,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:16,366 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:16,366 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:16,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:16,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1517583600, now seen corresponding path program 8 times [2018-11-23 13:05:16,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:16,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:16,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:16,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:16,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:16,601 INFO L256 TraceCheckUtils]: 0: Hoare triple {3913#true} call ULTIMATE.init(); {3913#true} is VALID [2018-11-23 13:05:16,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {3913#true} assume true; {3913#true} is VALID [2018-11-23 13:05:16,602 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3913#true} {3913#true} #37#return; {3913#true} is VALID [2018-11-23 13:05:16,602 INFO L256 TraceCheckUtils]: 3: Hoare triple {3913#true} call #t~ret2 := main(); {3913#true} is VALID [2018-11-23 13:05:16,602 INFO L273 TraceCheckUtils]: 4: Hoare triple {3913#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {3915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:16,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {3915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:16,604 INFO L273 TraceCheckUtils]: 6: Hoare triple {3915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:16,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {3916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:16,606 INFO L273 TraceCheckUtils]: 8: Hoare triple {3916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:16,607 INFO L273 TraceCheckUtils]: 9: Hoare triple {3917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:16,608 INFO L273 TraceCheckUtils]: 10: Hoare triple {3917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:16,609 INFO L273 TraceCheckUtils]: 11: Hoare triple {3918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:16,610 INFO L273 TraceCheckUtils]: 12: Hoare triple {3918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:16,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {3919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {3919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:16,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {3919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:16,613 INFO L273 TraceCheckUtils]: 15: Hoare triple {3920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:16,614 INFO L273 TraceCheckUtils]: 16: Hoare triple {3920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:16,614 INFO L273 TraceCheckUtils]: 17: Hoare triple {3921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:16,616 INFO L273 TraceCheckUtils]: 18: Hoare triple {3921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:16,616 INFO L273 TraceCheckUtils]: 19: Hoare triple {3922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:16,618 INFO L273 TraceCheckUtils]: 20: Hoare triple {3922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3923#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:16,618 INFO L273 TraceCheckUtils]: 21: Hoare triple {3923#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {3914#false} is VALID [2018-11-23 13:05:16,619 INFO L256 TraceCheckUtils]: 22: Hoare triple {3914#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3914#false} is VALID [2018-11-23 13:05:16,619 INFO L273 TraceCheckUtils]: 23: Hoare triple {3914#false} ~cond := #in~cond; {3914#false} is VALID [2018-11-23 13:05:16,619 INFO L273 TraceCheckUtils]: 24: Hoare triple {3914#false} assume 0 == ~cond; {3914#false} is VALID [2018-11-23 13:05:16,619 INFO L273 TraceCheckUtils]: 25: Hoare triple {3914#false} assume !false; {3914#false} is VALID [2018-11-23 13:05:16,621 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:16,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:16,621 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:05:16,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:16,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:16,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:16,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:16,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {3913#true} call ULTIMATE.init(); {3913#true} is VALID [2018-11-23 13:05:16,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {3913#true} assume true; {3913#true} is VALID [2018-11-23 13:05:16,786 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3913#true} {3913#true} #37#return; {3913#true} is VALID [2018-11-23 13:05:16,787 INFO L256 TraceCheckUtils]: 3: Hoare triple {3913#true} call #t~ret2 := main(); {3913#true} is VALID [2018-11-23 13:05:16,806 INFO L273 TraceCheckUtils]: 4: Hoare triple {3913#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {3915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:16,809 INFO L273 TraceCheckUtils]: 5: Hoare triple {3915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:16,810 INFO L273 TraceCheckUtils]: 6: Hoare triple {3915#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:16,810 INFO L273 TraceCheckUtils]: 7: Hoare triple {3916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {3916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:16,811 INFO L273 TraceCheckUtils]: 8: Hoare triple {3916#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:16,811 INFO L273 TraceCheckUtils]: 9: Hoare triple {3917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {3917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:16,812 INFO L273 TraceCheckUtils]: 10: Hoare triple {3917#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:16,812 INFO L273 TraceCheckUtils]: 11: Hoare triple {3918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:16,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {3918#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:16,814 INFO L273 TraceCheckUtils]: 13: Hoare triple {3919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {3919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:16,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {3919#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:16,816 INFO L273 TraceCheckUtils]: 15: Hoare triple {3920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:16,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {3920#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:16,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {3921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:16,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {3921#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:16,820 INFO L273 TraceCheckUtils]: 19: Hoare triple {3922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {3922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:16,821 INFO L273 TraceCheckUtils]: 20: Hoare triple {3922#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {3987#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:16,822 INFO L273 TraceCheckUtils]: 21: Hoare triple {3987#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {3914#false} is VALID [2018-11-23 13:05:16,822 INFO L256 TraceCheckUtils]: 22: Hoare triple {3914#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3914#false} is VALID [2018-11-23 13:05:16,822 INFO L273 TraceCheckUtils]: 23: Hoare triple {3914#false} ~cond := #in~cond; {3914#false} is VALID [2018-11-23 13:05:16,823 INFO L273 TraceCheckUtils]: 24: Hoare triple {3914#false} assume 0 == ~cond; {3914#false} is VALID [2018-11-23 13:05:16,823 INFO L273 TraceCheckUtils]: 25: Hoare triple {3914#false} assume !false; {3914#false} is VALID [2018-11-23 13:05:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:16,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:16,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 13:05:16,844 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 13:05:16,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:16,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:05:16,875 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:05:16,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:05:16,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:05:16,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:05:16,876 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 12 states. [2018-11-23 13:05:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:17,418 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-23 13:05:17,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:05:17,419 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 13:05:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:17,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:05:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. [2018-11-23 13:05:17,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:05:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. [2018-11-23 13:05:17,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 39 transitions. [2018-11-23 13:05:17,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:17,859 INFO L225 Difference]: With dead ends: 52 [2018-11-23 13:05:17,859 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 13:05:17,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:05:17,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 13:05:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-23 13:05:17,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:17,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 46 states. [2018-11-23 13:05:17,955 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 46 states. [2018-11-23 13:05:17,955 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 46 states. [2018-11-23 13:05:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:17,959 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-23 13:05:17,959 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-23 13:05:17,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:17,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:17,959 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 47 states. [2018-11-23 13:05:17,959 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 47 states. [2018-11-23 13:05:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:17,960 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-23 13:05:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-23 13:05:17,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:17,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:17,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:17,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:05:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-23 13:05:17,961 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 26 [2018-11-23 13:05:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:17,962 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-23 13:05:17,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:05:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-23 13:05:17,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:05:17,962 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:17,963 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:17,963 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:17,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:17,963 INFO L82 PathProgramCache]: Analyzing trace with hash -54229283, now seen corresponding path program 9 times [2018-11-23 13:05:17,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:17,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:17,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:17,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:17,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:18,180 INFO L256 TraceCheckUtils]: 0: Hoare triple {4246#true} call ULTIMATE.init(); {4246#true} is VALID [2018-11-23 13:05:18,180 INFO L273 TraceCheckUtils]: 1: Hoare triple {4246#true} assume true; {4246#true} is VALID [2018-11-23 13:05:18,180 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4246#true} {4246#true} #37#return; {4246#true} is VALID [2018-11-23 13:05:18,180 INFO L256 TraceCheckUtils]: 3: Hoare triple {4246#true} call #t~ret2 := main(); {4246#true} is VALID [2018-11-23 13:05:18,181 INFO L273 TraceCheckUtils]: 4: Hoare triple {4246#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4248#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:18,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {4248#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4248#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:18,182 INFO L273 TraceCheckUtils]: 6: Hoare triple {4248#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4249#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:18,183 INFO L273 TraceCheckUtils]: 7: Hoare triple {4249#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4249#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:18,184 INFO L273 TraceCheckUtils]: 8: Hoare triple {4249#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4250#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:18,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {4250#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4250#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:18,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {4250#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4251#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:18,187 INFO L273 TraceCheckUtils]: 11: Hoare triple {4251#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4251#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:18,188 INFO L273 TraceCheckUtils]: 12: Hoare triple {4251#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4252#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:18,189 INFO L273 TraceCheckUtils]: 13: Hoare triple {4252#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4252#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:18,190 INFO L273 TraceCheckUtils]: 14: Hoare triple {4252#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4253#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:18,191 INFO L273 TraceCheckUtils]: 15: Hoare triple {4253#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {4253#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:18,192 INFO L273 TraceCheckUtils]: 16: Hoare triple {4253#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4254#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:18,193 INFO L273 TraceCheckUtils]: 17: Hoare triple {4254#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4254#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:18,194 INFO L273 TraceCheckUtils]: 18: Hoare triple {4254#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4255#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:18,194 INFO L273 TraceCheckUtils]: 19: Hoare triple {4255#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4255#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:18,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {4255#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4256#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:18,196 INFO L273 TraceCheckUtils]: 21: Hoare triple {4256#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {4256#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:18,197 INFO L273 TraceCheckUtils]: 22: Hoare triple {4256#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4257#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:18,198 INFO L273 TraceCheckUtils]: 23: Hoare triple {4257#(and (<= main_~x~0 9) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {4247#false} is VALID [2018-11-23 13:05:18,199 INFO L256 TraceCheckUtils]: 24: Hoare triple {4247#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4247#false} is VALID [2018-11-23 13:05:18,199 INFO L273 TraceCheckUtils]: 25: Hoare triple {4247#false} ~cond := #in~cond; {4247#false} is VALID [2018-11-23 13:05:18,199 INFO L273 TraceCheckUtils]: 26: Hoare triple {4247#false} assume 0 == ~cond; {4247#false} is VALID [2018-11-23 13:05:18,199 INFO L273 TraceCheckUtils]: 27: Hoare triple {4247#false} assume !false; {4247#false} is VALID [2018-11-23 13:05:18,201 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:18,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:18,201 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:05:18,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:18,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 13:05:18,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:18,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:18,415 INFO L256 TraceCheckUtils]: 0: Hoare triple {4246#true} call ULTIMATE.init(); {4246#true} is VALID [2018-11-23 13:05:18,416 INFO L273 TraceCheckUtils]: 1: Hoare triple {4246#true} assume true; {4246#true} is VALID [2018-11-23 13:05:18,416 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4246#true} {4246#true} #37#return; {4246#true} is VALID [2018-11-23 13:05:18,416 INFO L256 TraceCheckUtils]: 3: Hoare triple {4246#true} call #t~ret2 := main(); {4246#true} is VALID [2018-11-23 13:05:18,416 INFO L273 TraceCheckUtils]: 4: Hoare triple {4246#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4248#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:18,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {4248#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4248#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:18,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {4248#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4249#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:18,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {4249#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4249#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:18,419 INFO L273 TraceCheckUtils]: 8: Hoare triple {4249#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4250#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:18,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {4250#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4250#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:18,420 INFO L273 TraceCheckUtils]: 10: Hoare triple {4250#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4251#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:18,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {4251#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4251#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:18,422 INFO L273 TraceCheckUtils]: 12: Hoare triple {4251#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4252#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:18,422 INFO L273 TraceCheckUtils]: 13: Hoare triple {4252#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4252#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:18,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {4252#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4253#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:18,424 INFO L273 TraceCheckUtils]: 15: Hoare triple {4253#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {4253#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:18,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {4253#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4254#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:18,426 INFO L273 TraceCheckUtils]: 17: Hoare triple {4254#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4254#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:18,427 INFO L273 TraceCheckUtils]: 18: Hoare triple {4254#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4255#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:18,428 INFO L273 TraceCheckUtils]: 19: Hoare triple {4255#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4255#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:18,429 INFO L273 TraceCheckUtils]: 20: Hoare triple {4255#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4256#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:18,430 INFO L273 TraceCheckUtils]: 21: Hoare triple {4256#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {4256#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:18,431 INFO L273 TraceCheckUtils]: 22: Hoare triple {4256#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4327#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:18,432 INFO L273 TraceCheckUtils]: 23: Hoare triple {4327#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !(~x~0 % 4294967296 < 99); {4247#false} is VALID [2018-11-23 13:05:18,432 INFO L256 TraceCheckUtils]: 24: Hoare triple {4247#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4247#false} is VALID [2018-11-23 13:05:18,432 INFO L273 TraceCheckUtils]: 25: Hoare triple {4247#false} ~cond := #in~cond; {4247#false} is VALID [2018-11-23 13:05:18,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {4247#false} assume 0 == ~cond; {4247#false} is VALID [2018-11-23 13:05:18,433 INFO L273 TraceCheckUtils]: 27: Hoare triple {4247#false} assume !false; {4247#false} is VALID [2018-11-23 13:05:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:18,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:18,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 13:05:18,454 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-11-23 13:05:18,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:18,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:05:18,487 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:05:18,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:05:18,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:05:18,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:05:18,488 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 13 states. [2018-11-23 13:05:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:19,217 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 13:05:19,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:05:19,218 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-11-23 13:05:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:05:19,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2018-11-23 13:05:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:05:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2018-11-23 13:05:19,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2018-11-23 13:05:19,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:19,275 INFO L225 Difference]: With dead ends: 54 [2018-11-23 13:05:19,276 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 13:05:19,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 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:05:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 13:05:19,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-23 13:05:19,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:19,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 48 states. [2018-11-23 13:05:19,342 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 48 states. [2018-11-23 13:05:19,343 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 48 states. [2018-11-23 13:05:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:19,344 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-11-23 13:05:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-11-23 13:05:19,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:19,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:19,345 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 49 states. [2018-11-23 13:05:19,345 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 49 states. [2018-11-23 13:05:19,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:19,347 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-11-23 13:05:19,347 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-11-23 13:05:19,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:19,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:19,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:19,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:05:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-23 13:05:19,349 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 28 [2018-11-23 13:05:19,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:19,350 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-23 13:05:19,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:05:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-23 13:05:19,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:05:19,350 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:19,351 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:19,351 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:19,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:19,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1271335925, now seen corresponding path program 9 times [2018-11-23 13:05:19,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:19,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:19,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:19,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:19,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:20,372 INFO L256 TraceCheckUtils]: 0: Hoare triple {4596#true} call ULTIMATE.init(); {4596#true} is VALID [2018-11-23 13:05:20,372 INFO L273 TraceCheckUtils]: 1: Hoare triple {4596#true} assume true; {4596#true} is VALID [2018-11-23 13:05:20,372 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4596#true} {4596#true} #37#return; {4596#true} is VALID [2018-11-23 13:05:20,372 INFO L256 TraceCheckUtils]: 3: Hoare triple {4596#true} call #t~ret2 := main(); {4596#true} is VALID [2018-11-23 13:05:20,373 INFO L273 TraceCheckUtils]: 4: Hoare triple {4596#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4598#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:20,373 INFO L273 TraceCheckUtils]: 5: Hoare triple {4598#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4598#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:20,374 INFO L273 TraceCheckUtils]: 6: Hoare triple {4598#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4599#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:20,375 INFO L273 TraceCheckUtils]: 7: Hoare triple {4599#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4599#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:20,376 INFO L273 TraceCheckUtils]: 8: Hoare triple {4599#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4600#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:20,377 INFO L273 TraceCheckUtils]: 9: Hoare triple {4600#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4600#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:20,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {4600#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4601#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:20,379 INFO L273 TraceCheckUtils]: 11: Hoare triple {4601#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4601#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:20,380 INFO L273 TraceCheckUtils]: 12: Hoare triple {4601#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4602#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:20,381 INFO L273 TraceCheckUtils]: 13: Hoare triple {4602#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {4602#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:20,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {4602#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4603#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:20,383 INFO L273 TraceCheckUtils]: 15: Hoare triple {4603#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4603#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:20,384 INFO L273 TraceCheckUtils]: 16: Hoare triple {4603#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4604#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:20,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {4604#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4604#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:20,386 INFO L273 TraceCheckUtils]: 18: Hoare triple {4604#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4605#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:20,387 INFO L273 TraceCheckUtils]: 19: Hoare triple {4605#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4605#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:20,389 INFO L273 TraceCheckUtils]: 20: Hoare triple {4605#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4606#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:20,389 INFO L273 TraceCheckUtils]: 21: Hoare triple {4606#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4606#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:20,391 INFO L273 TraceCheckUtils]: 22: Hoare triple {4606#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4607#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:20,392 INFO L273 TraceCheckUtils]: 23: Hoare triple {4607#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {4597#false} is VALID [2018-11-23 13:05:20,392 INFO L256 TraceCheckUtils]: 24: Hoare triple {4597#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4597#false} is VALID [2018-11-23 13:05:20,392 INFO L273 TraceCheckUtils]: 25: Hoare triple {4597#false} ~cond := #in~cond; {4597#false} is VALID [2018-11-23 13:05:20,393 INFO L273 TraceCheckUtils]: 26: Hoare triple {4597#false} assume 0 == ~cond; {4597#false} is VALID [2018-11-23 13:05:20,393 INFO L273 TraceCheckUtils]: 27: Hoare triple {4597#false} assume !false; {4597#false} is VALID [2018-11-23 13:05:20,396 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:20,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:20,396 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:05:20,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:20,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 13:05:20,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:20,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:20,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {4596#true} call ULTIMATE.init(); {4596#true} is VALID [2018-11-23 13:05:20,793 INFO L273 TraceCheckUtils]: 1: Hoare triple {4596#true} assume true; {4596#true} is VALID [2018-11-23 13:05:20,793 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4596#true} {4596#true} #37#return; {4596#true} is VALID [2018-11-23 13:05:20,793 INFO L256 TraceCheckUtils]: 3: Hoare triple {4596#true} call #t~ret2 := main(); {4596#true} is VALID [2018-11-23 13:05:20,794 INFO L273 TraceCheckUtils]: 4: Hoare triple {4596#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4598#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:20,795 INFO L273 TraceCheckUtils]: 5: Hoare triple {4598#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4598#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:20,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {4598#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4599#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:20,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {4599#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4599#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:20,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {4599#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4600#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:20,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {4600#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4600#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:20,817 INFO L273 TraceCheckUtils]: 10: Hoare triple {4600#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4601#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:20,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {4601#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4601#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:20,840 INFO L273 TraceCheckUtils]: 12: Hoare triple {4601#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4602#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:20,849 INFO L273 TraceCheckUtils]: 13: Hoare triple {4602#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {4602#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:20,863 INFO L273 TraceCheckUtils]: 14: Hoare triple {4602#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4603#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:20,872 INFO L273 TraceCheckUtils]: 15: Hoare triple {4603#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4603#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:20,881 INFO L273 TraceCheckUtils]: 16: Hoare triple {4603#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4604#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:20,893 INFO L273 TraceCheckUtils]: 17: Hoare triple {4604#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4604#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:20,903 INFO L273 TraceCheckUtils]: 18: Hoare triple {4604#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4605#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:20,904 INFO L273 TraceCheckUtils]: 19: Hoare triple {4605#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4605#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:20,905 INFO L273 TraceCheckUtils]: 20: Hoare triple {4605#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4606#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:20,905 INFO L273 TraceCheckUtils]: 21: Hoare triple {4606#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4606#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:20,907 INFO L273 TraceCheckUtils]: 22: Hoare triple {4606#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {4677#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:20,908 INFO L273 TraceCheckUtils]: 23: Hoare triple {4677#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {4597#false} is VALID [2018-11-23 13:05:20,908 INFO L256 TraceCheckUtils]: 24: Hoare triple {4597#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4597#false} is VALID [2018-11-23 13:05:20,908 INFO L273 TraceCheckUtils]: 25: Hoare triple {4597#false} ~cond := #in~cond; {4597#false} is VALID [2018-11-23 13:05:20,909 INFO L273 TraceCheckUtils]: 26: Hoare triple {4597#false} assume 0 == ~cond; {4597#false} is VALID [2018-11-23 13:05:20,909 INFO L273 TraceCheckUtils]: 27: Hoare triple {4597#false} assume !false; {4597#false} is VALID [2018-11-23 13:05:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:20,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:20,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 13:05:20,929 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-11-23 13:05:20,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:20,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:05:20,970 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:05:20,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:05:20,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:05:20,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:05:20,972 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 13 states. [2018-11-23 13:05:21,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:21,831 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-23 13:05:21,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:05:21,831 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-11-23 13:05:21,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:05:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 41 transitions. [2018-11-23 13:05:21,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:05:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 41 transitions. [2018-11-23 13:05:21,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 41 transitions. [2018-11-23 13:05:21,900 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:21,902 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:05:21,902 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 13:05:21,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:05:21,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 13:05:21,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-23 13:05:21,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:21,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-23 13:05:21,955 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-23 13:05:21,955 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-23 13:05:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:21,956 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-23 13:05:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-23 13:05:21,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:21,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:21,957 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-23 13:05:21,957 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-23 13:05:21,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:21,958 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-23 13:05:21,958 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-23 13:05:21,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:21,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:21,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:21,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 13:05:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-11-23 13:05:21,960 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 28 [2018-11-23 13:05:21,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:21,961 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-11-23 13:05:21,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:05:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 13:05:21,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:05:21,961 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:21,961 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:21,962 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:21,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:21,962 INFO L82 PathProgramCache]: Analyzing trace with hash 500598618, now seen corresponding path program 10 times [2018-11-23 13:05:21,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:21,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:21,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:21,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:21,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:22,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {4956#true} call ULTIMATE.init(); {4956#true} is VALID [2018-11-23 13:05:22,232 INFO L273 TraceCheckUtils]: 1: Hoare triple {4956#true} assume true; {4956#true} is VALID [2018-11-23 13:05:22,232 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4956#true} {4956#true} #37#return; {4956#true} is VALID [2018-11-23 13:05:22,232 INFO L256 TraceCheckUtils]: 3: Hoare triple {4956#true} call #t~ret2 := main(); {4956#true} is VALID [2018-11-23 13:05:22,246 INFO L273 TraceCheckUtils]: 4: Hoare triple {4956#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4958#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:22,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {4958#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4958#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:22,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {4958#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4959#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:22,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {4959#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4959#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:22,249 INFO L273 TraceCheckUtils]: 8: Hoare triple {4959#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:22,249 INFO L273 TraceCheckUtils]: 9: Hoare triple {4960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:22,250 INFO L273 TraceCheckUtils]: 10: Hoare triple {4960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4961#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:22,250 INFO L273 TraceCheckUtils]: 11: Hoare triple {4961#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4961#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:22,251 INFO L273 TraceCheckUtils]: 12: Hoare triple {4961#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4962#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:22,252 INFO L273 TraceCheckUtils]: 13: Hoare triple {4962#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4962#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:22,253 INFO L273 TraceCheckUtils]: 14: Hoare triple {4962#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4963#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:22,254 INFO L273 TraceCheckUtils]: 15: Hoare triple {4963#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {4963#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:22,255 INFO L273 TraceCheckUtils]: 16: Hoare triple {4963#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4964#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:22,256 INFO L273 TraceCheckUtils]: 17: Hoare triple {4964#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4964#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:22,257 INFO L273 TraceCheckUtils]: 18: Hoare triple {4964#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4965#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:22,258 INFO L273 TraceCheckUtils]: 19: Hoare triple {4965#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4965#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:22,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {4965#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4966#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:22,259 INFO L273 TraceCheckUtils]: 21: Hoare triple {4966#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {4966#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:22,261 INFO L273 TraceCheckUtils]: 22: Hoare triple {4966#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4967#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:22,261 INFO L273 TraceCheckUtils]: 23: Hoare triple {4967#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {4967#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:22,263 INFO L273 TraceCheckUtils]: 24: Hoare triple {4967#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4968#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:22,263 INFO L273 TraceCheckUtils]: 25: Hoare triple {4968#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {4957#false} is VALID [2018-11-23 13:05:22,264 INFO L256 TraceCheckUtils]: 26: Hoare triple {4957#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4957#false} is VALID [2018-11-23 13:05:22,264 INFO L273 TraceCheckUtils]: 27: Hoare triple {4957#false} ~cond := #in~cond; {4957#false} is VALID [2018-11-23 13:05:22,264 INFO L273 TraceCheckUtils]: 28: Hoare triple {4957#false} assume 0 == ~cond; {4957#false} is VALID [2018-11-23 13:05:22,264 INFO L273 TraceCheckUtils]: 29: Hoare triple {4957#false} assume !false; {4957#false} is VALID [2018-11-23 13:05:22,266 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:22,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:22,267 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:05:22,278 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:22,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:22,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:22,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:22,425 INFO L256 TraceCheckUtils]: 0: Hoare triple {4956#true} call ULTIMATE.init(); {4956#true} is VALID [2018-11-23 13:05:22,426 INFO L273 TraceCheckUtils]: 1: Hoare triple {4956#true} assume true; {4956#true} is VALID [2018-11-23 13:05:22,426 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4956#true} {4956#true} #37#return; {4956#true} is VALID [2018-11-23 13:05:22,426 INFO L256 TraceCheckUtils]: 3: Hoare triple {4956#true} call #t~ret2 := main(); {4956#true} is VALID [2018-11-23 13:05:22,427 INFO L273 TraceCheckUtils]: 4: Hoare triple {4956#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {4958#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:22,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {4958#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4958#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:22,428 INFO L273 TraceCheckUtils]: 6: Hoare triple {4958#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4959#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:22,429 INFO L273 TraceCheckUtils]: 7: Hoare triple {4959#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4959#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:22,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {4959#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:22,431 INFO L273 TraceCheckUtils]: 9: Hoare triple {4960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {4960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:22,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {4960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4961#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:22,433 INFO L273 TraceCheckUtils]: 11: Hoare triple {4961#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4961#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:22,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {4961#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4962#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:22,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {4962#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {4962#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:22,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {4962#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4963#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:22,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {4963#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {4963#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:22,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {4963#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4964#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:22,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {4964#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4964#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:22,440 INFO L273 TraceCheckUtils]: 18: Hoare triple {4964#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4965#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:22,440 INFO L273 TraceCheckUtils]: 19: Hoare triple {4965#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {4965#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:22,441 INFO L273 TraceCheckUtils]: 20: Hoare triple {4965#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4966#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:22,442 INFO L273 TraceCheckUtils]: 21: Hoare triple {4966#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {4966#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:22,443 INFO L273 TraceCheckUtils]: 22: Hoare triple {4966#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {4967#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:22,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {4967#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {4967#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:22,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {4967#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5044#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:22,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {5044#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {4957#false} is VALID [2018-11-23 13:05:22,446 INFO L256 TraceCheckUtils]: 26: Hoare triple {4957#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4957#false} is VALID [2018-11-23 13:05:22,446 INFO L273 TraceCheckUtils]: 27: Hoare triple {4957#false} ~cond := #in~cond; {4957#false} is VALID [2018-11-23 13:05:22,447 INFO L273 TraceCheckUtils]: 28: Hoare triple {4957#false} assume 0 == ~cond; {4957#false} is VALID [2018-11-23 13:05:22,447 INFO L273 TraceCheckUtils]: 29: Hoare triple {4957#false} assume !false; {4957#false} is VALID [2018-11-23 13:05:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:22,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:22,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 13:05:22,467 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-11-23 13:05:22,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:22,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:05:22,501 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:05:22,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:05:22,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:05:22,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:05:22,502 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 14 states. [2018-11-23 13:05:23,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:23,463 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 13:05:23,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:05:23,463 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-11-23 13:05:23,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:05:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2018-11-23 13:05:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:05:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2018-11-23 13:05:23,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 46 transitions. [2018-11-23 13:05:23,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:23,547 INFO L225 Difference]: With dead ends: 58 [2018-11-23 13:05:23,548 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 13:05:23,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:05:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 13:05:23,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-23 13:05:23,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:23,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2018-11-23 13:05:23,611 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2018-11-23 13:05:23,611 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2018-11-23 13:05:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:23,613 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-11-23 13:05:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-23 13:05:23,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:23,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:23,613 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2018-11-23 13:05:23,613 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2018-11-23 13:05:23,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:23,614 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-11-23 13:05:23,614 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-11-23 13:05:23,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:23,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:23,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:23,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:23,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 13:05:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-11-23 13:05:23,615 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 30 [2018-11-23 13:05:23,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:23,616 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-11-23 13:05:23,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:05:23,616 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-11-23 13:05:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:05:23,616 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:23,616 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:23,616 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:23,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:23,617 INFO L82 PathProgramCache]: Analyzing trace with hash -850521530, now seen corresponding path program 10 times [2018-11-23 13:05:23,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:23,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:23,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:23,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:23,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:24,573 INFO L256 TraceCheckUtils]: 0: Hoare triple {5333#true} call ULTIMATE.init(); {5333#true} is VALID [2018-11-23 13:05:24,573 INFO L273 TraceCheckUtils]: 1: Hoare triple {5333#true} assume true; {5333#true} is VALID [2018-11-23 13:05:24,573 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5333#true} {5333#true} #37#return; {5333#true} is VALID [2018-11-23 13:05:24,574 INFO L256 TraceCheckUtils]: 3: Hoare triple {5333#true} call #t~ret2 := main(); {5333#true} is VALID [2018-11-23 13:05:24,574 INFO L273 TraceCheckUtils]: 4: Hoare triple {5333#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {5335#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:24,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {5335#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5335#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:24,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {5335#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5336#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:24,577 INFO L273 TraceCheckUtils]: 7: Hoare triple {5336#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5336#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:24,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {5336#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5337#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:24,579 INFO L273 TraceCheckUtils]: 9: Hoare triple {5337#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {5337#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:24,580 INFO L273 TraceCheckUtils]: 10: Hoare triple {5337#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5338#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:24,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {5338#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5338#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:24,582 INFO L273 TraceCheckUtils]: 12: Hoare triple {5338#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5339#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:24,583 INFO L273 TraceCheckUtils]: 13: Hoare triple {5339#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {5339#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:24,584 INFO L273 TraceCheckUtils]: 14: Hoare triple {5339#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5340#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:24,585 INFO L273 TraceCheckUtils]: 15: Hoare triple {5340#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5340#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:24,586 INFO L273 TraceCheckUtils]: 16: Hoare triple {5340#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5341#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:24,586 INFO L273 TraceCheckUtils]: 17: Hoare triple {5341#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5341#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:24,587 INFO L273 TraceCheckUtils]: 18: Hoare triple {5341#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5342#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:24,588 INFO L273 TraceCheckUtils]: 19: Hoare triple {5342#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5342#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:24,589 INFO L273 TraceCheckUtils]: 20: Hoare triple {5342#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5343#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:24,590 INFO L273 TraceCheckUtils]: 21: Hoare triple {5343#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5343#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:24,591 INFO L273 TraceCheckUtils]: 22: Hoare triple {5343#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5344#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:24,592 INFO L273 TraceCheckUtils]: 23: Hoare triple {5344#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5344#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:24,593 INFO L273 TraceCheckUtils]: 24: Hoare triple {5344#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5345#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:24,594 INFO L273 TraceCheckUtils]: 25: Hoare triple {5345#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 99); {5334#false} is VALID [2018-11-23 13:05:24,594 INFO L256 TraceCheckUtils]: 26: Hoare triple {5334#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5334#false} is VALID [2018-11-23 13:05:24,595 INFO L273 TraceCheckUtils]: 27: Hoare triple {5334#false} ~cond := #in~cond; {5334#false} is VALID [2018-11-23 13:05:24,595 INFO L273 TraceCheckUtils]: 28: Hoare triple {5334#false} assume 0 == ~cond; {5334#false} is VALID [2018-11-23 13:05:24,595 INFO L273 TraceCheckUtils]: 29: Hoare triple {5334#false} assume !false; {5334#false} is VALID [2018-11-23 13:05:24,597 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:24,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:24,597 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:24,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:24,617 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:24,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:24,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:24,710 INFO L256 TraceCheckUtils]: 0: Hoare triple {5333#true} call ULTIMATE.init(); {5333#true} is VALID [2018-11-23 13:05:24,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {5333#true} assume true; {5333#true} is VALID [2018-11-23 13:05:24,711 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5333#true} {5333#true} #37#return; {5333#true} is VALID [2018-11-23 13:05:24,711 INFO L256 TraceCheckUtils]: 3: Hoare triple {5333#true} call #t~ret2 := main(); {5333#true} is VALID [2018-11-23 13:05:24,712 INFO L273 TraceCheckUtils]: 4: Hoare triple {5333#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {5335#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:24,712 INFO L273 TraceCheckUtils]: 5: Hoare triple {5335#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5335#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:24,713 INFO L273 TraceCheckUtils]: 6: Hoare triple {5335#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5336#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:24,714 INFO L273 TraceCheckUtils]: 7: Hoare triple {5336#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5336#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:24,714 INFO L273 TraceCheckUtils]: 8: Hoare triple {5336#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5337#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:24,715 INFO L273 TraceCheckUtils]: 9: Hoare triple {5337#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {5337#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:24,716 INFO L273 TraceCheckUtils]: 10: Hoare triple {5337#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5338#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:24,717 INFO L273 TraceCheckUtils]: 11: Hoare triple {5338#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5338#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:24,718 INFO L273 TraceCheckUtils]: 12: Hoare triple {5338#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5339#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:24,718 INFO L273 TraceCheckUtils]: 13: Hoare triple {5339#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {5339#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:24,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {5339#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5340#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:24,720 INFO L273 TraceCheckUtils]: 15: Hoare triple {5340#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5340#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:24,721 INFO L273 TraceCheckUtils]: 16: Hoare triple {5340#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5341#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:24,722 INFO L273 TraceCheckUtils]: 17: Hoare triple {5341#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5341#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:24,723 INFO L273 TraceCheckUtils]: 18: Hoare triple {5341#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5342#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:24,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {5342#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5342#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:24,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {5342#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5343#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:24,726 INFO L273 TraceCheckUtils]: 21: Hoare triple {5343#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5343#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:24,727 INFO L273 TraceCheckUtils]: 22: Hoare triple {5343#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5344#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:24,728 INFO L273 TraceCheckUtils]: 23: Hoare triple {5344#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5344#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:24,729 INFO L273 TraceCheckUtils]: 24: Hoare triple {5344#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {5421#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:24,730 INFO L273 TraceCheckUtils]: 25: Hoare triple {5421#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 99); {5334#false} is VALID [2018-11-23 13:05:24,730 INFO L256 TraceCheckUtils]: 26: Hoare triple {5334#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5334#false} is VALID [2018-11-23 13:05:24,730 INFO L273 TraceCheckUtils]: 27: Hoare triple {5334#false} ~cond := #in~cond; {5334#false} is VALID [2018-11-23 13:05:24,731 INFO L273 TraceCheckUtils]: 28: Hoare triple {5334#false} assume 0 == ~cond; {5334#false} is VALID [2018-11-23 13:05:24,731 INFO L273 TraceCheckUtils]: 29: Hoare triple {5334#false} assume !false; {5334#false} is VALID [2018-11-23 13:05:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:24,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:24,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 13:05:24,754 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-11-23 13:05:24,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:24,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:05:24,791 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:05:24,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:05:24,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:05:24,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:05:24,792 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 14 states. [2018-11-23 13:05:25,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:25,650 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-23 13:05:25,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:05:25,651 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-11-23 13:05:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:05:25,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 43 transitions. [2018-11-23 13:05:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:05:25,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 43 transitions. [2018-11-23 13:05:25,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 43 transitions. [2018-11-23 13:05:25,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:25,772 INFO L225 Difference]: With dead ends: 60 [2018-11-23 13:05:25,772 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 13:05:25,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:05:25,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 13:05:25,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-23 13:05:25,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:25,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 54 states. [2018-11-23 13:05:25,864 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 54 states. [2018-11-23 13:05:25,864 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 54 states. [2018-11-23 13:05:25,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:25,866 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-23 13:05:25,866 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-23 13:05:25,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:25,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:25,867 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 55 states. [2018-11-23 13:05:25,867 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 55 states. [2018-11-23 13:05:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:25,868 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-23 13:05:25,868 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-11-23 13:05:25,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:25,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:25,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:25,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 13:05:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-11-23 13:05:25,870 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 30 [2018-11-23 13:05:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:25,870 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-11-23 13:05:25,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:05:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 13:05:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:05:25,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:25,871 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:25,872 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:25,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:25,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1114266775, now seen corresponding path program 11 times [2018-11-23 13:05:25,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:25,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:25,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:25,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:25,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:26,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {5720#true} call ULTIMATE.init(); {5720#true} is VALID [2018-11-23 13:05:26,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {5720#true} assume true; {5720#true} is VALID [2018-11-23 13:05:26,535 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5720#true} {5720#true} #37#return; {5720#true} is VALID [2018-11-23 13:05:26,536 INFO L256 TraceCheckUtils]: 3: Hoare triple {5720#true} call #t~ret2 := main(); {5720#true} is VALID [2018-11-23 13:05:26,536 INFO L273 TraceCheckUtils]: 4: Hoare triple {5720#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {5722#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:26,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {5722#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5722#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:26,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {5722#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5723#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:26,539 INFO L273 TraceCheckUtils]: 7: Hoare triple {5723#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5723#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:26,540 INFO L273 TraceCheckUtils]: 8: Hoare triple {5723#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:26,541 INFO L273 TraceCheckUtils]: 9: Hoare triple {5724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:26,542 INFO L273 TraceCheckUtils]: 10: Hoare triple {5724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5725#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:26,543 INFO L273 TraceCheckUtils]: 11: Hoare triple {5725#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5725#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:26,544 INFO L273 TraceCheckUtils]: 12: Hoare triple {5725#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5726#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:26,545 INFO L273 TraceCheckUtils]: 13: Hoare triple {5726#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {5726#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:26,546 INFO L273 TraceCheckUtils]: 14: Hoare triple {5726#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5727#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:26,547 INFO L273 TraceCheckUtils]: 15: Hoare triple {5727#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {5727#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:26,548 INFO L273 TraceCheckUtils]: 16: Hoare triple {5727#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5728#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:26,548 INFO L273 TraceCheckUtils]: 17: Hoare triple {5728#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5728#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:26,549 INFO L273 TraceCheckUtils]: 18: Hoare triple {5728#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5729#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:26,550 INFO L273 TraceCheckUtils]: 19: Hoare triple {5729#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5729#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:26,551 INFO L273 TraceCheckUtils]: 20: Hoare triple {5729#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5730#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:26,552 INFO L273 TraceCheckUtils]: 21: Hoare triple {5730#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {5730#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:26,553 INFO L273 TraceCheckUtils]: 22: Hoare triple {5730#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5731#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:26,554 INFO L273 TraceCheckUtils]: 23: Hoare triple {5731#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {5731#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:26,555 INFO L273 TraceCheckUtils]: 24: Hoare triple {5731#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5732#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:26,556 INFO L273 TraceCheckUtils]: 25: Hoare triple {5732#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5732#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:26,557 INFO L273 TraceCheckUtils]: 26: Hoare triple {5732#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5733#(and (<= main_~x~0 11) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:26,558 INFO L273 TraceCheckUtils]: 27: Hoare triple {5733#(and (<= main_~x~0 11) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {5721#false} is VALID [2018-11-23 13:05:26,558 INFO L256 TraceCheckUtils]: 28: Hoare triple {5721#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5721#false} is VALID [2018-11-23 13:05:26,558 INFO L273 TraceCheckUtils]: 29: Hoare triple {5721#false} ~cond := #in~cond; {5721#false} is VALID [2018-11-23 13:05:26,559 INFO L273 TraceCheckUtils]: 30: Hoare triple {5721#false} assume 0 == ~cond; {5721#false} is VALID [2018-11-23 13:05:26,559 INFO L273 TraceCheckUtils]: 31: Hoare triple {5721#false} assume !false; {5721#false} is VALID [2018-11-23 13:05:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:26,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:26,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:26,570 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:05:27,866 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 13:05:27,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:27,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:28,009 INFO L256 TraceCheckUtils]: 0: Hoare triple {5720#true} call ULTIMATE.init(); {5720#true} is VALID [2018-11-23 13:05:28,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {5720#true} assume true; {5720#true} is VALID [2018-11-23 13:05:28,010 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5720#true} {5720#true} #37#return; {5720#true} is VALID [2018-11-23 13:05:28,010 INFO L256 TraceCheckUtils]: 3: Hoare triple {5720#true} call #t~ret2 := main(); {5720#true} is VALID [2018-11-23 13:05:28,010 INFO L273 TraceCheckUtils]: 4: Hoare triple {5720#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {5722#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:28,011 INFO L273 TraceCheckUtils]: 5: Hoare triple {5722#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5722#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:28,011 INFO L273 TraceCheckUtils]: 6: Hoare triple {5722#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5723#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:28,012 INFO L273 TraceCheckUtils]: 7: Hoare triple {5723#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5723#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:28,013 INFO L273 TraceCheckUtils]: 8: Hoare triple {5723#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:28,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {5724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {5724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:28,015 INFO L273 TraceCheckUtils]: 10: Hoare triple {5724#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5725#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:28,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {5725#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5725#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:28,016 INFO L273 TraceCheckUtils]: 12: Hoare triple {5725#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5726#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:28,017 INFO L273 TraceCheckUtils]: 13: Hoare triple {5726#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {5726#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:28,018 INFO L273 TraceCheckUtils]: 14: Hoare triple {5726#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5727#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:28,019 INFO L273 TraceCheckUtils]: 15: Hoare triple {5727#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {5727#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:28,020 INFO L273 TraceCheckUtils]: 16: Hoare triple {5727#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5728#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:28,021 INFO L273 TraceCheckUtils]: 17: Hoare triple {5728#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5728#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:28,022 INFO L273 TraceCheckUtils]: 18: Hoare triple {5728#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5729#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:28,023 INFO L273 TraceCheckUtils]: 19: Hoare triple {5729#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5729#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:28,024 INFO L273 TraceCheckUtils]: 20: Hoare triple {5729#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5730#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:28,024 INFO L273 TraceCheckUtils]: 21: Hoare triple {5730#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {5730#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:28,026 INFO L273 TraceCheckUtils]: 22: Hoare triple {5730#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5731#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:28,026 INFO L273 TraceCheckUtils]: 23: Hoare triple {5731#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {5731#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:28,027 INFO L273 TraceCheckUtils]: 24: Hoare triple {5731#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5732#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:28,028 INFO L273 TraceCheckUtils]: 25: Hoare triple {5732#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {5732#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:28,029 INFO L273 TraceCheckUtils]: 26: Hoare triple {5732#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {5815#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:05:28,030 INFO L273 TraceCheckUtils]: 27: Hoare triple {5815#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !(~x~0 % 4294967296 < 99); {5721#false} is VALID [2018-11-23 13:05:28,030 INFO L256 TraceCheckUtils]: 28: Hoare triple {5721#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {5721#false} is VALID [2018-11-23 13:05:28,031 INFO L273 TraceCheckUtils]: 29: Hoare triple {5721#false} ~cond := #in~cond; {5721#false} is VALID [2018-11-23 13:05:28,031 INFO L273 TraceCheckUtils]: 30: Hoare triple {5721#false} assume 0 == ~cond; {5721#false} is VALID [2018-11-23 13:05:28,031 INFO L273 TraceCheckUtils]: 31: Hoare triple {5721#false} assume !false; {5721#false} is VALID [2018-11-23 13:05:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:28,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:28,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 13:05:28,052 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-11-23 13:05:28,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:28,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:05:28,088 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:05:28,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:05:28,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:05:28,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:05:28,089 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 15 states. [2018-11-23 13:05:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:29,526 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-23 13:05:29,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:05:29,526 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-11-23 13:05:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:05:29,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 48 transitions. [2018-11-23 13:05:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:05:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 48 transitions. [2018-11-23 13:05:29,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 48 transitions. [2018-11-23 13:05:29,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:29,584 INFO L225 Difference]: With dead ends: 62 [2018-11-23 13:05:29,584 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 13:05:29,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:05:29,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 13:05:29,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-23 13:05:29,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:29,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 56 states. [2018-11-23 13:05:29,645 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 56 states. [2018-11-23 13:05:29,645 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 56 states. [2018-11-23 13:05:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:29,647 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-23 13:05:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-23 13:05:29,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:29,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:29,648 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 57 states. [2018-11-23 13:05:29,648 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 57 states. [2018-11-23 13:05:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:29,650 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-23 13:05:29,650 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-11-23 13:05:29,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:29,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:29,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:29,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 13:05:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-11-23 13:05:29,652 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 32 [2018-11-23 13:05:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:29,652 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-11-23 13:05:29,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:05:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-11-23 13:05:29,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:05:29,653 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:29,653 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:29,653 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:29,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:29,653 INFO L82 PathProgramCache]: Analyzing trace with hash -174813759, now seen corresponding path program 11 times [2018-11-23 13:05:29,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:29,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:29,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:29,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:29,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:31,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {6124#true} call ULTIMATE.init(); {6124#true} is VALID [2018-11-23 13:05:31,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {6124#true} assume true; {6124#true} is VALID [2018-11-23 13:05:31,369 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6124#true} {6124#true} #37#return; {6124#true} is VALID [2018-11-23 13:05:31,369 INFO L256 TraceCheckUtils]: 3: Hoare triple {6124#true} call #t~ret2 := main(); {6124#true} is VALID [2018-11-23 13:05:31,374 INFO L273 TraceCheckUtils]: 4: Hoare triple {6124#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {6126#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:31,374 INFO L273 TraceCheckUtils]: 5: Hoare triple {6126#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6126#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:31,375 INFO L273 TraceCheckUtils]: 6: Hoare triple {6126#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6127#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:31,375 INFO L273 TraceCheckUtils]: 7: Hoare triple {6127#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6127#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:31,376 INFO L273 TraceCheckUtils]: 8: Hoare triple {6127#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6128#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:31,377 INFO L273 TraceCheckUtils]: 9: Hoare triple {6128#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {6128#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:31,377 INFO L273 TraceCheckUtils]: 10: Hoare triple {6128#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6129#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:31,379 INFO L273 TraceCheckUtils]: 11: Hoare triple {6129#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6129#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:31,380 INFO L273 TraceCheckUtils]: 12: Hoare triple {6129#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6130#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:31,381 INFO L273 TraceCheckUtils]: 13: Hoare triple {6130#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {6130#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:31,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {6130#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6131#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:31,384 INFO L273 TraceCheckUtils]: 15: Hoare triple {6131#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6131#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:31,385 INFO L273 TraceCheckUtils]: 16: Hoare triple {6131#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6132#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:31,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {6132#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6132#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:31,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {6132#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6133#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:31,388 INFO L273 TraceCheckUtils]: 19: Hoare triple {6133#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6133#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:31,389 INFO L273 TraceCheckUtils]: 20: Hoare triple {6133#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6134#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:31,390 INFO L273 TraceCheckUtils]: 21: Hoare triple {6134#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6134#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:31,391 INFO L273 TraceCheckUtils]: 22: Hoare triple {6134#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6135#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:31,392 INFO L273 TraceCheckUtils]: 23: Hoare triple {6135#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6135#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:31,393 INFO L273 TraceCheckUtils]: 24: Hoare triple {6135#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6136#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:31,394 INFO L273 TraceCheckUtils]: 25: Hoare triple {6136#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {6136#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:31,396 INFO L273 TraceCheckUtils]: 26: Hoare triple {6136#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6137#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:31,397 INFO L273 TraceCheckUtils]: 27: Hoare triple {6137#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {6125#false} is VALID [2018-11-23 13:05:31,397 INFO L256 TraceCheckUtils]: 28: Hoare triple {6125#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6125#false} is VALID [2018-11-23 13:05:31,397 INFO L273 TraceCheckUtils]: 29: Hoare triple {6125#false} ~cond := #in~cond; {6125#false} is VALID [2018-11-23 13:05:31,398 INFO L273 TraceCheckUtils]: 30: Hoare triple {6125#false} assume 0 == ~cond; {6125#false} is VALID [2018-11-23 13:05:31,398 INFO L273 TraceCheckUtils]: 31: Hoare triple {6125#false} assume !false; {6125#false} is VALID [2018-11-23 13:05:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:31,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:31,401 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:31,409 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:05:34,124 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 13:05:34,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:34,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:34,315 INFO L256 TraceCheckUtils]: 0: Hoare triple {6124#true} call ULTIMATE.init(); {6124#true} is VALID [2018-11-23 13:05:34,315 INFO L273 TraceCheckUtils]: 1: Hoare triple {6124#true} assume true; {6124#true} is VALID [2018-11-23 13:05:34,315 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6124#true} {6124#true} #37#return; {6124#true} is VALID [2018-11-23 13:05:34,315 INFO L256 TraceCheckUtils]: 3: Hoare triple {6124#true} call #t~ret2 := main(); {6124#true} is VALID [2018-11-23 13:05:34,316 INFO L273 TraceCheckUtils]: 4: Hoare triple {6124#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {6126#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:34,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {6126#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6126#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:34,317 INFO L273 TraceCheckUtils]: 6: Hoare triple {6126#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6127#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:34,317 INFO L273 TraceCheckUtils]: 7: Hoare triple {6127#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6127#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:34,318 INFO L273 TraceCheckUtils]: 8: Hoare triple {6127#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6128#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:34,318 INFO L273 TraceCheckUtils]: 9: Hoare triple {6128#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {6128#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:34,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {6128#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6129#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:34,320 INFO L273 TraceCheckUtils]: 11: Hoare triple {6129#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6129#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:34,321 INFO L273 TraceCheckUtils]: 12: Hoare triple {6129#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6130#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:34,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {6130#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {6130#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:34,323 INFO L273 TraceCheckUtils]: 14: Hoare triple {6130#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6131#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:34,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {6131#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6131#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:34,325 INFO L273 TraceCheckUtils]: 16: Hoare triple {6131#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6132#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:34,325 INFO L273 TraceCheckUtils]: 17: Hoare triple {6132#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6132#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:34,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {6132#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6133#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:34,327 INFO L273 TraceCheckUtils]: 19: Hoare triple {6133#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6133#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:34,328 INFO L273 TraceCheckUtils]: 20: Hoare triple {6133#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6134#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:34,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {6134#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6134#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:34,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {6134#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6135#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:34,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {6135#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6135#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:34,332 INFO L273 TraceCheckUtils]: 24: Hoare triple {6135#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6136#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:34,333 INFO L273 TraceCheckUtils]: 25: Hoare triple {6136#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {6136#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:34,334 INFO L273 TraceCheckUtils]: 26: Hoare triple {6136#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6219#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:05:34,335 INFO L273 TraceCheckUtils]: 27: Hoare triple {6219#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {6125#false} is VALID [2018-11-23 13:05:34,335 INFO L256 TraceCheckUtils]: 28: Hoare triple {6125#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6125#false} is VALID [2018-11-23 13:05:34,335 INFO L273 TraceCheckUtils]: 29: Hoare triple {6125#false} ~cond := #in~cond; {6125#false} is VALID [2018-11-23 13:05:34,335 INFO L273 TraceCheckUtils]: 30: Hoare triple {6125#false} assume 0 == ~cond; {6125#false} is VALID [2018-11-23 13:05:34,336 INFO L273 TraceCheckUtils]: 31: Hoare triple {6125#false} assume !false; {6125#false} is VALID [2018-11-23 13:05:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:34,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:34,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 13:05:34,357 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-11-23 13:05:34,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:34,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:05:34,396 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:05:34,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:05:34,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:05:34,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:05:34,398 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 15 states. [2018-11-23 13:05:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:35,730 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-23 13:05:35,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:05:35,730 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-11-23 13:05:35,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:35,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:05:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 45 transitions. [2018-11-23 13:05:35,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:05:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 45 transitions. [2018-11-23 13:05:35,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 45 transitions. [2018-11-23 13:05:35,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:35,794 INFO L225 Difference]: With dead ends: 64 [2018-11-23 13:05:35,794 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 13:05:35,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:05:35,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 13:05:35,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-23 13:05:35,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:35,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 58 states. [2018-11-23 13:05:35,848 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 58 states. [2018-11-23 13:05:35,849 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 58 states. [2018-11-23 13:05:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:35,850 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-23 13:05:35,850 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-23 13:05:35,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:35,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:35,850 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 59 states. [2018-11-23 13:05:35,850 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 59 states. [2018-11-23 13:05:35,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:35,852 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-23 13:05:35,852 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-11-23 13:05:35,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:35,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:35,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:35,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:35,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 13:05:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-11-23 13:05:35,854 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 32 [2018-11-23 13:05:35,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:35,854 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-11-23 13:05:35,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:05:35,855 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-11-23 13:05:35,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:05:35,855 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:35,855 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:35,855 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:35,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:35,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1856121196, now seen corresponding path program 12 times [2018-11-23 13:05:35,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:35,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:35,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:35,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:35,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:36,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {6538#true} call ULTIMATE.init(); {6538#true} is VALID [2018-11-23 13:05:36,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {6538#true} assume true; {6538#true} is VALID [2018-11-23 13:05:36,245 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6538#true} {6538#true} #37#return; {6538#true} is VALID [2018-11-23 13:05:36,245 INFO L256 TraceCheckUtils]: 3: Hoare triple {6538#true} call #t~ret2 := main(); {6538#true} is VALID [2018-11-23 13:05:36,246 INFO L273 TraceCheckUtils]: 4: Hoare triple {6538#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {6540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:36,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {6540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:36,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {6540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:36,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {6541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:36,249 INFO L273 TraceCheckUtils]: 8: Hoare triple {6541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6542#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:36,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {6542#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6542#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:36,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {6542#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6543#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:36,252 INFO L273 TraceCheckUtils]: 11: Hoare triple {6543#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6543#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:36,253 INFO L273 TraceCheckUtils]: 12: Hoare triple {6543#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6544#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:36,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {6544#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {6544#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:36,255 INFO L273 TraceCheckUtils]: 14: Hoare triple {6544#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6545#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:36,256 INFO L273 TraceCheckUtils]: 15: Hoare triple {6545#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {6545#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:36,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {6545#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6546#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:36,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {6546#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6546#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:36,259 INFO L273 TraceCheckUtils]: 18: Hoare triple {6546#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6547#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:36,259 INFO L273 TraceCheckUtils]: 19: Hoare triple {6547#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6547#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:36,260 INFO L273 TraceCheckUtils]: 20: Hoare triple {6547#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6548#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:36,261 INFO L273 TraceCheckUtils]: 21: Hoare triple {6548#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {6548#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:36,262 INFO L273 TraceCheckUtils]: 22: Hoare triple {6548#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6549#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:36,263 INFO L273 TraceCheckUtils]: 23: Hoare triple {6549#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {6549#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:36,264 INFO L273 TraceCheckUtils]: 24: Hoare triple {6549#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6550#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:36,265 INFO L273 TraceCheckUtils]: 25: Hoare triple {6550#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6550#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:36,266 INFO L273 TraceCheckUtils]: 26: Hoare triple {6550#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6551#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:05:36,267 INFO L273 TraceCheckUtils]: 27: Hoare triple {6551#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {6551#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:05:36,268 INFO L273 TraceCheckUtils]: 28: Hoare triple {6551#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6552#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:36,269 INFO L273 TraceCheckUtils]: 29: Hoare triple {6552#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {6539#false} is VALID [2018-11-23 13:05:36,269 INFO L256 TraceCheckUtils]: 30: Hoare triple {6539#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6539#false} is VALID [2018-11-23 13:05:36,269 INFO L273 TraceCheckUtils]: 31: Hoare triple {6539#false} ~cond := #in~cond; {6539#false} is VALID [2018-11-23 13:05:36,269 INFO L273 TraceCheckUtils]: 32: Hoare triple {6539#false} assume 0 == ~cond; {6539#false} is VALID [2018-11-23 13:05:36,270 INFO L273 TraceCheckUtils]: 33: Hoare triple {6539#false} assume !false; {6539#false} is VALID [2018-11-23 13:05:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:36,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:36,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:36,280 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:05:36,340 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 13:05:36,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:36,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:36,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {6538#true} call ULTIMATE.init(); {6538#true} is VALID [2018-11-23 13:05:36,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {6538#true} assume true; {6538#true} is VALID [2018-11-23 13:05:36,633 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6538#true} {6538#true} #37#return; {6538#true} is VALID [2018-11-23 13:05:36,633 INFO L256 TraceCheckUtils]: 3: Hoare triple {6538#true} call #t~ret2 := main(); {6538#true} is VALID [2018-11-23 13:05:36,634 INFO L273 TraceCheckUtils]: 4: Hoare triple {6538#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {6540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:36,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {6540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:36,636 INFO L273 TraceCheckUtils]: 6: Hoare triple {6540#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:36,637 INFO L273 TraceCheckUtils]: 7: Hoare triple {6541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:36,638 INFO L273 TraceCheckUtils]: 8: Hoare triple {6541#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6542#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:36,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {6542#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6542#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:36,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {6542#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6543#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:36,643 INFO L273 TraceCheckUtils]: 11: Hoare triple {6543#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6543#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:36,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {6543#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6544#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:36,645 INFO L273 TraceCheckUtils]: 13: Hoare triple {6544#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {6544#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:36,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {6544#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6545#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:36,647 INFO L273 TraceCheckUtils]: 15: Hoare triple {6545#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {6545#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:36,649 INFO L273 TraceCheckUtils]: 16: Hoare triple {6545#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6546#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:36,665 INFO L273 TraceCheckUtils]: 17: Hoare triple {6546#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6546#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:36,670 INFO L273 TraceCheckUtils]: 18: Hoare triple {6546#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6547#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:36,670 INFO L273 TraceCheckUtils]: 19: Hoare triple {6547#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6547#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:36,672 INFO L273 TraceCheckUtils]: 20: Hoare triple {6547#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6548#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:36,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {6548#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {6548#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:36,674 INFO L273 TraceCheckUtils]: 22: Hoare triple {6548#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6549#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:36,674 INFO L273 TraceCheckUtils]: 23: Hoare triple {6549#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {6549#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:36,676 INFO L273 TraceCheckUtils]: 24: Hoare triple {6549#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6550#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:36,676 INFO L273 TraceCheckUtils]: 25: Hoare triple {6550#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6550#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:36,678 INFO L273 TraceCheckUtils]: 26: Hoare triple {6550#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6551#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:05:36,678 INFO L273 TraceCheckUtils]: 27: Hoare triple {6551#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {6551#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:05:36,681 INFO L273 TraceCheckUtils]: 28: Hoare triple {6551#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {6640#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:36,681 INFO L273 TraceCheckUtils]: 29: Hoare triple {6640#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {6539#false} is VALID [2018-11-23 13:05:36,681 INFO L256 TraceCheckUtils]: 30: Hoare triple {6539#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6539#false} is VALID [2018-11-23 13:05:36,681 INFO L273 TraceCheckUtils]: 31: Hoare triple {6539#false} ~cond := #in~cond; {6539#false} is VALID [2018-11-23 13:05:36,682 INFO L273 TraceCheckUtils]: 32: Hoare triple {6539#false} assume 0 == ~cond; {6539#false} is VALID [2018-11-23 13:05:36,682 INFO L273 TraceCheckUtils]: 33: Hoare triple {6539#false} assume !false; {6539#false} is VALID [2018-11-23 13:05:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:36,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:36,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 13:05:36,702 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-11-23 13:05:36,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:36,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:05:36,749 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:05:36,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:05:36,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:05:36,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:05:36,750 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 16 states. [2018-11-23 13:05:38,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:38,422 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 13:05:38,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:05:38,423 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-11-23 13:05:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:05:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 51 transitions. [2018-11-23 13:05:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:05:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 51 transitions. [2018-11-23 13:05:38,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 51 transitions. [2018-11-23 13:05:38,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:38,485 INFO L225 Difference]: With dead ends: 66 [2018-11-23 13:05:38,485 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 13:05:38,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:05:38,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 13:05:38,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-23 13:05:38,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:38,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 60 states. [2018-11-23 13:05:38,542 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 60 states. [2018-11-23 13:05:38,543 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 60 states. [2018-11-23 13:05:38,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:38,544 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-23 13:05:38,544 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-23 13:05:38,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:38,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:38,545 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 61 states. [2018-11-23 13:05:38,545 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 61 states. [2018-11-23 13:05:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:38,546 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-23 13:05:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-11-23 13:05:38,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:38,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:38,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:38,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 13:05:38,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-11-23 13:05:38,548 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2018-11-23 13:05:38,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:38,549 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-11-23 13:05:38,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:05:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-11-23 13:05:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:05:38,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:38,549 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:38,549 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:38,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:38,550 INFO L82 PathProgramCache]: Analyzing trace with hash 640292476, now seen corresponding path program 12 times [2018-11-23 13:05:38,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:38,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:38,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:38,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:38,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:39,054 INFO L256 TraceCheckUtils]: 0: Hoare triple {6969#true} call ULTIMATE.init(); {6969#true} is VALID [2018-11-23 13:05:39,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {6969#true} assume true; {6969#true} is VALID [2018-11-23 13:05:39,054 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6969#true} {6969#true} #37#return; {6969#true} is VALID [2018-11-23 13:05:39,055 INFO L256 TraceCheckUtils]: 3: Hoare triple {6969#true} call #t~ret2 := main(); {6969#true} is VALID [2018-11-23 13:05:39,055 INFO L273 TraceCheckUtils]: 4: Hoare triple {6969#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {6971#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:39,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {6971#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6971#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:39,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {6971#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6972#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:39,058 INFO L273 TraceCheckUtils]: 7: Hoare triple {6972#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6972#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:39,059 INFO L273 TraceCheckUtils]: 8: Hoare triple {6972#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:39,059 INFO L273 TraceCheckUtils]: 9: Hoare triple {6973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {6973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:39,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {6973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6974#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:39,060 INFO L273 TraceCheckUtils]: 11: Hoare triple {6974#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6974#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:39,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {6974#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6975#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:39,062 INFO L273 TraceCheckUtils]: 13: Hoare triple {6975#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {6975#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:39,063 INFO L273 TraceCheckUtils]: 14: Hoare triple {6975#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6976#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:39,064 INFO L273 TraceCheckUtils]: 15: Hoare triple {6976#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6976#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:39,065 INFO L273 TraceCheckUtils]: 16: Hoare triple {6976#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6977#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:39,066 INFO L273 TraceCheckUtils]: 17: Hoare triple {6977#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6977#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:39,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {6977#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6978#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:39,067 INFO L273 TraceCheckUtils]: 19: Hoare triple {6978#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6978#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:39,069 INFO L273 TraceCheckUtils]: 20: Hoare triple {6978#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6979#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:39,069 INFO L273 TraceCheckUtils]: 21: Hoare triple {6979#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6979#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:39,070 INFO L273 TraceCheckUtils]: 22: Hoare triple {6979#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6980#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:39,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {6980#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6980#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:39,072 INFO L273 TraceCheckUtils]: 24: Hoare triple {6980#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6981#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:39,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {6981#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {6981#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:39,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {6981#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6982#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:05:39,075 INFO L273 TraceCheckUtils]: 27: Hoare triple {6982#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6982#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:05:39,076 INFO L273 TraceCheckUtils]: 28: Hoare triple {6982#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6983#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:39,077 INFO L273 TraceCheckUtils]: 29: Hoare triple {6983#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {6970#false} is VALID [2018-11-23 13:05:39,077 INFO L256 TraceCheckUtils]: 30: Hoare triple {6970#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6970#false} is VALID [2018-11-23 13:05:39,077 INFO L273 TraceCheckUtils]: 31: Hoare triple {6970#false} ~cond := #in~cond; {6970#false} is VALID [2018-11-23 13:05:39,078 INFO L273 TraceCheckUtils]: 32: Hoare triple {6970#false} assume 0 == ~cond; {6970#false} is VALID [2018-11-23 13:05:39,078 INFO L273 TraceCheckUtils]: 33: Hoare triple {6970#false} assume !false; {6970#false} is VALID [2018-11-23 13:05:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:39,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:39,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:39,089 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:05:51,178 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 13:05:51,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:51,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:51,306 INFO L256 TraceCheckUtils]: 0: Hoare triple {6969#true} call ULTIMATE.init(); {6969#true} is VALID [2018-11-23 13:05:51,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {6969#true} assume true; {6969#true} is VALID [2018-11-23 13:05:51,307 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {6969#true} {6969#true} #37#return; {6969#true} is VALID [2018-11-23 13:05:51,307 INFO L256 TraceCheckUtils]: 3: Hoare triple {6969#true} call #t~ret2 := main(); {6969#true} is VALID [2018-11-23 13:05:51,308 INFO L273 TraceCheckUtils]: 4: Hoare triple {6969#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {6971#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:51,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {6971#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6971#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:51,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {6971#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6972#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:51,309 INFO L273 TraceCheckUtils]: 7: Hoare triple {6972#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {6972#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:51,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {6972#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:51,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {6973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {6973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:51,311 INFO L273 TraceCheckUtils]: 10: Hoare triple {6973#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6974#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:51,312 INFO L273 TraceCheckUtils]: 11: Hoare triple {6974#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6974#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:51,313 INFO L273 TraceCheckUtils]: 12: Hoare triple {6974#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6975#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:51,314 INFO L273 TraceCheckUtils]: 13: Hoare triple {6975#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {6975#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:51,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {6975#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6976#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:51,316 INFO L273 TraceCheckUtils]: 15: Hoare triple {6976#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6976#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:51,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {6976#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6977#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:51,318 INFO L273 TraceCheckUtils]: 17: Hoare triple {6977#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6977#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:51,319 INFO L273 TraceCheckUtils]: 18: Hoare triple {6977#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6978#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:51,319 INFO L273 TraceCheckUtils]: 19: Hoare triple {6978#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6978#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:51,321 INFO L273 TraceCheckUtils]: 20: Hoare triple {6978#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6979#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:51,321 INFO L273 TraceCheckUtils]: 21: Hoare triple {6979#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6979#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:51,322 INFO L273 TraceCheckUtils]: 22: Hoare triple {6979#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6980#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:51,323 INFO L273 TraceCheckUtils]: 23: Hoare triple {6980#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6980#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:51,324 INFO L273 TraceCheckUtils]: 24: Hoare triple {6980#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6981#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:51,325 INFO L273 TraceCheckUtils]: 25: Hoare triple {6981#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {6981#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:51,326 INFO L273 TraceCheckUtils]: 26: Hoare triple {6981#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {6982#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:05:51,327 INFO L273 TraceCheckUtils]: 27: Hoare triple {6982#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {6982#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:05:51,328 INFO L273 TraceCheckUtils]: 28: Hoare triple {6982#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7071#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:05:51,329 INFO L273 TraceCheckUtils]: 29: Hoare triple {7071#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {6970#false} is VALID [2018-11-23 13:05:51,329 INFO L256 TraceCheckUtils]: 30: Hoare triple {6970#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {6970#false} is VALID [2018-11-23 13:05:51,329 INFO L273 TraceCheckUtils]: 31: Hoare triple {6970#false} ~cond := #in~cond; {6970#false} is VALID [2018-11-23 13:05:51,329 INFO L273 TraceCheckUtils]: 32: Hoare triple {6970#false} assume 0 == ~cond; {6970#false} is VALID [2018-11-23 13:05:51,330 INFO L273 TraceCheckUtils]: 33: Hoare triple {6970#false} assume !false; {6970#false} is VALID [2018-11-23 13:05:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:51,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:51,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 13:05:51,352 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-11-23 13:05:51,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:51,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:05:51,393 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:05:51,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:05:51,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:05:51,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:05:51,394 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 16 states. [2018-11-23 13:05:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:52,535 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-23 13:05:52,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:05:52,535 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-11-23 13:05:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:52,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:05:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 47 transitions. [2018-11-23 13:05:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:05:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 47 transitions. [2018-11-23 13:05:52,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 47 transitions. [2018-11-23 13:05:52,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:52,645 INFO L225 Difference]: With dead ends: 68 [2018-11-23 13:05:52,645 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 13:05:52,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:05:52,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 13:05:52,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-11-23 13:05:52,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:52,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2018-11-23 13:05:52,765 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2018-11-23 13:05:52,765 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2018-11-23 13:05:52,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:52,766 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-23 13:05:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-23 13:05:52,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:52,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:52,768 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2018-11-23 13:05:52,768 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2018-11-23 13:05:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:52,770 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-23 13:05:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-23 13:05:52,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:52,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:52,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:52,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 13:05:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-11-23 13:05:52,772 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 34 [2018-11-23 13:05:52,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:52,772 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-11-23 13:05:52,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:05:52,772 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-11-23 13:05:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:05:52,773 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:52,773 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:52,773 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:52,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:52,773 INFO L82 PathProgramCache]: Analyzing trace with hash -245709487, now seen corresponding path program 13 times [2018-11-23 13:05:52,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:52,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:52,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:52,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:52,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:53,064 INFO L256 TraceCheckUtils]: 0: Hoare triple {7410#true} call ULTIMATE.init(); {7410#true} is VALID [2018-11-23 13:05:53,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {7410#true} assume true; {7410#true} is VALID [2018-11-23 13:05:53,064 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7410#true} {7410#true} #37#return; {7410#true} is VALID [2018-11-23 13:05:53,064 INFO L256 TraceCheckUtils]: 3: Hoare triple {7410#true} call #t~ret2 := main(); {7410#true} is VALID [2018-11-23 13:05:53,065 INFO L273 TraceCheckUtils]: 4: Hoare triple {7410#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {7412#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:53,065 INFO L273 TraceCheckUtils]: 5: Hoare triple {7412#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7412#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:53,067 INFO L273 TraceCheckUtils]: 6: Hoare triple {7412#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7413#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:53,067 INFO L273 TraceCheckUtils]: 7: Hoare triple {7413#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7413#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:53,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {7413#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7414#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:53,069 INFO L273 TraceCheckUtils]: 9: Hoare triple {7414#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {7414#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:53,070 INFO L273 TraceCheckUtils]: 10: Hoare triple {7414#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7415#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:53,071 INFO L273 TraceCheckUtils]: 11: Hoare triple {7415#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7415#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:53,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {7415#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7416#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:53,073 INFO L273 TraceCheckUtils]: 13: Hoare triple {7416#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {7416#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:53,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {7416#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7417#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:53,075 INFO L273 TraceCheckUtils]: 15: Hoare triple {7417#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {7417#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:53,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {7417#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7418#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:53,076 INFO L273 TraceCheckUtils]: 17: Hoare triple {7418#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7418#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:53,078 INFO L273 TraceCheckUtils]: 18: Hoare triple {7418#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7419#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:53,078 INFO L273 TraceCheckUtils]: 19: Hoare triple {7419#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7419#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:53,079 INFO L273 TraceCheckUtils]: 20: Hoare triple {7419#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7420#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:53,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {7420#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {7420#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:53,081 INFO L273 TraceCheckUtils]: 22: Hoare triple {7420#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7421#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:53,082 INFO L273 TraceCheckUtils]: 23: Hoare triple {7421#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {7421#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:53,083 INFO L273 TraceCheckUtils]: 24: Hoare triple {7421#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7422#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:53,084 INFO L273 TraceCheckUtils]: 25: Hoare triple {7422#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7422#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:53,085 INFO L273 TraceCheckUtils]: 26: Hoare triple {7422#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7423#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:05:53,085 INFO L273 TraceCheckUtils]: 27: Hoare triple {7423#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {7423#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:05:53,087 INFO L273 TraceCheckUtils]: 28: Hoare triple {7423#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7424#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:53,087 INFO L273 TraceCheckUtils]: 29: Hoare triple {7424#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7424#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:53,089 INFO L273 TraceCheckUtils]: 30: Hoare triple {7424#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7425#(and (<= main_~x~0 13) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:53,089 INFO L273 TraceCheckUtils]: 31: Hoare triple {7425#(and (<= main_~x~0 13) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {7411#false} is VALID [2018-11-23 13:05:53,090 INFO L256 TraceCheckUtils]: 32: Hoare triple {7411#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7411#false} is VALID [2018-11-23 13:05:53,090 INFO L273 TraceCheckUtils]: 33: Hoare triple {7411#false} ~cond := #in~cond; {7411#false} is VALID [2018-11-23 13:05:53,090 INFO L273 TraceCheckUtils]: 34: Hoare triple {7411#false} assume 0 == ~cond; {7411#false} is VALID [2018-11-23 13:05:53,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {7411#false} assume !false; {7411#false} is VALID [2018-11-23 13:05:53,092 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:53,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:53,093 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:53,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:53,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:53,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {7410#true} call ULTIMATE.init(); {7410#true} is VALID [2018-11-23 13:05:53,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {7410#true} assume true; {7410#true} is VALID [2018-11-23 13:05:53,252 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7410#true} {7410#true} #37#return; {7410#true} is VALID [2018-11-23 13:05:53,252 INFO L256 TraceCheckUtils]: 3: Hoare triple {7410#true} call #t~ret2 := main(); {7410#true} is VALID [2018-11-23 13:05:53,253 INFO L273 TraceCheckUtils]: 4: Hoare triple {7410#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {7412#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:53,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {7412#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7412#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:53,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {7412#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7413#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:53,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {7413#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7413#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:53,255 INFO L273 TraceCheckUtils]: 8: Hoare triple {7413#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7414#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:53,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {7414#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {7414#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:53,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {7414#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7415#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:53,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {7415#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7415#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:53,259 INFO L273 TraceCheckUtils]: 12: Hoare triple {7415#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7416#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:53,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {7416#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {7416#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:53,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {7416#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7417#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:53,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {7417#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {7417#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:53,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {7417#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7418#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:53,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {7418#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7418#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:53,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {7418#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7419#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:53,266 INFO L273 TraceCheckUtils]: 19: Hoare triple {7419#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7419#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:53,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {7419#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7420#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:53,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {7420#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {7420#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:53,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {7420#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7421#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:53,269 INFO L273 TraceCheckUtils]: 23: Hoare triple {7421#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {7421#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:53,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {7421#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7422#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:53,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {7422#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7422#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:53,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {7422#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7423#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:05:53,273 INFO L273 TraceCheckUtils]: 27: Hoare triple {7423#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {7423#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:05:53,274 INFO L273 TraceCheckUtils]: 28: Hoare triple {7423#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7424#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:53,275 INFO L273 TraceCheckUtils]: 29: Hoare triple {7424#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7424#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:53,276 INFO L273 TraceCheckUtils]: 30: Hoare triple {7424#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {7519#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:05:53,277 INFO L273 TraceCheckUtils]: 31: Hoare triple {7519#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {7411#false} is VALID [2018-11-23 13:05:53,277 INFO L256 TraceCheckUtils]: 32: Hoare triple {7411#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7411#false} is VALID [2018-11-23 13:05:53,277 INFO L273 TraceCheckUtils]: 33: Hoare triple {7411#false} ~cond := #in~cond; {7411#false} is VALID [2018-11-23 13:05:53,277 INFO L273 TraceCheckUtils]: 34: Hoare triple {7411#false} assume 0 == ~cond; {7411#false} is VALID [2018-11-23 13:05:53,278 INFO L273 TraceCheckUtils]: 35: Hoare triple {7411#false} assume !false; {7411#false} is VALID [2018-11-23 13:05:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:53,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:53,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 13:05:53,300 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-11-23 13:05:53,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:53,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:05:53,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:53,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:05:53,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:05:53,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:05:53,352 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 17 states. [2018-11-23 13:05:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:54,861 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-23 13:05:54,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:05:54,861 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-11-23 13:05:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:05:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 53 transitions. [2018-11-23 13:05:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:05:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 53 transitions. [2018-11-23 13:05:54,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 53 transitions. [2018-11-23 13:05:54,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:54,931 INFO L225 Difference]: With dead ends: 70 [2018-11-23 13:05:54,931 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 13:05:54,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 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:05:54,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 13:05:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-11-23 13:05:55,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:55,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 64 states. [2018-11-23 13:05:55,081 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 64 states. [2018-11-23 13:05:55,081 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 64 states. [2018-11-23 13:05:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:55,082 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-11-23 13:05:55,082 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-11-23 13:05:55,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:55,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:55,083 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 65 states. [2018-11-23 13:05:55,083 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 65 states. [2018-11-23 13:05:55,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:55,085 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-11-23 13:05:55,085 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-11-23 13:05:55,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:55,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:55,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:55,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:55,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 13:05:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-11-23 13:05:55,087 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 36 [2018-11-23 13:05:55,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:55,087 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-11-23 13:05:55,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:05:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-11-23 13:05:55,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:05:55,088 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:55,088 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:55,088 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:55,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:55,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2021630857, now seen corresponding path program 13 times [2018-11-23 13:05:55,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:55,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:55,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:55,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:55,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:56,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {7868#true} call ULTIMATE.init(); {7868#true} is VALID [2018-11-23 13:05:56,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {7868#true} assume true; {7868#true} is VALID [2018-11-23 13:05:56,111 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7868#true} {7868#true} #37#return; {7868#true} is VALID [2018-11-23 13:05:56,111 INFO L256 TraceCheckUtils]: 3: Hoare triple {7868#true} call #t~ret2 := main(); {7868#true} is VALID [2018-11-23 13:05:56,112 INFO L273 TraceCheckUtils]: 4: Hoare triple {7868#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {7870#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:56,112 INFO L273 TraceCheckUtils]: 5: Hoare triple {7870#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7870#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:56,113 INFO L273 TraceCheckUtils]: 6: Hoare triple {7870#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:56,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {7871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {7871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:56,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {7871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7872#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:56,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {7872#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {7872#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:56,117 INFO L273 TraceCheckUtils]: 10: Hoare triple {7872#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7873#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:56,118 INFO L273 TraceCheckUtils]: 11: Hoare triple {7873#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7873#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:56,119 INFO L273 TraceCheckUtils]: 12: Hoare triple {7873#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7874#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:56,120 INFO L273 TraceCheckUtils]: 13: Hoare triple {7874#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {7874#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:56,121 INFO L273 TraceCheckUtils]: 14: Hoare triple {7874#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7875#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:56,122 INFO L273 TraceCheckUtils]: 15: Hoare triple {7875#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7875#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:56,123 INFO L273 TraceCheckUtils]: 16: Hoare triple {7875#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7876#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:56,123 INFO L273 TraceCheckUtils]: 17: Hoare triple {7876#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7876#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:56,125 INFO L273 TraceCheckUtils]: 18: Hoare triple {7876#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7877#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:56,125 INFO L273 TraceCheckUtils]: 19: Hoare triple {7877#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7877#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:56,126 INFO L273 TraceCheckUtils]: 20: Hoare triple {7877#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7878#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:56,127 INFO L273 TraceCheckUtils]: 21: Hoare triple {7878#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7878#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:56,128 INFO L273 TraceCheckUtils]: 22: Hoare triple {7878#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7879#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:56,129 INFO L273 TraceCheckUtils]: 23: Hoare triple {7879#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7879#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:56,130 INFO L273 TraceCheckUtils]: 24: Hoare triple {7879#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7880#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:56,131 INFO L273 TraceCheckUtils]: 25: Hoare triple {7880#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {7880#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:56,132 INFO L273 TraceCheckUtils]: 26: Hoare triple {7880#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7881#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:05:56,133 INFO L273 TraceCheckUtils]: 27: Hoare triple {7881#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7881#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:05:56,134 INFO L273 TraceCheckUtils]: 28: Hoare triple {7881#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7882#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:05:56,134 INFO L273 TraceCheckUtils]: 29: Hoare triple {7882#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7882#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:05:56,136 INFO L273 TraceCheckUtils]: 30: Hoare triple {7882#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7883#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:56,137 INFO L273 TraceCheckUtils]: 31: Hoare triple {7883#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {7869#false} is VALID [2018-11-23 13:05:56,137 INFO L256 TraceCheckUtils]: 32: Hoare triple {7869#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7869#false} is VALID [2018-11-23 13:05:56,137 INFO L273 TraceCheckUtils]: 33: Hoare triple {7869#false} ~cond := #in~cond; {7869#false} is VALID [2018-11-23 13:05:56,137 INFO L273 TraceCheckUtils]: 34: Hoare triple {7869#false} assume 0 == ~cond; {7869#false} is VALID [2018-11-23 13:05:56,137 INFO L273 TraceCheckUtils]: 35: Hoare triple {7869#false} assume !false; {7869#false} is VALID [2018-11-23 13:05:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:56,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:56,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:56,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:56,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:56,296 INFO L256 TraceCheckUtils]: 0: Hoare triple {7868#true} call ULTIMATE.init(); {7868#true} is VALID [2018-11-23 13:05:56,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {7868#true} assume true; {7868#true} is VALID [2018-11-23 13:05:56,296 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7868#true} {7868#true} #37#return; {7868#true} is VALID [2018-11-23 13:05:56,296 INFO L256 TraceCheckUtils]: 3: Hoare triple {7868#true} call #t~ret2 := main(); {7868#true} is VALID [2018-11-23 13:05:56,298 INFO L273 TraceCheckUtils]: 4: Hoare triple {7868#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {7870#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:56,299 INFO L273 TraceCheckUtils]: 5: Hoare triple {7870#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7870#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:56,300 INFO L273 TraceCheckUtils]: 6: Hoare triple {7870#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:56,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {7871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {7871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:56,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {7871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7872#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:56,303 INFO L273 TraceCheckUtils]: 9: Hoare triple {7872#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {7872#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:56,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {7872#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7873#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:56,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {7873#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7873#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:56,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {7873#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7874#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:56,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {7874#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {7874#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:56,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {7874#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7875#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:56,308 INFO L273 TraceCheckUtils]: 15: Hoare triple {7875#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7875#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:56,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {7875#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7876#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:56,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {7876#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7876#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:56,311 INFO L273 TraceCheckUtils]: 18: Hoare triple {7876#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7877#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:56,312 INFO L273 TraceCheckUtils]: 19: Hoare triple {7877#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7877#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:56,313 INFO L273 TraceCheckUtils]: 20: Hoare triple {7877#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7878#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:56,314 INFO L273 TraceCheckUtils]: 21: Hoare triple {7878#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7878#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:05:56,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {7878#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7879#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:56,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {7879#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7879#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:05:56,317 INFO L273 TraceCheckUtils]: 24: Hoare triple {7879#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7880#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:56,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {7880#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {7880#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:05:56,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {7880#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7881#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:05:56,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {7881#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7881#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:05:56,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {7881#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7882#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:05:56,321 INFO L273 TraceCheckUtils]: 29: Hoare triple {7882#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {7882#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:05:56,322 INFO L273 TraceCheckUtils]: 30: Hoare triple {7882#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {7977#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:05:56,323 INFO L273 TraceCheckUtils]: 31: Hoare triple {7977#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {7869#false} is VALID [2018-11-23 13:05:56,323 INFO L256 TraceCheckUtils]: 32: Hoare triple {7869#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {7869#false} is VALID [2018-11-23 13:05:56,324 INFO L273 TraceCheckUtils]: 33: Hoare triple {7869#false} ~cond := #in~cond; {7869#false} is VALID [2018-11-23 13:05:56,324 INFO L273 TraceCheckUtils]: 34: Hoare triple {7869#false} assume 0 == ~cond; {7869#false} is VALID [2018-11-23 13:05:56,324 INFO L273 TraceCheckUtils]: 35: Hoare triple {7869#false} assume !false; {7869#false} is VALID [2018-11-23 13:05:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:56,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:56,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 13:05:56,345 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-11-23 13:05:56,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:56,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:05:56,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:56,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:05:56,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:05:56,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:05:56,388 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 17 states. [2018-11-23 13:05:57,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:57,713 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-23 13:05:57,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:05:57,714 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-11-23 13:05:57,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:57,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:05:57,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 49 transitions. [2018-11-23 13:05:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:05:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 49 transitions. [2018-11-23 13:05:57,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 49 transitions. [2018-11-23 13:05:57,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:57,775 INFO L225 Difference]: With dead ends: 72 [2018-11-23 13:05:57,775 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:05:57,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:05:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:05:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-23 13:05:57,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:57,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 66 states. [2018-11-23 13:05:57,838 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 66 states. [2018-11-23 13:05:57,838 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 66 states. [2018-11-23 13:05:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:57,840 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-23 13:05:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-23 13:05:57,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:57,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:57,840 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 67 states. [2018-11-23 13:05:57,840 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 67 states. [2018-11-23 13:05:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:57,841 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-23 13:05:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-23 13:05:57,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:57,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:57,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:57,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:57,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 13:05:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-11-23 13:05:57,843 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 36 [2018-11-23 13:05:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:57,843 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-11-23 13:05:57,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:05:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-11-23 13:05:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:05:57,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:57,844 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:57,844 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:57,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:57,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1171716302, now seen corresponding path program 14 times [2018-11-23 13:05:57,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:57,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:57,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:58,176 INFO L256 TraceCheckUtils]: 0: Hoare triple {8336#true} call ULTIMATE.init(); {8336#true} is VALID [2018-11-23 13:05:58,176 INFO L273 TraceCheckUtils]: 1: Hoare triple {8336#true} assume true; {8336#true} is VALID [2018-11-23 13:05:58,177 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8336#true} {8336#true} #37#return; {8336#true} is VALID [2018-11-23 13:05:58,177 INFO L256 TraceCheckUtils]: 3: Hoare triple {8336#true} call #t~ret2 := main(); {8336#true} is VALID [2018-11-23 13:05:58,177 INFO L273 TraceCheckUtils]: 4: Hoare triple {8336#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {8338#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:58,178 INFO L273 TraceCheckUtils]: 5: Hoare triple {8338#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8338#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:58,179 INFO L273 TraceCheckUtils]: 6: Hoare triple {8338#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8339#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:58,180 INFO L273 TraceCheckUtils]: 7: Hoare triple {8339#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8339#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:58,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {8339#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8340#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:58,182 INFO L273 TraceCheckUtils]: 9: Hoare triple {8340#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {8340#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:58,183 INFO L273 TraceCheckUtils]: 10: Hoare triple {8340#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8341#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:58,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {8341#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8341#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:58,185 INFO L273 TraceCheckUtils]: 12: Hoare triple {8341#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8342#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:58,185 INFO L273 TraceCheckUtils]: 13: Hoare triple {8342#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {8342#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:58,187 INFO L273 TraceCheckUtils]: 14: Hoare triple {8342#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8343#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:58,187 INFO L273 TraceCheckUtils]: 15: Hoare triple {8343#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {8343#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:58,188 INFO L273 TraceCheckUtils]: 16: Hoare triple {8343#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8344#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:58,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {8344#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8344#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:58,207 INFO L273 TraceCheckUtils]: 18: Hoare triple {8344#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8345#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:58,209 INFO L273 TraceCheckUtils]: 19: Hoare triple {8345#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8345#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:58,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {8345#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8346#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:58,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {8346#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {8346#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:58,211 INFO L273 TraceCheckUtils]: 22: Hoare triple {8346#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8347#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:58,211 INFO L273 TraceCheckUtils]: 23: Hoare triple {8347#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {8347#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:58,212 INFO L273 TraceCheckUtils]: 24: Hoare triple {8347#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8348#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:58,212 INFO L273 TraceCheckUtils]: 25: Hoare triple {8348#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8348#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:58,213 INFO L273 TraceCheckUtils]: 26: Hoare triple {8348#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8349#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:05:58,214 INFO L273 TraceCheckUtils]: 27: Hoare triple {8349#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {8349#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:05:58,215 INFO L273 TraceCheckUtils]: 28: Hoare triple {8349#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8350#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:58,216 INFO L273 TraceCheckUtils]: 29: Hoare triple {8350#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8350#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:58,217 INFO L273 TraceCheckUtils]: 30: Hoare triple {8350#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8351#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:05:58,217 INFO L273 TraceCheckUtils]: 31: Hoare triple {8351#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8351#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:05:58,219 INFO L273 TraceCheckUtils]: 32: Hoare triple {8351#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8352#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:05:58,219 INFO L273 TraceCheckUtils]: 33: Hoare triple {8352#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {8337#false} is VALID [2018-11-23 13:05:58,220 INFO L256 TraceCheckUtils]: 34: Hoare triple {8337#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8337#false} is VALID [2018-11-23 13:05:58,220 INFO L273 TraceCheckUtils]: 35: Hoare triple {8337#false} ~cond := #in~cond; {8337#false} is VALID [2018-11-23 13:05:58,220 INFO L273 TraceCheckUtils]: 36: Hoare triple {8337#false} assume 0 == ~cond; {8337#false} is VALID [2018-11-23 13:05:58,220 INFO L273 TraceCheckUtils]: 37: Hoare triple {8337#false} assume !false; {8337#false} is VALID [2018-11-23 13:05:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:58,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:58,224 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:58,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:58,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:58,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:58,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:58,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {8336#true} call ULTIMATE.init(); {8336#true} is VALID [2018-11-23 13:05:58,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {8336#true} assume true; {8336#true} is VALID [2018-11-23 13:05:58,456 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8336#true} {8336#true} #37#return; {8336#true} is VALID [2018-11-23 13:05:58,456 INFO L256 TraceCheckUtils]: 3: Hoare triple {8336#true} call #t~ret2 := main(); {8336#true} is VALID [2018-11-23 13:05:58,457 INFO L273 TraceCheckUtils]: 4: Hoare triple {8336#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {8338#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:58,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {8338#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8338#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:05:58,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {8338#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8339#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:58,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {8339#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8339#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:05:58,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {8339#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8340#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:58,460 INFO L273 TraceCheckUtils]: 9: Hoare triple {8340#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {8340#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:05:58,461 INFO L273 TraceCheckUtils]: 10: Hoare triple {8340#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8341#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:58,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {8341#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8341#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:05:58,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {8341#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8342#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:58,464 INFO L273 TraceCheckUtils]: 13: Hoare triple {8342#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {8342#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:05:58,465 INFO L273 TraceCheckUtils]: 14: Hoare triple {8342#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8343#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:58,466 INFO L273 TraceCheckUtils]: 15: Hoare triple {8343#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {8343#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:05:58,467 INFO L273 TraceCheckUtils]: 16: Hoare triple {8343#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8344#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:58,467 INFO L273 TraceCheckUtils]: 17: Hoare triple {8344#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8344#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:05:58,468 INFO L273 TraceCheckUtils]: 18: Hoare triple {8344#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8345#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:58,469 INFO L273 TraceCheckUtils]: 19: Hoare triple {8345#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8345#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:05:58,470 INFO L273 TraceCheckUtils]: 20: Hoare triple {8345#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8346#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:58,471 INFO L273 TraceCheckUtils]: 21: Hoare triple {8346#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {8346#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:05:58,472 INFO L273 TraceCheckUtils]: 22: Hoare triple {8346#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8347#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:58,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {8347#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {8347#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:05:58,474 INFO L273 TraceCheckUtils]: 24: Hoare triple {8347#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8348#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:58,475 INFO L273 TraceCheckUtils]: 25: Hoare triple {8348#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8348#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:05:58,476 INFO L273 TraceCheckUtils]: 26: Hoare triple {8348#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8349#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:05:58,476 INFO L273 TraceCheckUtils]: 27: Hoare triple {8349#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {8349#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:05:58,477 INFO L273 TraceCheckUtils]: 28: Hoare triple {8349#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8350#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:58,478 INFO L273 TraceCheckUtils]: 29: Hoare triple {8350#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8350#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:05:58,479 INFO L273 TraceCheckUtils]: 30: Hoare triple {8350#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8351#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:05:58,480 INFO L273 TraceCheckUtils]: 31: Hoare triple {8351#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8351#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:05:58,481 INFO L273 TraceCheckUtils]: 32: Hoare triple {8351#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {8452#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:05:58,482 INFO L273 TraceCheckUtils]: 33: Hoare triple {8452#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {8337#false} is VALID [2018-11-23 13:05:58,482 INFO L256 TraceCheckUtils]: 34: Hoare triple {8337#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8337#false} is VALID [2018-11-23 13:05:58,482 INFO L273 TraceCheckUtils]: 35: Hoare triple {8337#false} ~cond := #in~cond; {8337#false} is VALID [2018-11-23 13:05:58,483 INFO L273 TraceCheckUtils]: 36: Hoare triple {8337#false} assume 0 == ~cond; {8337#false} is VALID [2018-11-23 13:05:58,483 INFO L273 TraceCheckUtils]: 37: Hoare triple {8337#false} assume !false; {8337#false} is VALID [2018-11-23 13:05:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:58,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:58,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 13:05:58,504 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-11-23 13:05:58,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:58,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 13:05:58,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:58,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 13:05:58,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:05:58,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:05:58,551 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 18 states. [2018-11-23 13:06:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:00,059 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-11-23 13:06:00,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:06:00,060 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-11-23 13:06:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:06:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 56 transitions. [2018-11-23 13:06:00,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:06:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 56 transitions. [2018-11-23 13:06:00,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 56 transitions. [2018-11-23 13:06:00,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:00,185 INFO L225 Difference]: With dead ends: 74 [2018-11-23 13:06:00,185 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 13:06:00,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:06:00,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 13:06:00,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-23 13:06:00,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:00,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 68 states. [2018-11-23 13:06:00,253 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 68 states. [2018-11-23 13:06:00,253 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 68 states. [2018-11-23 13:06:00,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:00,255 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-11-23 13:06:00,256 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-11-23 13:06:00,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:00,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:00,257 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 69 states. [2018-11-23 13:06:00,257 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 69 states. [2018-11-23 13:06:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:00,259 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-11-23 13:06:00,259 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-11-23 13:06:00,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:00,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:00,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:00,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 13:06:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-23 13:06:00,261 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 38 [2018-11-23 13:06:00,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:00,261 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-23 13:06:00,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 13:06:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-23 13:06:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 13:06:00,262 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:00,262 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:00,262 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:00,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:00,262 INFO L82 PathProgramCache]: Analyzing trace with hash -329445454, now seen corresponding path program 14 times [2018-11-23 13:06:00,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:00,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:00,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:00,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:00,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {8821#true} call ULTIMATE.init(); {8821#true} is VALID [2018-11-23 13:06:00,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {8821#true} assume true; {8821#true} is VALID [2018-11-23 13:06:00,810 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8821#true} {8821#true} #37#return; {8821#true} is VALID [2018-11-23 13:06:00,810 INFO L256 TraceCheckUtils]: 3: Hoare triple {8821#true} call #t~ret2 := main(); {8821#true} is VALID [2018-11-23 13:06:00,811 INFO L273 TraceCheckUtils]: 4: Hoare triple {8821#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {8823#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:00,811 INFO L273 TraceCheckUtils]: 5: Hoare triple {8823#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8823#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:00,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {8823#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:00,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {8824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {8824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:00,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {8824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8825#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:00,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {8825#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {8825#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:00,816 INFO L273 TraceCheckUtils]: 10: Hoare triple {8825#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8826#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:00,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {8826#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8826#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:00,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {8826#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8827#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:00,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {8827#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {8827#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:00,819 INFO L273 TraceCheckUtils]: 14: Hoare triple {8827#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8828#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:00,820 INFO L273 TraceCheckUtils]: 15: Hoare triple {8828#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8828#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:00,821 INFO L273 TraceCheckUtils]: 16: Hoare triple {8828#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8829#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:00,822 INFO L273 TraceCheckUtils]: 17: Hoare triple {8829#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8829#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:00,823 INFO L273 TraceCheckUtils]: 18: Hoare triple {8829#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8830#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:00,824 INFO L273 TraceCheckUtils]: 19: Hoare triple {8830#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8830#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:00,825 INFO L273 TraceCheckUtils]: 20: Hoare triple {8830#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8831#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:00,826 INFO L273 TraceCheckUtils]: 21: Hoare triple {8831#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8831#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:00,827 INFO L273 TraceCheckUtils]: 22: Hoare triple {8831#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8832#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:00,827 INFO L273 TraceCheckUtils]: 23: Hoare triple {8832#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8832#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:00,829 INFO L273 TraceCheckUtils]: 24: Hoare triple {8832#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8833#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:00,829 INFO L273 TraceCheckUtils]: 25: Hoare triple {8833#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {8833#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:00,830 INFO L273 TraceCheckUtils]: 26: Hoare triple {8833#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8834#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:00,831 INFO L273 TraceCheckUtils]: 27: Hoare triple {8834#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8834#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:00,832 INFO L273 TraceCheckUtils]: 28: Hoare triple {8834#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8835#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:00,833 INFO L273 TraceCheckUtils]: 29: Hoare triple {8835#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8835#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:00,834 INFO L273 TraceCheckUtils]: 30: Hoare triple {8835#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8836#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:06:00,835 INFO L273 TraceCheckUtils]: 31: Hoare triple {8836#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8836#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:06:00,836 INFO L273 TraceCheckUtils]: 32: Hoare triple {8836#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8837#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:00,837 INFO L273 TraceCheckUtils]: 33: Hoare triple {8837#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {8822#false} is VALID [2018-11-23 13:06:00,837 INFO L256 TraceCheckUtils]: 34: Hoare triple {8822#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8822#false} is VALID [2018-11-23 13:06:00,837 INFO L273 TraceCheckUtils]: 35: Hoare triple {8822#false} ~cond := #in~cond; {8822#false} is VALID [2018-11-23 13:06:00,837 INFO L273 TraceCheckUtils]: 36: Hoare triple {8822#false} assume 0 == ~cond; {8822#false} is VALID [2018-11-23 13:06:00,838 INFO L273 TraceCheckUtils]: 37: Hoare triple {8822#false} assume !false; {8822#false} is VALID [2018-11-23 13:06:00,840 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:00,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:00,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:00,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:06:00,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:06:00,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:00,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:01,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {8821#true} call ULTIMATE.init(); {8821#true} is VALID [2018-11-23 13:06:01,035 INFO L273 TraceCheckUtils]: 1: Hoare triple {8821#true} assume true; {8821#true} is VALID [2018-11-23 13:06:01,035 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {8821#true} {8821#true} #37#return; {8821#true} is VALID [2018-11-23 13:06:01,035 INFO L256 TraceCheckUtils]: 3: Hoare triple {8821#true} call #t~ret2 := main(); {8821#true} is VALID [2018-11-23 13:06:01,036 INFO L273 TraceCheckUtils]: 4: Hoare triple {8821#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {8823#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:01,036 INFO L273 TraceCheckUtils]: 5: Hoare triple {8823#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8823#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:01,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {8823#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:01,037 INFO L273 TraceCheckUtils]: 7: Hoare triple {8824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {8824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:01,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {8824#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8825#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:01,039 INFO L273 TraceCheckUtils]: 9: Hoare triple {8825#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {8825#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:01,040 INFO L273 TraceCheckUtils]: 10: Hoare triple {8825#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8826#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:01,041 INFO L273 TraceCheckUtils]: 11: Hoare triple {8826#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8826#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:01,042 INFO L273 TraceCheckUtils]: 12: Hoare triple {8826#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8827#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:01,042 INFO L273 TraceCheckUtils]: 13: Hoare triple {8827#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {8827#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:01,044 INFO L273 TraceCheckUtils]: 14: Hoare triple {8827#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8828#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:01,044 INFO L273 TraceCheckUtils]: 15: Hoare triple {8828#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8828#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:01,045 INFO L273 TraceCheckUtils]: 16: Hoare triple {8828#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8829#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:01,046 INFO L273 TraceCheckUtils]: 17: Hoare triple {8829#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8829#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:01,047 INFO L273 TraceCheckUtils]: 18: Hoare triple {8829#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8830#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:01,048 INFO L273 TraceCheckUtils]: 19: Hoare triple {8830#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8830#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:01,049 INFO L273 TraceCheckUtils]: 20: Hoare triple {8830#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8831#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:01,050 INFO L273 TraceCheckUtils]: 21: Hoare triple {8831#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8831#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:01,051 INFO L273 TraceCheckUtils]: 22: Hoare triple {8831#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8832#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:01,052 INFO L273 TraceCheckUtils]: 23: Hoare triple {8832#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8832#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:01,053 INFO L273 TraceCheckUtils]: 24: Hoare triple {8832#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8833#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:01,054 INFO L273 TraceCheckUtils]: 25: Hoare triple {8833#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {8833#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:01,055 INFO L273 TraceCheckUtils]: 26: Hoare triple {8833#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8834#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:01,055 INFO L273 TraceCheckUtils]: 27: Hoare triple {8834#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8834#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:01,056 INFO L273 TraceCheckUtils]: 28: Hoare triple {8834#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8835#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:01,057 INFO L273 TraceCheckUtils]: 29: Hoare triple {8835#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8835#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:01,058 INFO L273 TraceCheckUtils]: 30: Hoare triple {8835#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8836#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:06:01,059 INFO L273 TraceCheckUtils]: 31: Hoare triple {8836#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {8836#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:06:01,060 INFO L273 TraceCheckUtils]: 32: Hoare triple {8836#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {8937#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:06:01,061 INFO L273 TraceCheckUtils]: 33: Hoare triple {8937#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {8822#false} is VALID [2018-11-23 13:06:01,061 INFO L256 TraceCheckUtils]: 34: Hoare triple {8822#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {8822#false} is VALID [2018-11-23 13:06:01,062 INFO L273 TraceCheckUtils]: 35: Hoare triple {8822#false} ~cond := #in~cond; {8822#false} is VALID [2018-11-23 13:06:01,062 INFO L273 TraceCheckUtils]: 36: Hoare triple {8822#false} assume 0 == ~cond; {8822#false} is VALID [2018-11-23 13:06:01,062 INFO L273 TraceCheckUtils]: 37: Hoare triple {8822#false} assume !false; {8822#false} is VALID [2018-11-23 13:06:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:01,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:01,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 13:06:01,084 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-11-23 13:06:01,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:01,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 13:06:01,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:01,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 13:06:01,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:06:01,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:06:01,133 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 18 states. [2018-11-23 13:06:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:02,556 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-11-23 13:06:02,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:06:02,557 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2018-11-23 13:06:02,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:06:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 51 transitions. [2018-11-23 13:06:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:06:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 51 transitions. [2018-11-23 13:06:02,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 51 transitions. [2018-11-23 13:06:02,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:02,628 INFO L225 Difference]: With dead ends: 76 [2018-11-23 13:06:02,628 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 13:06:02,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:06:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 13:06:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-23 13:06:02,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:02,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 70 states. [2018-11-23 13:06:02,705 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 70 states. [2018-11-23 13:06:02,705 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 70 states. [2018-11-23 13:06:02,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:02,707 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-23 13:06:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-23 13:06:02,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:02,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:02,707 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 71 states. [2018-11-23 13:06:02,707 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 71 states. [2018-11-23 13:06:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:02,708 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-23 13:06:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-11-23 13:06:02,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:02,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:02,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:02,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:02,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 13:06:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-11-23 13:06:02,710 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 38 [2018-11-23 13:06:02,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:02,710 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-11-23 13:06:02,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 13:06:02,711 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-11-23 13:06:02,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:06:02,711 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:02,711 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:02,712 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:02,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:02,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1813266699, now seen corresponding path program 15 times [2018-11-23 13:06:02,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:02,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:02,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:02,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:02,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:03,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {9316#true} call ULTIMATE.init(); {9316#true} is VALID [2018-11-23 13:06:03,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {9316#true} assume true; {9316#true} is VALID [2018-11-23 13:06:03,622 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9316#true} {9316#true} #37#return; {9316#true} is VALID [2018-11-23 13:06:03,622 INFO L256 TraceCheckUtils]: 3: Hoare triple {9316#true} call #t~ret2 := main(); {9316#true} is VALID [2018-11-23 13:06:03,623 INFO L273 TraceCheckUtils]: 4: Hoare triple {9316#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {9318#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:03,624 INFO L273 TraceCheckUtils]: 5: Hoare triple {9318#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9318#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:03,624 INFO L273 TraceCheckUtils]: 6: Hoare triple {9318#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9319#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:03,625 INFO L273 TraceCheckUtils]: 7: Hoare triple {9319#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9319#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:03,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {9319#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9320#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:03,626 INFO L273 TraceCheckUtils]: 9: Hoare triple {9320#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {9320#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:03,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {9320#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9321#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:03,627 INFO L273 TraceCheckUtils]: 11: Hoare triple {9321#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9321#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:03,628 INFO L273 TraceCheckUtils]: 12: Hoare triple {9321#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9322#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:03,629 INFO L273 TraceCheckUtils]: 13: Hoare triple {9322#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {9322#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:03,630 INFO L273 TraceCheckUtils]: 14: Hoare triple {9322#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9323#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:03,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {9323#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {9323#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:03,632 INFO L273 TraceCheckUtils]: 16: Hoare triple {9323#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9324#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:03,633 INFO L273 TraceCheckUtils]: 17: Hoare triple {9324#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9324#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:03,634 INFO L273 TraceCheckUtils]: 18: Hoare triple {9324#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9325#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:03,634 INFO L273 TraceCheckUtils]: 19: Hoare triple {9325#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9325#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:03,635 INFO L273 TraceCheckUtils]: 20: Hoare triple {9325#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9326#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:03,636 INFO L273 TraceCheckUtils]: 21: Hoare triple {9326#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {9326#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:03,637 INFO L273 TraceCheckUtils]: 22: Hoare triple {9326#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9327#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:03,638 INFO L273 TraceCheckUtils]: 23: Hoare triple {9327#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {9327#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:03,639 INFO L273 TraceCheckUtils]: 24: Hoare triple {9327#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9328#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:03,640 INFO L273 TraceCheckUtils]: 25: Hoare triple {9328#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9328#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:03,641 INFO L273 TraceCheckUtils]: 26: Hoare triple {9328#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9329#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:03,642 INFO L273 TraceCheckUtils]: 27: Hoare triple {9329#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {9329#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:03,643 INFO L273 TraceCheckUtils]: 28: Hoare triple {9329#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9330#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:03,643 INFO L273 TraceCheckUtils]: 29: Hoare triple {9330#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9330#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:03,645 INFO L273 TraceCheckUtils]: 30: Hoare triple {9330#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9331#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:03,645 INFO L273 TraceCheckUtils]: 31: Hoare triple {9331#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9331#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:03,646 INFO L273 TraceCheckUtils]: 32: Hoare triple {9331#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9332#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:03,647 INFO L273 TraceCheckUtils]: 33: Hoare triple {9332#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9332#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:03,648 INFO L273 TraceCheckUtils]: 34: Hoare triple {9332#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9333#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:03,649 INFO L273 TraceCheckUtils]: 35: Hoare triple {9333#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 < 99); {9317#false} is VALID [2018-11-23 13:06:03,649 INFO L256 TraceCheckUtils]: 36: Hoare triple {9317#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9317#false} is VALID [2018-11-23 13:06:03,650 INFO L273 TraceCheckUtils]: 37: Hoare triple {9317#false} ~cond := #in~cond; {9317#false} is VALID [2018-11-23 13:06:03,650 INFO L273 TraceCheckUtils]: 38: Hoare triple {9317#false} assume 0 == ~cond; {9317#false} is VALID [2018-11-23 13:06:03,650 INFO L273 TraceCheckUtils]: 39: Hoare triple {9317#false} assume !false; {9317#false} is VALID [2018-11-23 13:06:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:03,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:03,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:03,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:06:09,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 13:06:09,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:09,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:09,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {9316#true} call ULTIMATE.init(); {9316#true} is VALID [2018-11-23 13:06:09,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {9316#true} assume true; {9316#true} is VALID [2018-11-23 13:06:09,791 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9316#true} {9316#true} #37#return; {9316#true} is VALID [2018-11-23 13:06:09,791 INFO L256 TraceCheckUtils]: 3: Hoare triple {9316#true} call #t~ret2 := main(); {9316#true} is VALID [2018-11-23 13:06:09,792 INFO L273 TraceCheckUtils]: 4: Hoare triple {9316#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {9318#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:09,793 INFO L273 TraceCheckUtils]: 5: Hoare triple {9318#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9318#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:09,794 INFO L273 TraceCheckUtils]: 6: Hoare triple {9318#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9319#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:09,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {9319#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9319#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:09,796 INFO L273 TraceCheckUtils]: 8: Hoare triple {9319#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9320#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:09,796 INFO L273 TraceCheckUtils]: 9: Hoare triple {9320#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {9320#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:09,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {9320#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9321#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:09,798 INFO L273 TraceCheckUtils]: 11: Hoare triple {9321#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9321#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:09,799 INFO L273 TraceCheckUtils]: 12: Hoare triple {9321#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9322#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:09,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {9322#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {9322#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:09,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {9322#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9323#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:09,802 INFO L273 TraceCheckUtils]: 15: Hoare triple {9323#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {9323#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:09,803 INFO L273 TraceCheckUtils]: 16: Hoare triple {9323#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9324#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:09,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {9324#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9324#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:09,805 INFO L273 TraceCheckUtils]: 18: Hoare triple {9324#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9325#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:09,805 INFO L273 TraceCheckUtils]: 19: Hoare triple {9325#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9325#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:09,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {9325#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9326#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:09,807 INFO L273 TraceCheckUtils]: 21: Hoare triple {9326#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {9326#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:09,808 INFO L273 TraceCheckUtils]: 22: Hoare triple {9326#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9327#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:09,809 INFO L273 TraceCheckUtils]: 23: Hoare triple {9327#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {9327#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:09,810 INFO L273 TraceCheckUtils]: 24: Hoare triple {9327#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9328#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:09,811 INFO L273 TraceCheckUtils]: 25: Hoare triple {9328#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9328#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:09,812 INFO L273 TraceCheckUtils]: 26: Hoare triple {9328#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9329#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:09,813 INFO L273 TraceCheckUtils]: 27: Hoare triple {9329#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {9329#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:09,814 INFO L273 TraceCheckUtils]: 28: Hoare triple {9329#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9330#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:09,814 INFO L273 TraceCheckUtils]: 29: Hoare triple {9330#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9330#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:09,816 INFO L273 TraceCheckUtils]: 30: Hoare triple {9330#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9331#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:09,816 INFO L273 TraceCheckUtils]: 31: Hoare triple {9331#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9331#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:09,817 INFO L273 TraceCheckUtils]: 32: Hoare triple {9331#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9332#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:09,818 INFO L273 TraceCheckUtils]: 33: Hoare triple {9332#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9332#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:09,819 INFO L273 TraceCheckUtils]: 34: Hoare triple {9332#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {9439#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:09,820 INFO L273 TraceCheckUtils]: 35: Hoare triple {9439#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 < 99); {9317#false} is VALID [2018-11-23 13:06:09,820 INFO L256 TraceCheckUtils]: 36: Hoare triple {9317#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9317#false} is VALID [2018-11-23 13:06:09,820 INFO L273 TraceCheckUtils]: 37: Hoare triple {9317#false} ~cond := #in~cond; {9317#false} is VALID [2018-11-23 13:06:09,821 INFO L273 TraceCheckUtils]: 38: Hoare triple {9317#false} assume 0 == ~cond; {9317#false} is VALID [2018-11-23 13:06:09,821 INFO L273 TraceCheckUtils]: 39: Hoare triple {9317#false} assume !false; {9317#false} is VALID [2018-11-23 13:06:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:09,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:09,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 13:06:09,843 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-11-23 13:06:09,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:09,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:06:09,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:09,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:06:09,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:06:09,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:06:09,960 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 19 states. [2018-11-23 13:06:11,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:11,788 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-23 13:06:11,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:06:11,788 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-11-23 13:06:11,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:11,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:06:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 58 transitions. [2018-11-23 13:06:11,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:06:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 58 transitions. [2018-11-23 13:06:11,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 58 transitions. [2018-11-23 13:06:11,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:11,863 INFO L225 Difference]: With dead ends: 78 [2018-11-23 13:06:11,863 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 13:06:11,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:06:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 13:06:11,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-23 13:06:11,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:11,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 72 states. [2018-11-23 13:06:11,931 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 72 states. [2018-11-23 13:06:11,931 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 72 states. [2018-11-23 13:06:11,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:11,933 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-11-23 13:06:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-11-23 13:06:11,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:11,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:11,933 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 73 states. [2018-11-23 13:06:11,934 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 73 states. [2018-11-23 13:06:11,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:11,934 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-11-23 13:06:11,935 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-11-23 13:06:11,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:11,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:11,935 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:11,935 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 13:06:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-11-23 13:06:11,936 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 40 [2018-11-23 13:06:11,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:11,936 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-11-23 13:06:11,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:06:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-11-23 13:06:11,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:06:11,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:11,937 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:11,937 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:11,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:11,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1931878355, now seen corresponding path program 15 times [2018-11-23 13:06:11,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:11,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:11,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:11,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:11,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:13,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {9828#true} call ULTIMATE.init(); {9828#true} is VALID [2018-11-23 13:06:13,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {9828#true} assume true; {9828#true} is VALID [2018-11-23 13:06:13,272 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9828#true} {9828#true} #37#return; {9828#true} is VALID [2018-11-23 13:06:13,273 INFO L256 TraceCheckUtils]: 3: Hoare triple {9828#true} call #t~ret2 := main(); {9828#true} is VALID [2018-11-23 13:06:13,273 INFO L273 TraceCheckUtils]: 4: Hoare triple {9828#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {9830#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:13,273 INFO L273 TraceCheckUtils]: 5: Hoare triple {9830#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9830#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:13,274 INFO L273 TraceCheckUtils]: 6: Hoare triple {9830#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:13,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {9831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {9831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:13,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {9831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9832#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:13,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {9832#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {9832#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:13,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {9832#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9833#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:13,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {9833#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9833#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:13,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {9833#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9834#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:13,280 INFO L273 TraceCheckUtils]: 13: Hoare triple {9834#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {9834#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:13,281 INFO L273 TraceCheckUtils]: 14: Hoare triple {9834#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9835#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:13,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {9835#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9835#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:13,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {9835#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9836#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:13,284 INFO L273 TraceCheckUtils]: 17: Hoare triple {9836#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9836#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:13,285 INFO L273 TraceCheckUtils]: 18: Hoare triple {9836#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9837#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:13,285 INFO L273 TraceCheckUtils]: 19: Hoare triple {9837#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9837#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:13,286 INFO L273 TraceCheckUtils]: 20: Hoare triple {9837#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9838#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:13,287 INFO L273 TraceCheckUtils]: 21: Hoare triple {9838#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9838#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:13,288 INFO L273 TraceCheckUtils]: 22: Hoare triple {9838#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9839#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:13,289 INFO L273 TraceCheckUtils]: 23: Hoare triple {9839#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9839#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:13,290 INFO L273 TraceCheckUtils]: 24: Hoare triple {9839#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9840#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:13,291 INFO L273 TraceCheckUtils]: 25: Hoare triple {9840#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {9840#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:13,292 INFO L273 TraceCheckUtils]: 26: Hoare triple {9840#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9841#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:13,293 INFO L273 TraceCheckUtils]: 27: Hoare triple {9841#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9841#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:13,294 INFO L273 TraceCheckUtils]: 28: Hoare triple {9841#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9842#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:13,294 INFO L273 TraceCheckUtils]: 29: Hoare triple {9842#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9842#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:13,296 INFO L273 TraceCheckUtils]: 30: Hoare triple {9842#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9843#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:06:13,296 INFO L273 TraceCheckUtils]: 31: Hoare triple {9843#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9843#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:06:13,297 INFO L273 TraceCheckUtils]: 32: Hoare triple {9843#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9844#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:06:13,298 INFO L273 TraceCheckUtils]: 33: Hoare triple {9844#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9844#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:06:13,299 INFO L273 TraceCheckUtils]: 34: Hoare triple {9844#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9845#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:13,300 INFO L273 TraceCheckUtils]: 35: Hoare triple {9845#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {9829#false} is VALID [2018-11-23 13:06:13,300 INFO L256 TraceCheckUtils]: 36: Hoare triple {9829#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9829#false} is VALID [2018-11-23 13:06:13,301 INFO L273 TraceCheckUtils]: 37: Hoare triple {9829#false} ~cond := #in~cond; {9829#false} is VALID [2018-11-23 13:06:13,301 INFO L273 TraceCheckUtils]: 38: Hoare triple {9829#false} assume 0 == ~cond; {9829#false} is VALID [2018-11-23 13:06:13,301 INFO L273 TraceCheckUtils]: 39: Hoare triple {9829#false} assume !false; {9829#false} is VALID [2018-11-23 13:06:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:13,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:13,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:13,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:06:14,753 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 13:06:14,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:14,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:14,912 INFO L256 TraceCheckUtils]: 0: Hoare triple {9828#true} call ULTIMATE.init(); {9828#true} is VALID [2018-11-23 13:06:14,913 INFO L273 TraceCheckUtils]: 1: Hoare triple {9828#true} assume true; {9828#true} is VALID [2018-11-23 13:06:14,913 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {9828#true} {9828#true} #37#return; {9828#true} is VALID [2018-11-23 13:06:14,913 INFO L256 TraceCheckUtils]: 3: Hoare triple {9828#true} call #t~ret2 := main(); {9828#true} is VALID [2018-11-23 13:06:14,914 INFO L273 TraceCheckUtils]: 4: Hoare triple {9828#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {9830#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:14,914 INFO L273 TraceCheckUtils]: 5: Hoare triple {9830#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9830#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:14,915 INFO L273 TraceCheckUtils]: 6: Hoare triple {9830#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:14,916 INFO L273 TraceCheckUtils]: 7: Hoare triple {9831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {9831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:14,916 INFO L273 TraceCheckUtils]: 8: Hoare triple {9831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9832#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:14,917 INFO L273 TraceCheckUtils]: 9: Hoare triple {9832#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {9832#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:14,930 INFO L273 TraceCheckUtils]: 10: Hoare triple {9832#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9833#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:14,930 INFO L273 TraceCheckUtils]: 11: Hoare triple {9833#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9833#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:14,931 INFO L273 TraceCheckUtils]: 12: Hoare triple {9833#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9834#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:14,932 INFO L273 TraceCheckUtils]: 13: Hoare triple {9834#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {9834#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:14,932 INFO L273 TraceCheckUtils]: 14: Hoare triple {9834#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9835#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:14,933 INFO L273 TraceCheckUtils]: 15: Hoare triple {9835#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9835#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:14,933 INFO L273 TraceCheckUtils]: 16: Hoare triple {9835#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9836#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:14,934 INFO L273 TraceCheckUtils]: 17: Hoare triple {9836#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9836#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:14,935 INFO L273 TraceCheckUtils]: 18: Hoare triple {9836#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9837#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:14,936 INFO L273 TraceCheckUtils]: 19: Hoare triple {9837#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9837#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:14,937 INFO L273 TraceCheckUtils]: 20: Hoare triple {9837#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9838#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:14,937 INFO L273 TraceCheckUtils]: 21: Hoare triple {9838#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9838#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:14,938 INFO L273 TraceCheckUtils]: 22: Hoare triple {9838#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9839#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:14,939 INFO L273 TraceCheckUtils]: 23: Hoare triple {9839#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9839#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:14,940 INFO L273 TraceCheckUtils]: 24: Hoare triple {9839#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9840#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:14,941 INFO L273 TraceCheckUtils]: 25: Hoare triple {9840#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {9840#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:14,942 INFO L273 TraceCheckUtils]: 26: Hoare triple {9840#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9841#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:14,943 INFO L273 TraceCheckUtils]: 27: Hoare triple {9841#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9841#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:14,944 INFO L273 TraceCheckUtils]: 28: Hoare triple {9841#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9842#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:14,945 INFO L273 TraceCheckUtils]: 29: Hoare triple {9842#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9842#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:14,946 INFO L273 TraceCheckUtils]: 30: Hoare triple {9842#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9843#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:06:14,947 INFO L273 TraceCheckUtils]: 31: Hoare triple {9843#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9843#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:06:14,948 INFO L273 TraceCheckUtils]: 32: Hoare triple {9843#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9844#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:06:14,948 INFO L273 TraceCheckUtils]: 33: Hoare triple {9844#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {9844#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:06:14,949 INFO L273 TraceCheckUtils]: 34: Hoare triple {9844#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {9951#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:06:14,950 INFO L273 TraceCheckUtils]: 35: Hoare triple {9951#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(~x~0 % 4294967296 < 99); {9829#false} is VALID [2018-11-23 13:06:14,951 INFO L256 TraceCheckUtils]: 36: Hoare triple {9829#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {9829#false} is VALID [2018-11-23 13:06:14,951 INFO L273 TraceCheckUtils]: 37: Hoare triple {9829#false} ~cond := #in~cond; {9829#false} is VALID [2018-11-23 13:06:14,951 INFO L273 TraceCheckUtils]: 38: Hoare triple {9829#false} assume 0 == ~cond; {9829#false} is VALID [2018-11-23 13:06:14,951 INFO L273 TraceCheckUtils]: 39: Hoare triple {9829#false} assume !false; {9829#false} is VALID [2018-11-23 13:06:14,954 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:14,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:14,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 13:06:14,973 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-11-23 13:06:14,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:14,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:06:15,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:15,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:06:15,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:06:15,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:06:15,021 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 19 states. [2018-11-23 13:06:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:16,870 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-11-23 13:06:16,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:06:16,870 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-11-23 13:06:16,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:16,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:06:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 53 transitions. [2018-11-23 13:06:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:06:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 53 transitions. [2018-11-23 13:06:16,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 53 transitions. [2018-11-23 13:06:16,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:16,954 INFO L225 Difference]: With dead ends: 80 [2018-11-23 13:06:16,954 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 13:06:16,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:06:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 13:06:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-23 13:06:17,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:17,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 74 states. [2018-11-23 13:06:17,032 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 74 states. [2018-11-23 13:06:17,032 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 74 states. [2018-11-23 13:06:17,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:17,034 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-23 13:06:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-23 13:06:17,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:17,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:17,035 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 75 states. [2018-11-23 13:06:17,035 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 75 states. [2018-11-23 13:06:17,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:17,036 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-11-23 13:06:17,036 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-11-23 13:06:17,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:17,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:17,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:17,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 13:06:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-11-23 13:06:17,038 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 40 [2018-11-23 13:06:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:17,039 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-11-23 13:06:17,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:06:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-11-23 13:06:17,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:06:17,039 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:17,040 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:17,040 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:17,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:17,040 INFO L82 PathProgramCache]: Analyzing trace with hash -132092408, now seen corresponding path program 16 times [2018-11-23 13:06:17,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:17,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:17,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:17,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:17,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:17,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {10350#true} call ULTIMATE.init(); {10350#true} is VALID [2018-11-23 13:06:17,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {10350#true} assume true; {10350#true} is VALID [2018-11-23 13:06:17,697 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10350#true} {10350#true} #37#return; {10350#true} is VALID [2018-11-23 13:06:17,697 INFO L256 TraceCheckUtils]: 3: Hoare triple {10350#true} call #t~ret2 := main(); {10350#true} is VALID [2018-11-23 13:06:17,698 INFO L273 TraceCheckUtils]: 4: Hoare triple {10350#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {10352#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:17,699 INFO L273 TraceCheckUtils]: 5: Hoare triple {10352#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10352#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:17,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {10352#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10353#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:17,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {10353#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10353#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:17,701 INFO L273 TraceCheckUtils]: 8: Hoare triple {10353#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10354#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:17,701 INFO L273 TraceCheckUtils]: 9: Hoare triple {10354#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {10354#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:17,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {10354#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10355#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:17,702 INFO L273 TraceCheckUtils]: 11: Hoare triple {10355#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10355#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:17,703 INFO L273 TraceCheckUtils]: 12: Hoare triple {10355#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10356#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:17,704 INFO L273 TraceCheckUtils]: 13: Hoare triple {10356#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {10356#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:17,705 INFO L273 TraceCheckUtils]: 14: Hoare triple {10356#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10357#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:17,706 INFO L273 TraceCheckUtils]: 15: Hoare triple {10357#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {10357#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:17,707 INFO L273 TraceCheckUtils]: 16: Hoare triple {10357#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10358#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:17,708 INFO L273 TraceCheckUtils]: 17: Hoare triple {10358#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10358#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:17,709 INFO L273 TraceCheckUtils]: 18: Hoare triple {10358#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10359#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:17,709 INFO L273 TraceCheckUtils]: 19: Hoare triple {10359#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10359#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:17,710 INFO L273 TraceCheckUtils]: 20: Hoare triple {10359#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10360#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:17,711 INFO L273 TraceCheckUtils]: 21: Hoare triple {10360#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {10360#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:17,712 INFO L273 TraceCheckUtils]: 22: Hoare triple {10360#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10361#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:17,713 INFO L273 TraceCheckUtils]: 23: Hoare triple {10361#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {10361#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:17,714 INFO L273 TraceCheckUtils]: 24: Hoare triple {10361#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:17,715 INFO L273 TraceCheckUtils]: 25: Hoare triple {10362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:17,716 INFO L273 TraceCheckUtils]: 26: Hoare triple {10362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10363#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:17,717 INFO L273 TraceCheckUtils]: 27: Hoare triple {10363#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {10363#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:17,718 INFO L273 TraceCheckUtils]: 28: Hoare triple {10363#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10364#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:17,718 INFO L273 TraceCheckUtils]: 29: Hoare triple {10364#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10364#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:17,720 INFO L273 TraceCheckUtils]: 30: Hoare triple {10364#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10365#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:17,720 INFO L273 TraceCheckUtils]: 31: Hoare triple {10365#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10365#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:17,721 INFO L273 TraceCheckUtils]: 32: Hoare triple {10365#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10366#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:17,722 INFO L273 TraceCheckUtils]: 33: Hoare triple {10366#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10366#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:17,723 INFO L273 TraceCheckUtils]: 34: Hoare triple {10366#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10367#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:17,724 INFO L273 TraceCheckUtils]: 35: Hoare triple {10367#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {10367#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:17,725 INFO L273 TraceCheckUtils]: 36: Hoare triple {10367#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10368#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:17,726 INFO L273 TraceCheckUtils]: 37: Hoare triple {10368#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {10351#false} is VALID [2018-11-23 13:06:17,726 INFO L256 TraceCheckUtils]: 38: Hoare triple {10351#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10351#false} is VALID [2018-11-23 13:06:17,726 INFO L273 TraceCheckUtils]: 39: Hoare triple {10351#false} ~cond := #in~cond; {10351#false} is VALID [2018-11-23 13:06:17,727 INFO L273 TraceCheckUtils]: 40: Hoare triple {10351#false} assume 0 == ~cond; {10351#false} is VALID [2018-11-23 13:06:17,727 INFO L273 TraceCheckUtils]: 41: Hoare triple {10351#false} assume !false; {10351#false} is VALID [2018-11-23 13:06:17,730 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:17,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:17,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:17,738 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:06:17,759 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:06:17,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:17,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:17,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {10350#true} call ULTIMATE.init(); {10350#true} is VALID [2018-11-23 13:06:17,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {10350#true} assume true; {10350#true} is VALID [2018-11-23 13:06:17,902 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10350#true} {10350#true} #37#return; {10350#true} is VALID [2018-11-23 13:06:17,902 INFO L256 TraceCheckUtils]: 3: Hoare triple {10350#true} call #t~ret2 := main(); {10350#true} is VALID [2018-11-23 13:06:17,903 INFO L273 TraceCheckUtils]: 4: Hoare triple {10350#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {10352#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:17,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {10352#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10352#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:17,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {10352#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10353#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:17,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {10353#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10353#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:17,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {10353#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10354#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:17,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {10354#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {10354#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:17,906 INFO L273 TraceCheckUtils]: 10: Hoare triple {10354#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10355#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:17,907 INFO L273 TraceCheckUtils]: 11: Hoare triple {10355#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10355#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:17,908 INFO L273 TraceCheckUtils]: 12: Hoare triple {10355#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10356#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:17,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {10356#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {10356#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:17,910 INFO L273 TraceCheckUtils]: 14: Hoare triple {10356#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10357#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:17,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {10357#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {10357#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:17,911 INFO L273 TraceCheckUtils]: 16: Hoare triple {10357#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10358#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:17,912 INFO L273 TraceCheckUtils]: 17: Hoare triple {10358#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10358#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:17,913 INFO L273 TraceCheckUtils]: 18: Hoare triple {10358#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10359#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:17,914 INFO L273 TraceCheckUtils]: 19: Hoare triple {10359#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10359#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:17,915 INFO L273 TraceCheckUtils]: 20: Hoare triple {10359#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10360#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:17,916 INFO L273 TraceCheckUtils]: 21: Hoare triple {10360#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {10360#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:17,917 INFO L273 TraceCheckUtils]: 22: Hoare triple {10360#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10361#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:17,918 INFO L273 TraceCheckUtils]: 23: Hoare triple {10361#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {10361#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:17,919 INFO L273 TraceCheckUtils]: 24: Hoare triple {10361#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:17,919 INFO L273 TraceCheckUtils]: 25: Hoare triple {10362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:17,920 INFO L273 TraceCheckUtils]: 26: Hoare triple {10362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10363#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:17,921 INFO L273 TraceCheckUtils]: 27: Hoare triple {10363#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {10363#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:17,922 INFO L273 TraceCheckUtils]: 28: Hoare triple {10363#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10364#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:17,923 INFO L273 TraceCheckUtils]: 29: Hoare triple {10364#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10364#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:17,924 INFO L273 TraceCheckUtils]: 30: Hoare triple {10364#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10365#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:17,925 INFO L273 TraceCheckUtils]: 31: Hoare triple {10365#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10365#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:17,926 INFO L273 TraceCheckUtils]: 32: Hoare triple {10365#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10366#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:17,927 INFO L273 TraceCheckUtils]: 33: Hoare triple {10366#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10366#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:17,928 INFO L273 TraceCheckUtils]: 34: Hoare triple {10366#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10367#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:17,928 INFO L273 TraceCheckUtils]: 35: Hoare triple {10367#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {10367#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:17,930 INFO L273 TraceCheckUtils]: 36: Hoare triple {10367#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {10480#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:17,930 INFO L273 TraceCheckUtils]: 37: Hoare triple {10480#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {10351#false} is VALID [2018-11-23 13:06:17,931 INFO L256 TraceCheckUtils]: 38: Hoare triple {10351#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10351#false} is VALID [2018-11-23 13:06:17,931 INFO L273 TraceCheckUtils]: 39: Hoare triple {10351#false} ~cond := #in~cond; {10351#false} is VALID [2018-11-23 13:06:17,931 INFO L273 TraceCheckUtils]: 40: Hoare triple {10351#false} assume 0 == ~cond; {10351#false} is VALID [2018-11-23 13:06:17,931 INFO L273 TraceCheckUtils]: 41: Hoare triple {10351#false} assume !false; {10351#false} is VALID [2018-11-23 13:06:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:17,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:17,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 13:06:17,954 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-11-23 13:06:17,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:17,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:06:18,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:18,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:06:18,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:06:18,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:06:18,005 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 20 states. [2018-11-23 13:06:20,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:20,047 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-11-23 13:06:20,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:06:20,047 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-11-23 13:06:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:06:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 61 transitions. [2018-11-23 13:06:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:06:20,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 61 transitions. [2018-11-23 13:06:20,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 61 transitions. [2018-11-23 13:06:20,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:20,316 INFO L225 Difference]: With dead ends: 82 [2018-11-23 13:06:20,316 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 13:06:20,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:06:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 13:06:20,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-11-23 13:06:20,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:20,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 76 states. [2018-11-23 13:06:20,528 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 76 states. [2018-11-23 13:06:20,529 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 76 states. [2018-11-23 13:06:20,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:20,530 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-11-23 13:06:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-11-23 13:06:20,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:20,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:20,530 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 77 states. [2018-11-23 13:06:20,530 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 77 states. [2018-11-23 13:06:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:20,531 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-11-23 13:06:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-11-23 13:06:20,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:20,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:20,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:20,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 13:06:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-11-23 13:06:20,533 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 42 [2018-11-23 13:06:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:20,533 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-11-23 13:06:20,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:06:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-23 13:06:20,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:06:20,534 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:20,534 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:20,534 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:20,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:20,534 INFO L82 PathProgramCache]: Analyzing trace with hash 23363048, now seen corresponding path program 16 times [2018-11-23 13:06:20,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:20,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:20,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:20,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:20,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:20,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {10889#true} call ULTIMATE.init(); {10889#true} is VALID [2018-11-23 13:06:20,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {10889#true} assume true; {10889#true} is VALID [2018-11-23 13:06:20,910 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10889#true} {10889#true} #37#return; {10889#true} is VALID [2018-11-23 13:06:20,910 INFO L256 TraceCheckUtils]: 3: Hoare triple {10889#true} call #t~ret2 := main(); {10889#true} is VALID [2018-11-23 13:06:20,911 INFO L273 TraceCheckUtils]: 4: Hoare triple {10889#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {10891#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:20,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {10891#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10891#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:20,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {10891#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10892#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:20,912 INFO L273 TraceCheckUtils]: 7: Hoare triple {10892#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {10892#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:20,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {10892#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10893#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:20,913 INFO L273 TraceCheckUtils]: 9: Hoare triple {10893#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {10893#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:20,915 INFO L273 TraceCheckUtils]: 10: Hoare triple {10893#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10894#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:20,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {10894#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10894#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:20,916 INFO L273 TraceCheckUtils]: 12: Hoare triple {10894#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10895#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:20,917 INFO L273 TraceCheckUtils]: 13: Hoare triple {10895#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {10895#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:20,918 INFO L273 TraceCheckUtils]: 14: Hoare triple {10895#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10896#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:20,919 INFO L273 TraceCheckUtils]: 15: Hoare triple {10896#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10896#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:20,920 INFO L273 TraceCheckUtils]: 16: Hoare triple {10896#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10897#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:20,921 INFO L273 TraceCheckUtils]: 17: Hoare triple {10897#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10897#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:20,922 INFO L273 TraceCheckUtils]: 18: Hoare triple {10897#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10898#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:20,922 INFO L273 TraceCheckUtils]: 19: Hoare triple {10898#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10898#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:20,924 INFO L273 TraceCheckUtils]: 20: Hoare triple {10898#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10899#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:20,924 INFO L273 TraceCheckUtils]: 21: Hoare triple {10899#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10899#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:20,925 INFO L273 TraceCheckUtils]: 22: Hoare triple {10899#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10900#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:20,926 INFO L273 TraceCheckUtils]: 23: Hoare triple {10900#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10900#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:20,927 INFO L273 TraceCheckUtils]: 24: Hoare triple {10900#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10901#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:20,928 INFO L273 TraceCheckUtils]: 25: Hoare triple {10901#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {10901#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:20,929 INFO L273 TraceCheckUtils]: 26: Hoare triple {10901#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10902#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:20,930 INFO L273 TraceCheckUtils]: 27: Hoare triple {10902#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10902#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:20,931 INFO L273 TraceCheckUtils]: 28: Hoare triple {10902#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10903#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:20,931 INFO L273 TraceCheckUtils]: 29: Hoare triple {10903#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10903#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:20,933 INFO L273 TraceCheckUtils]: 30: Hoare triple {10903#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10904#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:06:20,933 INFO L273 TraceCheckUtils]: 31: Hoare triple {10904#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10904#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:06:20,934 INFO L273 TraceCheckUtils]: 32: Hoare triple {10904#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10905#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:06:20,935 INFO L273 TraceCheckUtils]: 33: Hoare triple {10905#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10905#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:06:20,936 INFO L273 TraceCheckUtils]: 34: Hoare triple {10905#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10906#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:06:20,937 INFO L273 TraceCheckUtils]: 35: Hoare triple {10906#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {10906#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:06:20,938 INFO L273 TraceCheckUtils]: 36: Hoare triple {10906#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10907#(and (<= main_~x~0 32) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:20,939 INFO L273 TraceCheckUtils]: 37: Hoare triple {10907#(and (<= main_~x~0 32) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {10890#false} is VALID [2018-11-23 13:06:20,939 INFO L256 TraceCheckUtils]: 38: Hoare triple {10890#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10890#false} is VALID [2018-11-23 13:06:20,940 INFO L273 TraceCheckUtils]: 39: Hoare triple {10890#false} ~cond := #in~cond; {10890#false} is VALID [2018-11-23 13:06:20,940 INFO L273 TraceCheckUtils]: 40: Hoare triple {10890#false} assume 0 == ~cond; {10890#false} is VALID [2018-11-23 13:06:20,940 INFO L273 TraceCheckUtils]: 41: Hoare triple {10890#false} assume !false; {10890#false} is VALID [2018-11-23 13:06:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:20,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:20,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:20,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:06:20,967 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:06:20,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:20,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:21,095 INFO L256 TraceCheckUtils]: 0: Hoare triple {10889#true} call ULTIMATE.init(); {10889#true} is VALID [2018-11-23 13:06:21,095 INFO L273 TraceCheckUtils]: 1: Hoare triple {10889#true} assume true; {10889#true} is VALID [2018-11-23 13:06:21,095 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {10889#true} {10889#true} #37#return; {10889#true} is VALID [2018-11-23 13:06:21,096 INFO L256 TraceCheckUtils]: 3: Hoare triple {10889#true} call #t~ret2 := main(); {10889#true} is VALID [2018-11-23 13:06:21,096 INFO L273 TraceCheckUtils]: 4: Hoare triple {10889#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {10891#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:21,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {10891#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10891#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:21,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {10891#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10892#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:21,098 INFO L273 TraceCheckUtils]: 7: Hoare triple {10892#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {10892#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:21,099 INFO L273 TraceCheckUtils]: 8: Hoare triple {10892#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10893#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:21,099 INFO L273 TraceCheckUtils]: 9: Hoare triple {10893#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {10893#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:21,100 INFO L273 TraceCheckUtils]: 10: Hoare triple {10893#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10894#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:21,100 INFO L273 TraceCheckUtils]: 11: Hoare triple {10894#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10894#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:21,101 INFO L273 TraceCheckUtils]: 12: Hoare triple {10894#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10895#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:21,102 INFO L273 TraceCheckUtils]: 13: Hoare triple {10895#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {10895#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:21,103 INFO L273 TraceCheckUtils]: 14: Hoare triple {10895#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10896#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:21,104 INFO L273 TraceCheckUtils]: 15: Hoare triple {10896#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10896#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:21,105 INFO L273 TraceCheckUtils]: 16: Hoare triple {10896#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10897#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:21,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {10897#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10897#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:21,107 INFO L273 TraceCheckUtils]: 18: Hoare triple {10897#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10898#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:21,108 INFO L273 TraceCheckUtils]: 19: Hoare triple {10898#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10898#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:21,109 INFO L273 TraceCheckUtils]: 20: Hoare triple {10898#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10899#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:21,109 INFO L273 TraceCheckUtils]: 21: Hoare triple {10899#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10899#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:21,110 INFO L273 TraceCheckUtils]: 22: Hoare triple {10899#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10900#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:21,111 INFO L273 TraceCheckUtils]: 23: Hoare triple {10900#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10900#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:21,112 INFO L273 TraceCheckUtils]: 24: Hoare triple {10900#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10901#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:21,113 INFO L273 TraceCheckUtils]: 25: Hoare triple {10901#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {10901#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:21,114 INFO L273 TraceCheckUtils]: 26: Hoare triple {10901#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10902#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:21,115 INFO L273 TraceCheckUtils]: 27: Hoare triple {10902#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10902#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:21,116 INFO L273 TraceCheckUtils]: 28: Hoare triple {10902#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10903#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:21,117 INFO L273 TraceCheckUtils]: 29: Hoare triple {10903#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10903#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:21,118 INFO L273 TraceCheckUtils]: 30: Hoare triple {10903#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10904#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:06:21,118 INFO L273 TraceCheckUtils]: 31: Hoare triple {10904#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10904#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:06:21,119 INFO L273 TraceCheckUtils]: 32: Hoare triple {10904#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10905#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:06:21,120 INFO L273 TraceCheckUtils]: 33: Hoare triple {10905#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {10905#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:06:21,121 INFO L273 TraceCheckUtils]: 34: Hoare triple {10905#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {10906#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:06:21,122 INFO L273 TraceCheckUtils]: 35: Hoare triple {10906#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {10906#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:06:21,123 INFO L273 TraceCheckUtils]: 36: Hoare triple {10906#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {11019#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:06:21,124 INFO L273 TraceCheckUtils]: 37: Hoare triple {11019#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {10890#false} is VALID [2018-11-23 13:06:21,124 INFO L256 TraceCheckUtils]: 38: Hoare triple {10890#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {10890#false} is VALID [2018-11-23 13:06:21,124 INFO L273 TraceCheckUtils]: 39: Hoare triple {10890#false} ~cond := #in~cond; {10890#false} is VALID [2018-11-23 13:06:21,125 INFO L273 TraceCheckUtils]: 40: Hoare triple {10890#false} assume 0 == ~cond; {10890#false} is VALID [2018-11-23 13:06:21,125 INFO L273 TraceCheckUtils]: 41: Hoare triple {10890#false} assume !false; {10890#false} is VALID [2018-11-23 13:06:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:21,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:21,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 13:06:21,146 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-11-23 13:06:21,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:21,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:06:21,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:21,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:06:21,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:06:21,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:06:21,202 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 20 states. [2018-11-23 13:06:23,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:23,029 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-11-23 13:06:23,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:06:23,029 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-11-23 13:06:23,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:06:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions. [2018-11-23 13:06:23,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:06:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions. [2018-11-23 13:06:23,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 55 transitions. [2018-11-23 13:06:23,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:23,094 INFO L225 Difference]: With dead ends: 84 [2018-11-23 13:06:23,094 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 13:06:23,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:06:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 13:06:23,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-11-23 13:06:23,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:23,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 78 states. [2018-11-23 13:06:23,171 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 78 states. [2018-11-23 13:06:23,171 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 78 states. [2018-11-23 13:06:23,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:23,173 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-11-23 13:06:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-23 13:06:23,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:23,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:23,174 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 79 states. [2018-11-23 13:06:23,174 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 79 states. [2018-11-23 13:06:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:23,175 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-11-23 13:06:23,175 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-11-23 13:06:23,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:23,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:23,176 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:23,176 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:23,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 13:06:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-11-23 13:06:23,177 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 42 [2018-11-23 13:06:23,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:23,177 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-11-23 13:06:23,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:06:23,177 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-23 13:06:23,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 13:06:23,177 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:23,178 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:23,178 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:23,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:23,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1311420475, now seen corresponding path program 17 times [2018-11-23 13:06:23,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:23,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:23,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:23,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:23,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:24,265 INFO L256 TraceCheckUtils]: 0: Hoare triple {11438#true} call ULTIMATE.init(); {11438#true} is VALID [2018-11-23 13:06:24,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {11438#true} assume true; {11438#true} is VALID [2018-11-23 13:06:24,265 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11438#true} {11438#true} #37#return; {11438#true} is VALID [2018-11-23 13:06:24,265 INFO L256 TraceCheckUtils]: 3: Hoare triple {11438#true} call #t~ret2 := main(); {11438#true} is VALID [2018-11-23 13:06:24,266 INFO L273 TraceCheckUtils]: 4: Hoare triple {11438#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {11440#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:24,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {11440#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11440#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:24,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {11440#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11441#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:24,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {11441#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11441#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:24,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {11441#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:24,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {11442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {11442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:24,271 INFO L273 TraceCheckUtils]: 10: Hoare triple {11442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11443#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:24,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {11443#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11443#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:24,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {11443#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11444#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:24,274 INFO L273 TraceCheckUtils]: 13: Hoare triple {11444#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {11444#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:24,275 INFO L273 TraceCheckUtils]: 14: Hoare triple {11444#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11445#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:24,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {11445#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {11445#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:24,277 INFO L273 TraceCheckUtils]: 16: Hoare triple {11445#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11446#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:24,278 INFO L273 TraceCheckUtils]: 17: Hoare triple {11446#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11446#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:24,279 INFO L273 TraceCheckUtils]: 18: Hoare triple {11446#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11447#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:24,279 INFO L273 TraceCheckUtils]: 19: Hoare triple {11447#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11447#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:24,280 INFO L273 TraceCheckUtils]: 20: Hoare triple {11447#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11448#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:24,281 INFO L273 TraceCheckUtils]: 21: Hoare triple {11448#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {11448#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:24,282 INFO L273 TraceCheckUtils]: 22: Hoare triple {11448#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11449#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:24,283 INFO L273 TraceCheckUtils]: 23: Hoare triple {11449#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {11449#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:24,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {11449#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:24,285 INFO L273 TraceCheckUtils]: 25: Hoare triple {11450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:24,286 INFO L273 TraceCheckUtils]: 26: Hoare triple {11450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11451#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:24,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {11451#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {11451#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:24,288 INFO L273 TraceCheckUtils]: 28: Hoare triple {11451#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11452#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:24,288 INFO L273 TraceCheckUtils]: 29: Hoare triple {11452#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11452#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:24,289 INFO L273 TraceCheckUtils]: 30: Hoare triple {11452#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11453#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:24,290 INFO L273 TraceCheckUtils]: 31: Hoare triple {11453#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11453#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:24,291 INFO L273 TraceCheckUtils]: 32: Hoare triple {11453#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11454#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:24,292 INFO L273 TraceCheckUtils]: 33: Hoare triple {11454#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11454#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:24,293 INFO L273 TraceCheckUtils]: 34: Hoare triple {11454#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11455#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:24,294 INFO L273 TraceCheckUtils]: 35: Hoare triple {11455#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {11455#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:24,295 INFO L273 TraceCheckUtils]: 36: Hoare triple {11455#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11456#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:24,296 INFO L273 TraceCheckUtils]: 37: Hoare triple {11456#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11456#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:24,297 INFO L273 TraceCheckUtils]: 38: Hoare triple {11456#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11457#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:24,298 INFO L273 TraceCheckUtils]: 39: Hoare triple {11457#(and (<= main_~x~0 17) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {11439#false} is VALID [2018-11-23 13:06:24,298 INFO L256 TraceCheckUtils]: 40: Hoare triple {11439#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11439#false} is VALID [2018-11-23 13:06:24,298 INFO L273 TraceCheckUtils]: 41: Hoare triple {11439#false} ~cond := #in~cond; {11439#false} is VALID [2018-11-23 13:06:24,298 INFO L273 TraceCheckUtils]: 42: Hoare triple {11439#false} assume 0 == ~cond; {11439#false} is VALID [2018-11-23 13:06:24,299 INFO L273 TraceCheckUtils]: 43: Hoare triple {11439#false} assume !false; {11439#false} is VALID [2018-11-23 13:06:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:24,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:24,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:24,310 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:06:54,664 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 13:06:54,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:54,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:54,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {11438#true} call ULTIMATE.init(); {11438#true} is VALID [2018-11-23 13:06:54,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {11438#true} assume true; {11438#true} is VALID [2018-11-23 13:06:54,832 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {11438#true} {11438#true} #37#return; {11438#true} is VALID [2018-11-23 13:06:54,832 INFO L256 TraceCheckUtils]: 3: Hoare triple {11438#true} call #t~ret2 := main(); {11438#true} is VALID [2018-11-23 13:06:54,832 INFO L273 TraceCheckUtils]: 4: Hoare triple {11438#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {11440#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:54,833 INFO L273 TraceCheckUtils]: 5: Hoare triple {11440#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11440#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:54,833 INFO L273 TraceCheckUtils]: 6: Hoare triple {11440#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11441#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:54,834 INFO L273 TraceCheckUtils]: 7: Hoare triple {11441#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11441#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:06:54,834 INFO L273 TraceCheckUtils]: 8: Hoare triple {11441#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:54,835 INFO L273 TraceCheckUtils]: 9: Hoare triple {11442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {11442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:54,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {11442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11443#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:54,836 INFO L273 TraceCheckUtils]: 11: Hoare triple {11443#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11443#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:06:54,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {11443#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11444#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:54,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {11444#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {11444#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:54,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {11444#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11445#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:54,840 INFO L273 TraceCheckUtils]: 15: Hoare triple {11445#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {11445#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:06:54,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {11445#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11446#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:54,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {11446#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11446#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:54,842 INFO L273 TraceCheckUtils]: 18: Hoare triple {11446#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11447#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:54,843 INFO L273 TraceCheckUtils]: 19: Hoare triple {11447#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11447#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:06:54,844 INFO L273 TraceCheckUtils]: 20: Hoare triple {11447#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11448#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:54,845 INFO L273 TraceCheckUtils]: 21: Hoare triple {11448#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {11448#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:54,846 INFO L273 TraceCheckUtils]: 22: Hoare triple {11448#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11449#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:54,847 INFO L273 TraceCheckUtils]: 23: Hoare triple {11449#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {11449#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:06:54,848 INFO L273 TraceCheckUtils]: 24: Hoare triple {11449#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:54,848 INFO L273 TraceCheckUtils]: 25: Hoare triple {11450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:54,849 INFO L273 TraceCheckUtils]: 26: Hoare triple {11450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11451#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:54,850 INFO L273 TraceCheckUtils]: 27: Hoare triple {11451#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {11451#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:06:54,851 INFO L273 TraceCheckUtils]: 28: Hoare triple {11451#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11452#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:54,852 INFO L273 TraceCheckUtils]: 29: Hoare triple {11452#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11452#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:54,853 INFO L273 TraceCheckUtils]: 30: Hoare triple {11452#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11453#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:54,854 INFO L273 TraceCheckUtils]: 31: Hoare triple {11453#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11453#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:06:54,855 INFO L273 TraceCheckUtils]: 32: Hoare triple {11453#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11454#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:54,855 INFO L273 TraceCheckUtils]: 33: Hoare triple {11454#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11454#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:54,856 INFO L273 TraceCheckUtils]: 34: Hoare triple {11454#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11455#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:54,857 INFO L273 TraceCheckUtils]: 35: Hoare triple {11455#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {11455#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:06:54,858 INFO L273 TraceCheckUtils]: 36: Hoare triple {11455#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11456#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:54,859 INFO L273 TraceCheckUtils]: 37: Hoare triple {11456#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {11456#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:54,860 INFO L273 TraceCheckUtils]: 38: Hoare triple {11456#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {11575#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:06:54,861 INFO L273 TraceCheckUtils]: 39: Hoare triple {11575#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {11439#false} is VALID [2018-11-23 13:06:54,861 INFO L256 TraceCheckUtils]: 40: Hoare triple {11439#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {11439#false} is VALID [2018-11-23 13:06:54,861 INFO L273 TraceCheckUtils]: 41: Hoare triple {11439#false} ~cond := #in~cond; {11439#false} is VALID [2018-11-23 13:06:54,861 INFO L273 TraceCheckUtils]: 42: Hoare triple {11439#false} assume 0 == ~cond; {11439#false} is VALID [2018-11-23 13:06:54,861 INFO L273 TraceCheckUtils]: 43: Hoare triple {11439#false} assume !false; {11439#false} is VALID [2018-11-23 13:06:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:54,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:54,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 13:06:54,886 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-11-23 13:06:54,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:54,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 13:06:54,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:54,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:06:54,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:06:54,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:06:54,944 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 21 states. [2018-11-23 13:06:57,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:57,045 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-11-23 13:06:57,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:06:57,045 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-11-23 13:06:57,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:06:57,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 63 transitions. [2018-11-23 13:06:57,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:06:57,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 63 transitions. [2018-11-23 13:06:57,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 63 transitions. [2018-11-23 13:06:57,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:57,121 INFO L225 Difference]: With dead ends: 86 [2018-11-23 13:06:57,121 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 13:06:57,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:06:57,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 13:06:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-11-23 13:06:57,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:57,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 80 states. [2018-11-23 13:06:57,205 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 80 states. [2018-11-23 13:06:57,205 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 80 states. [2018-11-23 13:06:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:57,207 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-11-23 13:06:57,207 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-23 13:06:57,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:57,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:57,207 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 81 states. [2018-11-23 13:06:57,208 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 81 states. [2018-11-23 13:06:57,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:57,209 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-11-23 13:06:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-23 13:06:57,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:57,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:57,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:57,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 13:06:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-11-23 13:06:57,211 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 44 [2018-11-23 13:06:57,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:57,211 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-11-23 13:06:57,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:06:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-11-23 13:06:57,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 13:06:57,212 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:57,212 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:57,212 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:57,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:57,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2109642979, now seen corresponding path program 17 times [2018-11-23 13:06:57,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:57,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:57,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:57,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:57,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:57,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {12004#true} call ULTIMATE.init(); {12004#true} is VALID [2018-11-23 13:06:57,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {12004#true} assume true; {12004#true} is VALID [2018-11-23 13:06:57,798 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12004#true} {12004#true} #37#return; {12004#true} is VALID [2018-11-23 13:06:57,798 INFO L256 TraceCheckUtils]: 3: Hoare triple {12004#true} call #t~ret2 := main(); {12004#true} is VALID [2018-11-23 13:06:57,798 INFO L273 TraceCheckUtils]: 4: Hoare triple {12004#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {12006#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:57,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {12006#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12006#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:06:57,800 INFO L273 TraceCheckUtils]: 6: Hoare triple {12006#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:57,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {12007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {12007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:06:57,801 INFO L273 TraceCheckUtils]: 8: Hoare triple {12007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12008#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:57,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {12008#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {12008#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:06:57,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {12008#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12009#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:57,804 INFO L273 TraceCheckUtils]: 11: Hoare triple {12009#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12009#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:06:57,805 INFO L273 TraceCheckUtils]: 12: Hoare triple {12009#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12010#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:57,806 INFO L273 TraceCheckUtils]: 13: Hoare triple {12010#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {12010#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:06:57,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {12010#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:57,807 INFO L273 TraceCheckUtils]: 15: Hoare triple {12011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:06:57,808 INFO L273 TraceCheckUtils]: 16: Hoare triple {12011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:57,809 INFO L273 TraceCheckUtils]: 17: Hoare triple {12012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:06:57,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {12012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12013#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:57,811 INFO L273 TraceCheckUtils]: 19: Hoare triple {12013#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12013#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:06:57,812 INFO L273 TraceCheckUtils]: 20: Hoare triple {12013#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:57,813 INFO L273 TraceCheckUtils]: 21: Hoare triple {12014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:06:57,814 INFO L273 TraceCheckUtils]: 22: Hoare triple {12014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:57,815 INFO L273 TraceCheckUtils]: 23: Hoare triple {12015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:06:57,816 INFO L273 TraceCheckUtils]: 24: Hoare triple {12015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12016#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:57,816 INFO L273 TraceCheckUtils]: 25: Hoare triple {12016#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {12016#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:06:57,818 INFO L273 TraceCheckUtils]: 26: Hoare triple {12016#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12017#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:57,818 INFO L273 TraceCheckUtils]: 27: Hoare triple {12017#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12017#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:06:57,819 INFO L273 TraceCheckUtils]: 28: Hoare triple {12017#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:57,820 INFO L273 TraceCheckUtils]: 29: Hoare triple {12018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:06:57,821 INFO L273 TraceCheckUtils]: 30: Hoare triple {12018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:06:57,822 INFO L273 TraceCheckUtils]: 31: Hoare triple {12019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:06:57,823 INFO L273 TraceCheckUtils]: 32: Hoare triple {12019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12020#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:06:57,824 INFO L273 TraceCheckUtils]: 33: Hoare triple {12020#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12020#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:06:57,825 INFO L273 TraceCheckUtils]: 34: Hoare triple {12020#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:06:57,826 INFO L273 TraceCheckUtils]: 35: Hoare triple {12021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {12021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:06:57,827 INFO L273 TraceCheckUtils]: 36: Hoare triple {12021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:06:57,827 INFO L273 TraceCheckUtils]: 37: Hoare triple {12022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:06:57,829 INFO L273 TraceCheckUtils]: 38: Hoare triple {12022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12023#(and (<= main_~x~0 34) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:06:57,830 INFO L273 TraceCheckUtils]: 39: Hoare triple {12023#(and (<= main_~x~0 34) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {12005#false} is VALID [2018-11-23 13:06:57,830 INFO L256 TraceCheckUtils]: 40: Hoare triple {12005#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12005#false} is VALID [2018-11-23 13:06:57,830 INFO L273 TraceCheckUtils]: 41: Hoare triple {12005#false} ~cond := #in~cond; {12005#false} is VALID [2018-11-23 13:06:57,830 INFO L273 TraceCheckUtils]: 42: Hoare triple {12005#false} assume 0 == ~cond; {12005#false} is VALID [2018-11-23 13:06:57,830 INFO L273 TraceCheckUtils]: 43: Hoare triple {12005#false} assume !false; {12005#false} is VALID [2018-11-23 13:06:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:57,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:57,835 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:57,844 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:07:21,991 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 13:07:21,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:22,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:22,269 INFO L256 TraceCheckUtils]: 0: Hoare triple {12004#true} call ULTIMATE.init(); {12004#true} is VALID [2018-11-23 13:07:22,269 INFO L273 TraceCheckUtils]: 1: Hoare triple {12004#true} assume true; {12004#true} is VALID [2018-11-23 13:07:22,270 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12004#true} {12004#true} #37#return; {12004#true} is VALID [2018-11-23 13:07:22,270 INFO L256 TraceCheckUtils]: 3: Hoare triple {12004#true} call #t~ret2 := main(); {12004#true} is VALID [2018-11-23 13:07:22,270 INFO L273 TraceCheckUtils]: 4: Hoare triple {12004#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {12006#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:22,277 INFO L273 TraceCheckUtils]: 5: Hoare triple {12006#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12006#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:22,278 INFO L273 TraceCheckUtils]: 6: Hoare triple {12006#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:22,279 INFO L273 TraceCheckUtils]: 7: Hoare triple {12007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {12007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:22,280 INFO L273 TraceCheckUtils]: 8: Hoare triple {12007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12008#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:22,280 INFO L273 TraceCheckUtils]: 9: Hoare triple {12008#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {12008#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:22,281 INFO L273 TraceCheckUtils]: 10: Hoare triple {12008#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12009#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:22,281 INFO L273 TraceCheckUtils]: 11: Hoare triple {12009#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12009#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:22,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {12009#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12010#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:22,283 INFO L273 TraceCheckUtils]: 13: Hoare triple {12010#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {12010#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:22,284 INFO L273 TraceCheckUtils]: 14: Hoare triple {12010#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:22,285 INFO L273 TraceCheckUtils]: 15: Hoare triple {12011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:22,286 INFO L273 TraceCheckUtils]: 16: Hoare triple {12011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:22,287 INFO L273 TraceCheckUtils]: 17: Hoare triple {12012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:22,288 INFO L273 TraceCheckUtils]: 18: Hoare triple {12012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12013#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:22,288 INFO L273 TraceCheckUtils]: 19: Hoare triple {12013#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12013#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:22,290 INFO L273 TraceCheckUtils]: 20: Hoare triple {12013#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:22,290 INFO L273 TraceCheckUtils]: 21: Hoare triple {12014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:22,292 INFO L273 TraceCheckUtils]: 22: Hoare triple {12014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:22,292 INFO L273 TraceCheckUtils]: 23: Hoare triple {12015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:22,294 INFO L273 TraceCheckUtils]: 24: Hoare triple {12015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12016#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:22,294 INFO L273 TraceCheckUtils]: 25: Hoare triple {12016#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {12016#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:22,295 INFO L273 TraceCheckUtils]: 26: Hoare triple {12016#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12017#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:22,296 INFO L273 TraceCheckUtils]: 27: Hoare triple {12017#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12017#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:22,297 INFO L273 TraceCheckUtils]: 28: Hoare triple {12017#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:22,298 INFO L273 TraceCheckUtils]: 29: Hoare triple {12018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:22,299 INFO L273 TraceCheckUtils]: 30: Hoare triple {12018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:22,300 INFO L273 TraceCheckUtils]: 31: Hoare triple {12019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:22,301 INFO L273 TraceCheckUtils]: 32: Hoare triple {12019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12020#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:22,302 INFO L273 TraceCheckUtils]: 33: Hoare triple {12020#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12020#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:22,303 INFO L273 TraceCheckUtils]: 34: Hoare triple {12020#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:22,304 INFO L273 TraceCheckUtils]: 35: Hoare triple {12021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {12021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:22,305 INFO L273 TraceCheckUtils]: 36: Hoare triple {12021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:07:22,305 INFO L273 TraceCheckUtils]: 37: Hoare triple {12022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:07:22,307 INFO L273 TraceCheckUtils]: 38: Hoare triple {12022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {12141#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:07:22,307 INFO L273 TraceCheckUtils]: 39: Hoare triple {12141#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(~x~0 % 4294967296 < 99); {12005#false} is VALID [2018-11-23 13:07:22,308 INFO L256 TraceCheckUtils]: 40: Hoare triple {12005#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12005#false} is VALID [2018-11-23 13:07:22,308 INFO L273 TraceCheckUtils]: 41: Hoare triple {12005#false} ~cond := #in~cond; {12005#false} is VALID [2018-11-23 13:07:22,308 INFO L273 TraceCheckUtils]: 42: Hoare triple {12005#false} assume 0 == ~cond; {12005#false} is VALID [2018-11-23 13:07:22,308 INFO L273 TraceCheckUtils]: 43: Hoare triple {12005#false} assume !false; {12005#false} is VALID [2018-11-23 13:07:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:22,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:22,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 13:07:22,332 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-11-23 13:07:22,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:22,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 13:07:22,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:22,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:07:22,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:07:22,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:07:22,406 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 21 states. [2018-11-23 13:07:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:24,375 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2018-11-23 13:07:24,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:07:24,375 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-11-23 13:07:24,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:07:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 57 transitions. [2018-11-23 13:07:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:07:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 57 transitions. [2018-11-23 13:07:24,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 57 transitions. [2018-11-23 13:07:24,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:24,442 INFO L225 Difference]: With dead ends: 88 [2018-11-23 13:07:24,442 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 13:07:24,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:07:24,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 13:07:24,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-11-23 13:07:24,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:24,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 82 states. [2018-11-23 13:07:24,519 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 82 states. [2018-11-23 13:07:24,519 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 82 states. [2018-11-23 13:07:24,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:24,521 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-23 13:07:24,521 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-23 13:07:24,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:24,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:24,522 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 83 states. [2018-11-23 13:07:24,522 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 83 states. [2018-11-23 13:07:24,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:24,523 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-23 13:07:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-23 13:07:24,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:24,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:24,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:24,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:24,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 13:07:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-11-23 13:07:24,525 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 44 [2018-11-23 13:07:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:24,525 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-23 13:07:24,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:07:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-23 13:07:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:07:24,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:24,526 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:24,526 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:24,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:24,527 INFO L82 PathProgramCache]: Analyzing trace with hash -774326718, now seen corresponding path program 18 times [2018-11-23 13:07:24,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:24,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:24,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:24,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:24,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:25,540 INFO L256 TraceCheckUtils]: 0: Hoare triple {12580#true} call ULTIMATE.init(); {12580#true} is VALID [2018-11-23 13:07:25,540 INFO L273 TraceCheckUtils]: 1: Hoare triple {12580#true} assume true; {12580#true} is VALID [2018-11-23 13:07:25,540 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12580#true} {12580#true} #37#return; {12580#true} is VALID [2018-11-23 13:07:25,540 INFO L256 TraceCheckUtils]: 3: Hoare triple {12580#true} call #t~ret2 := main(); {12580#true} is VALID [2018-11-23 13:07:25,541 INFO L273 TraceCheckUtils]: 4: Hoare triple {12580#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {12582#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:25,542 INFO L273 TraceCheckUtils]: 5: Hoare triple {12582#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12582#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:25,543 INFO L273 TraceCheckUtils]: 6: Hoare triple {12582#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12583#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:25,544 INFO L273 TraceCheckUtils]: 7: Hoare triple {12583#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12583#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:25,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {12583#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12584#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:25,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {12584#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {12584#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:25,547 INFO L273 TraceCheckUtils]: 10: Hoare triple {12584#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12585#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:25,547 INFO L273 TraceCheckUtils]: 11: Hoare triple {12585#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12585#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:25,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {12585#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12586#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:25,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {12586#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {12586#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:25,550 INFO L273 TraceCheckUtils]: 14: Hoare triple {12586#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12587#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:25,551 INFO L273 TraceCheckUtils]: 15: Hoare triple {12587#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {12587#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:25,552 INFO L273 TraceCheckUtils]: 16: Hoare triple {12587#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12588#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:25,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {12588#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12588#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:25,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {12588#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12589#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:25,555 INFO L273 TraceCheckUtils]: 19: Hoare triple {12589#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12589#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:25,556 INFO L273 TraceCheckUtils]: 20: Hoare triple {12589#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12590#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:25,556 INFO L273 TraceCheckUtils]: 21: Hoare triple {12590#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {12590#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:25,557 INFO L273 TraceCheckUtils]: 22: Hoare triple {12590#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12591#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:25,558 INFO L273 TraceCheckUtils]: 23: Hoare triple {12591#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {12591#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:25,559 INFO L273 TraceCheckUtils]: 24: Hoare triple {12591#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12592#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:25,560 INFO L273 TraceCheckUtils]: 25: Hoare triple {12592#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12592#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:25,561 INFO L273 TraceCheckUtils]: 26: Hoare triple {12592#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12593#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:25,562 INFO L273 TraceCheckUtils]: 27: Hoare triple {12593#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {12593#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:25,563 INFO L273 TraceCheckUtils]: 28: Hoare triple {12593#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12594#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:25,564 INFO L273 TraceCheckUtils]: 29: Hoare triple {12594#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12594#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:25,565 INFO L273 TraceCheckUtils]: 30: Hoare triple {12594#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12595#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:25,565 INFO L273 TraceCheckUtils]: 31: Hoare triple {12595#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12595#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:25,566 INFO L273 TraceCheckUtils]: 32: Hoare triple {12595#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12596#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:25,567 INFO L273 TraceCheckUtils]: 33: Hoare triple {12596#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12596#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:25,568 INFO L273 TraceCheckUtils]: 34: Hoare triple {12596#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12597#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:25,569 INFO L273 TraceCheckUtils]: 35: Hoare triple {12597#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {12597#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:25,570 INFO L273 TraceCheckUtils]: 36: Hoare triple {12597#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12598#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:25,571 INFO L273 TraceCheckUtils]: 37: Hoare triple {12598#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12598#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:25,572 INFO L273 TraceCheckUtils]: 38: Hoare triple {12598#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12599#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:25,573 INFO L273 TraceCheckUtils]: 39: Hoare triple {12599#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12599#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:25,574 INFO L273 TraceCheckUtils]: 40: Hoare triple {12599#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12600#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:25,575 INFO L273 TraceCheckUtils]: 41: Hoare triple {12600#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {12581#false} is VALID [2018-11-23 13:07:25,575 INFO L256 TraceCheckUtils]: 42: Hoare triple {12581#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12581#false} is VALID [2018-11-23 13:07:25,575 INFO L273 TraceCheckUtils]: 43: Hoare triple {12581#false} ~cond := #in~cond; {12581#false} is VALID [2018-11-23 13:07:25,575 INFO L273 TraceCheckUtils]: 44: Hoare triple {12581#false} assume 0 == ~cond; {12581#false} is VALID [2018-11-23 13:07:25,576 INFO L273 TraceCheckUtils]: 45: Hoare triple {12581#false} assume !false; {12581#false} is VALID [2018-11-23 13:07:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:25,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:25,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:25,588 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:07:26,905 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 13:07:26,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:26,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:27,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {12580#true} call ULTIMATE.init(); {12580#true} is VALID [2018-11-23 13:07:27,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {12580#true} assume true; {12580#true} is VALID [2018-11-23 13:07:27,119 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {12580#true} {12580#true} #37#return; {12580#true} is VALID [2018-11-23 13:07:27,119 INFO L256 TraceCheckUtils]: 3: Hoare triple {12580#true} call #t~ret2 := main(); {12580#true} is VALID [2018-11-23 13:07:27,120 INFO L273 TraceCheckUtils]: 4: Hoare triple {12580#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {12582#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:27,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {12582#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12582#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:27,122 INFO L273 TraceCheckUtils]: 6: Hoare triple {12582#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12583#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:27,122 INFO L273 TraceCheckUtils]: 7: Hoare triple {12583#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12583#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:27,123 INFO L273 TraceCheckUtils]: 8: Hoare triple {12583#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12584#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:27,123 INFO L273 TraceCheckUtils]: 9: Hoare triple {12584#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {12584#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:27,124 INFO L273 TraceCheckUtils]: 10: Hoare triple {12584#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12585#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:27,125 INFO L273 TraceCheckUtils]: 11: Hoare triple {12585#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12585#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:27,126 INFO L273 TraceCheckUtils]: 12: Hoare triple {12585#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12586#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:27,127 INFO L273 TraceCheckUtils]: 13: Hoare triple {12586#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {12586#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:27,128 INFO L273 TraceCheckUtils]: 14: Hoare triple {12586#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12587#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:27,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {12587#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {12587#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:27,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {12587#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12588#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:27,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {12588#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12588#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:27,132 INFO L273 TraceCheckUtils]: 18: Hoare triple {12588#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12589#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:27,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {12589#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12589#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:27,133 INFO L273 TraceCheckUtils]: 20: Hoare triple {12589#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12590#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:27,134 INFO L273 TraceCheckUtils]: 21: Hoare triple {12590#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {12590#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:27,135 INFO L273 TraceCheckUtils]: 22: Hoare triple {12590#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12591#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:27,136 INFO L273 TraceCheckUtils]: 23: Hoare triple {12591#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {12591#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:27,137 INFO L273 TraceCheckUtils]: 24: Hoare triple {12591#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12592#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:27,138 INFO L273 TraceCheckUtils]: 25: Hoare triple {12592#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12592#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:27,139 INFO L273 TraceCheckUtils]: 26: Hoare triple {12592#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12593#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:27,140 INFO L273 TraceCheckUtils]: 27: Hoare triple {12593#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {12593#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:27,141 INFO L273 TraceCheckUtils]: 28: Hoare triple {12593#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12594#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:27,141 INFO L273 TraceCheckUtils]: 29: Hoare triple {12594#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12594#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:27,142 INFO L273 TraceCheckUtils]: 30: Hoare triple {12594#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12595#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:27,143 INFO L273 TraceCheckUtils]: 31: Hoare triple {12595#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12595#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:27,144 INFO L273 TraceCheckUtils]: 32: Hoare triple {12595#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12596#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:27,145 INFO L273 TraceCheckUtils]: 33: Hoare triple {12596#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12596#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:27,146 INFO L273 TraceCheckUtils]: 34: Hoare triple {12596#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12597#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:27,147 INFO L273 TraceCheckUtils]: 35: Hoare triple {12597#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {12597#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:27,148 INFO L273 TraceCheckUtils]: 36: Hoare triple {12597#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12598#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:27,149 INFO L273 TraceCheckUtils]: 37: Hoare triple {12598#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12598#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:27,150 INFO L273 TraceCheckUtils]: 38: Hoare triple {12598#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12599#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:27,150 INFO L273 TraceCheckUtils]: 39: Hoare triple {12599#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {12599#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:27,152 INFO L273 TraceCheckUtils]: 40: Hoare triple {12599#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {12724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:27,152 INFO L273 TraceCheckUtils]: 41: Hoare triple {12724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {12581#false} is VALID [2018-11-23 13:07:27,153 INFO L256 TraceCheckUtils]: 42: Hoare triple {12581#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {12581#false} is VALID [2018-11-23 13:07:27,153 INFO L273 TraceCheckUtils]: 43: Hoare triple {12581#false} ~cond := #in~cond; {12581#false} is VALID [2018-11-23 13:07:27,153 INFO L273 TraceCheckUtils]: 44: Hoare triple {12581#false} assume 0 == ~cond; {12581#false} is VALID [2018-11-23 13:07:27,153 INFO L273 TraceCheckUtils]: 45: Hoare triple {12581#false} assume !false; {12581#false} is VALID [2018-11-23 13:07:27,156 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:27,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:27,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 13:07:27,175 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-11-23 13:07:27,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:27,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:07:27,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:27,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:07:27,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:07:27,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:07:27,231 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 22 states. [2018-11-23 13:07:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:30,020 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-23 13:07:30,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:07:30,020 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-11-23 13:07:30,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:07:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 66 transitions. [2018-11-23 13:07:30,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:07:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 66 transitions. [2018-11-23 13:07:30,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 66 transitions. [2018-11-23 13:07:30,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:30,101 INFO L225 Difference]: With dead ends: 90 [2018-11-23 13:07:30,101 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 13:07:30,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:07:30,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 13:07:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-23 13:07:30,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:30,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 84 states. [2018-11-23 13:07:30,207 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 84 states. [2018-11-23 13:07:30,207 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 84 states. [2018-11-23 13:07:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:30,209 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2018-11-23 13:07:30,209 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2018-11-23 13:07:30,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:30,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:30,210 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 85 states. [2018-11-23 13:07:30,210 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 85 states. [2018-11-23 13:07:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:30,212 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2018-11-23 13:07:30,212 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2018-11-23 13:07:30,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:30,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:30,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:30,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:30,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 13:07:30,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-11-23 13:07:30,214 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 46 [2018-11-23 13:07:30,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:30,214 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-11-23 13:07:30,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:07:30,214 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-11-23 13:07:30,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:07:30,215 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:30,215 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:30,215 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:30,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:30,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1274929438, now seen corresponding path program 18 times [2018-11-23 13:07:30,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:30,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:30,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:30,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:30,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:30,645 INFO L256 TraceCheckUtils]: 0: Hoare triple {13173#true} call ULTIMATE.init(); {13173#true} is VALID [2018-11-23 13:07:30,646 INFO L273 TraceCheckUtils]: 1: Hoare triple {13173#true} assume true; {13173#true} is VALID [2018-11-23 13:07:30,646 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13173#true} {13173#true} #37#return; {13173#true} is VALID [2018-11-23 13:07:30,646 INFO L256 TraceCheckUtils]: 3: Hoare triple {13173#true} call #t~ret2 := main(); {13173#true} is VALID [2018-11-23 13:07:30,647 INFO L273 TraceCheckUtils]: 4: Hoare triple {13173#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {13175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:30,647 INFO L273 TraceCheckUtils]: 5: Hoare triple {13175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:30,648 INFO L273 TraceCheckUtils]: 6: Hoare triple {13175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:30,648 INFO L273 TraceCheckUtils]: 7: Hoare triple {13176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {13176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:30,649 INFO L273 TraceCheckUtils]: 8: Hoare triple {13176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:30,649 INFO L273 TraceCheckUtils]: 9: Hoare triple {13177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {13177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:30,650 INFO L273 TraceCheckUtils]: 10: Hoare triple {13177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:30,651 INFO L273 TraceCheckUtils]: 11: Hoare triple {13178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:30,652 INFO L273 TraceCheckUtils]: 12: Hoare triple {13178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:30,652 INFO L273 TraceCheckUtils]: 13: Hoare triple {13179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {13179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:30,654 INFO L273 TraceCheckUtils]: 14: Hoare triple {13179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:30,654 INFO L273 TraceCheckUtils]: 15: Hoare triple {13180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:30,655 INFO L273 TraceCheckUtils]: 16: Hoare triple {13180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:30,656 INFO L273 TraceCheckUtils]: 17: Hoare triple {13181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:30,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {13181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:30,658 INFO L273 TraceCheckUtils]: 19: Hoare triple {13182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:30,659 INFO L273 TraceCheckUtils]: 20: Hoare triple {13182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:30,660 INFO L273 TraceCheckUtils]: 21: Hoare triple {13183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:30,661 INFO L273 TraceCheckUtils]: 22: Hoare triple {13183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:30,661 INFO L273 TraceCheckUtils]: 23: Hoare triple {13184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:30,663 INFO L273 TraceCheckUtils]: 24: Hoare triple {13184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:30,663 INFO L273 TraceCheckUtils]: 25: Hoare triple {13185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {13185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:30,664 INFO L273 TraceCheckUtils]: 26: Hoare triple {13185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:30,665 INFO L273 TraceCheckUtils]: 27: Hoare triple {13186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:30,666 INFO L273 TraceCheckUtils]: 28: Hoare triple {13186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:30,667 INFO L273 TraceCheckUtils]: 29: Hoare triple {13187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:30,668 INFO L273 TraceCheckUtils]: 30: Hoare triple {13187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:30,669 INFO L273 TraceCheckUtils]: 31: Hoare triple {13188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:30,670 INFO L273 TraceCheckUtils]: 32: Hoare triple {13188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:30,670 INFO L273 TraceCheckUtils]: 33: Hoare triple {13189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:30,672 INFO L273 TraceCheckUtils]: 34: Hoare triple {13189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:30,672 INFO L273 TraceCheckUtils]: 35: Hoare triple {13190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {13190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:30,673 INFO L273 TraceCheckUtils]: 36: Hoare triple {13190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13191#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:07:30,674 INFO L273 TraceCheckUtils]: 37: Hoare triple {13191#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13191#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:07:30,675 INFO L273 TraceCheckUtils]: 38: Hoare triple {13191#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13192#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:07:30,676 INFO L273 TraceCheckUtils]: 39: Hoare triple {13192#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {13192#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:07:30,677 INFO L273 TraceCheckUtils]: 40: Hoare triple {13192#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13193#(and (<= main_~x~0 36) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:30,678 INFO L273 TraceCheckUtils]: 41: Hoare triple {13193#(and (<= main_~x~0 36) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {13174#false} is VALID [2018-11-23 13:07:30,678 INFO L256 TraceCheckUtils]: 42: Hoare triple {13174#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13174#false} is VALID [2018-11-23 13:07:30,679 INFO L273 TraceCheckUtils]: 43: Hoare triple {13174#false} ~cond := #in~cond; {13174#false} is VALID [2018-11-23 13:07:30,679 INFO L273 TraceCheckUtils]: 44: Hoare triple {13174#false} assume 0 == ~cond; {13174#false} is VALID [2018-11-23 13:07:30,679 INFO L273 TraceCheckUtils]: 45: Hoare triple {13174#false} assume !false; {13174#false} is VALID [2018-11-23 13:07:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:30,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:30,683 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:30,691 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:07:35,306 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 13:07:35,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:35,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:35,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {13173#true} call ULTIMATE.init(); {13173#true} is VALID [2018-11-23 13:07:35,496 INFO L273 TraceCheckUtils]: 1: Hoare triple {13173#true} assume true; {13173#true} is VALID [2018-11-23 13:07:35,496 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13173#true} {13173#true} #37#return; {13173#true} is VALID [2018-11-23 13:07:35,496 INFO L256 TraceCheckUtils]: 3: Hoare triple {13173#true} call #t~ret2 := main(); {13173#true} is VALID [2018-11-23 13:07:35,497 INFO L273 TraceCheckUtils]: 4: Hoare triple {13173#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {13175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:35,498 INFO L273 TraceCheckUtils]: 5: Hoare triple {13175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:35,499 INFO L273 TraceCheckUtils]: 6: Hoare triple {13175#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:35,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {13176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {13176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:35,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {13176#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:35,500 INFO L273 TraceCheckUtils]: 9: Hoare triple {13177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {13177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:35,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {13177#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:35,501 INFO L273 TraceCheckUtils]: 11: Hoare triple {13178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:35,502 INFO L273 TraceCheckUtils]: 12: Hoare triple {13178#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:35,503 INFO L273 TraceCheckUtils]: 13: Hoare triple {13179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {13179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:35,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {13179#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:35,505 INFO L273 TraceCheckUtils]: 15: Hoare triple {13180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:35,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {13180#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:35,507 INFO L273 TraceCheckUtils]: 17: Hoare triple {13181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:35,508 INFO L273 TraceCheckUtils]: 18: Hoare triple {13181#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:35,509 INFO L273 TraceCheckUtils]: 19: Hoare triple {13182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:35,510 INFO L273 TraceCheckUtils]: 20: Hoare triple {13182#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:35,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {13183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:35,512 INFO L273 TraceCheckUtils]: 22: Hoare triple {13183#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:35,512 INFO L273 TraceCheckUtils]: 23: Hoare triple {13184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:35,513 INFO L273 TraceCheckUtils]: 24: Hoare triple {13184#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:35,514 INFO L273 TraceCheckUtils]: 25: Hoare triple {13185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {13185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:35,515 INFO L273 TraceCheckUtils]: 26: Hoare triple {13185#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:35,516 INFO L273 TraceCheckUtils]: 27: Hoare triple {13186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:35,517 INFO L273 TraceCheckUtils]: 28: Hoare triple {13186#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:35,518 INFO L273 TraceCheckUtils]: 29: Hoare triple {13187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:35,519 INFO L273 TraceCheckUtils]: 30: Hoare triple {13187#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:35,519 INFO L273 TraceCheckUtils]: 31: Hoare triple {13188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:35,521 INFO L273 TraceCheckUtils]: 32: Hoare triple {13188#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:35,521 INFO L273 TraceCheckUtils]: 33: Hoare triple {13189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:35,522 INFO L273 TraceCheckUtils]: 34: Hoare triple {13189#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:35,523 INFO L273 TraceCheckUtils]: 35: Hoare triple {13190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {13190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:35,524 INFO L273 TraceCheckUtils]: 36: Hoare triple {13190#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13191#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:07:35,525 INFO L273 TraceCheckUtils]: 37: Hoare triple {13191#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13191#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:07:35,526 INFO L273 TraceCheckUtils]: 38: Hoare triple {13191#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13192#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:07:35,527 INFO L273 TraceCheckUtils]: 39: Hoare triple {13192#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {13192#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:07:35,528 INFO L273 TraceCheckUtils]: 40: Hoare triple {13192#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {13317#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:07:35,529 INFO L273 TraceCheckUtils]: 41: Hoare triple {13317#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {13174#false} is VALID [2018-11-23 13:07:35,529 INFO L256 TraceCheckUtils]: 42: Hoare triple {13174#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13174#false} is VALID [2018-11-23 13:07:35,529 INFO L273 TraceCheckUtils]: 43: Hoare triple {13174#false} ~cond := #in~cond; {13174#false} is VALID [2018-11-23 13:07:35,529 INFO L273 TraceCheckUtils]: 44: Hoare triple {13174#false} assume 0 == ~cond; {13174#false} is VALID [2018-11-23 13:07:35,530 INFO L273 TraceCheckUtils]: 45: Hoare triple {13174#false} assume !false; {13174#false} is VALID [2018-11-23 13:07:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:35,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:35,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 13:07:35,554 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-11-23 13:07:35,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:35,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:07:35,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:35,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:07:35,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:07:35,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:07:35,610 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 22 states. [2018-11-23 13:07:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:37,671 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-11-23 13:07:37,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:07:37,671 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-11-23 13:07:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:07:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 59 transitions. [2018-11-23 13:07:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:07:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 59 transitions. [2018-11-23 13:07:37,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 59 transitions. [2018-11-23 13:07:37,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:37,741 INFO L225 Difference]: With dead ends: 92 [2018-11-23 13:07:37,741 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 13:07:37,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:07:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 13:07:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-11-23 13:07:37,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:37,823 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 86 states. [2018-11-23 13:07:37,823 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 86 states. [2018-11-23 13:07:37,824 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 86 states. [2018-11-23 13:07:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:37,825 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-23 13:07:37,825 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-23 13:07:37,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:37,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:37,826 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 87 states. [2018-11-23 13:07:37,826 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 87 states. [2018-11-23 13:07:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:37,827 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-11-23 13:07:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-11-23 13:07:37,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:37,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:37,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:37,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 13:07:37,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-11-23 13:07:37,829 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 46 [2018-11-23 13:07:37,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:37,829 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-11-23 13:07:37,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:07:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-11-23 13:07:37,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:07:37,830 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:37,830 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:37,831 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:37,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:37,831 INFO L82 PathProgramCache]: Analyzing trace with hash -23301761, now seen corresponding path program 19 times [2018-11-23 13:07:37,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:37,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:37,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:37,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:37,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:38,256 INFO L256 TraceCheckUtils]: 0: Hoare triple {13776#true} call ULTIMATE.init(); {13776#true} is VALID [2018-11-23 13:07:38,256 INFO L273 TraceCheckUtils]: 1: Hoare triple {13776#true} assume true; {13776#true} is VALID [2018-11-23 13:07:38,257 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13776#true} {13776#true} #37#return; {13776#true} is VALID [2018-11-23 13:07:38,257 INFO L256 TraceCheckUtils]: 3: Hoare triple {13776#true} call #t~ret2 := main(); {13776#true} is VALID [2018-11-23 13:07:38,257 INFO L273 TraceCheckUtils]: 4: Hoare triple {13776#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {13778#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:38,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {13778#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13778#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:38,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {13778#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13779#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:38,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {13779#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13779#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:38,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {13779#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13780#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:38,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {13780#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {13780#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:38,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {13780#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13781#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:38,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {13781#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13781#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:38,265 INFO L273 TraceCheckUtils]: 12: Hoare triple {13781#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13782#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:38,266 INFO L273 TraceCheckUtils]: 13: Hoare triple {13782#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {13782#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:38,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {13782#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13783#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:38,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {13783#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {13783#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:38,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {13783#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13784#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:38,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {13784#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13784#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:38,270 INFO L273 TraceCheckUtils]: 18: Hoare triple {13784#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13785#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:38,271 INFO L273 TraceCheckUtils]: 19: Hoare triple {13785#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13785#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:38,272 INFO L273 TraceCheckUtils]: 20: Hoare triple {13785#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13786#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:38,273 INFO L273 TraceCheckUtils]: 21: Hoare triple {13786#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {13786#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:38,274 INFO L273 TraceCheckUtils]: 22: Hoare triple {13786#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13787#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:38,275 INFO L273 TraceCheckUtils]: 23: Hoare triple {13787#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {13787#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:38,276 INFO L273 TraceCheckUtils]: 24: Hoare triple {13787#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13788#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:38,276 INFO L273 TraceCheckUtils]: 25: Hoare triple {13788#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13788#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:38,278 INFO L273 TraceCheckUtils]: 26: Hoare triple {13788#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13789#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:38,278 INFO L273 TraceCheckUtils]: 27: Hoare triple {13789#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {13789#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:38,279 INFO L273 TraceCheckUtils]: 28: Hoare triple {13789#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13790#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:38,280 INFO L273 TraceCheckUtils]: 29: Hoare triple {13790#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13790#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:38,281 INFO L273 TraceCheckUtils]: 30: Hoare triple {13790#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13791#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:38,282 INFO L273 TraceCheckUtils]: 31: Hoare triple {13791#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13791#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:38,283 INFO L273 TraceCheckUtils]: 32: Hoare triple {13791#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13792#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:38,284 INFO L273 TraceCheckUtils]: 33: Hoare triple {13792#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13792#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:38,285 INFO L273 TraceCheckUtils]: 34: Hoare triple {13792#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13793#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:38,285 INFO L273 TraceCheckUtils]: 35: Hoare triple {13793#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {13793#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:38,287 INFO L273 TraceCheckUtils]: 36: Hoare triple {13793#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13794#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:38,287 INFO L273 TraceCheckUtils]: 37: Hoare triple {13794#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13794#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:38,288 INFO L273 TraceCheckUtils]: 38: Hoare triple {13794#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13795#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:38,289 INFO L273 TraceCheckUtils]: 39: Hoare triple {13795#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13795#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:38,290 INFO L273 TraceCheckUtils]: 40: Hoare triple {13795#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13796#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:38,291 INFO L273 TraceCheckUtils]: 41: Hoare triple {13796#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13796#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:38,292 INFO L273 TraceCheckUtils]: 42: Hoare triple {13796#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13797#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 19))} is VALID [2018-11-23 13:07:38,293 INFO L273 TraceCheckUtils]: 43: Hoare triple {13797#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 19))} assume !(~x~0 % 4294967296 < 99); {13777#false} is VALID [2018-11-23 13:07:38,293 INFO L256 TraceCheckUtils]: 44: Hoare triple {13777#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13777#false} is VALID [2018-11-23 13:07:38,293 INFO L273 TraceCheckUtils]: 45: Hoare triple {13777#false} ~cond := #in~cond; {13777#false} is VALID [2018-11-23 13:07:38,294 INFO L273 TraceCheckUtils]: 46: Hoare triple {13777#false} assume 0 == ~cond; {13777#false} is VALID [2018-11-23 13:07:38,294 INFO L273 TraceCheckUtils]: 47: Hoare triple {13777#false} assume !false; {13777#false} is VALID [2018-11-23 13:07:38,297 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:38,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:38,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:38,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:38,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:38,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {13776#true} call ULTIMATE.init(); {13776#true} is VALID [2018-11-23 13:07:38,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {13776#true} assume true; {13776#true} is VALID [2018-11-23 13:07:38,507 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {13776#true} {13776#true} #37#return; {13776#true} is VALID [2018-11-23 13:07:38,507 INFO L256 TraceCheckUtils]: 3: Hoare triple {13776#true} call #t~ret2 := main(); {13776#true} is VALID [2018-11-23 13:07:38,508 INFO L273 TraceCheckUtils]: 4: Hoare triple {13776#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {13778#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:38,508 INFO L273 TraceCheckUtils]: 5: Hoare triple {13778#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13778#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:38,509 INFO L273 TraceCheckUtils]: 6: Hoare triple {13778#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13779#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:38,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {13779#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13779#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:38,510 INFO L273 TraceCheckUtils]: 8: Hoare triple {13779#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13780#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:38,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {13780#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {13780#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:38,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {13780#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13781#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:38,512 INFO L273 TraceCheckUtils]: 11: Hoare triple {13781#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13781#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:38,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {13781#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13782#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:38,514 INFO L273 TraceCheckUtils]: 13: Hoare triple {13782#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {13782#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:38,515 INFO L273 TraceCheckUtils]: 14: Hoare triple {13782#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13783#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:38,516 INFO L273 TraceCheckUtils]: 15: Hoare triple {13783#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {13783#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:38,517 INFO L273 TraceCheckUtils]: 16: Hoare triple {13783#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13784#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:38,518 INFO L273 TraceCheckUtils]: 17: Hoare triple {13784#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13784#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:38,519 INFO L273 TraceCheckUtils]: 18: Hoare triple {13784#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13785#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:38,520 INFO L273 TraceCheckUtils]: 19: Hoare triple {13785#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13785#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:38,521 INFO L273 TraceCheckUtils]: 20: Hoare triple {13785#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13786#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:38,521 INFO L273 TraceCheckUtils]: 21: Hoare triple {13786#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {13786#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:38,523 INFO L273 TraceCheckUtils]: 22: Hoare triple {13786#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13787#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:38,523 INFO L273 TraceCheckUtils]: 23: Hoare triple {13787#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {13787#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:38,524 INFO L273 TraceCheckUtils]: 24: Hoare triple {13787#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13788#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:38,525 INFO L273 TraceCheckUtils]: 25: Hoare triple {13788#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13788#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:38,526 INFO L273 TraceCheckUtils]: 26: Hoare triple {13788#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13789#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:38,527 INFO L273 TraceCheckUtils]: 27: Hoare triple {13789#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {13789#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:38,528 INFO L273 TraceCheckUtils]: 28: Hoare triple {13789#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13790#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:38,529 INFO L273 TraceCheckUtils]: 29: Hoare triple {13790#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13790#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:38,530 INFO L273 TraceCheckUtils]: 30: Hoare triple {13790#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13791#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:38,531 INFO L273 TraceCheckUtils]: 31: Hoare triple {13791#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13791#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:38,532 INFO L273 TraceCheckUtils]: 32: Hoare triple {13791#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13792#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:38,532 INFO L273 TraceCheckUtils]: 33: Hoare triple {13792#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13792#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:38,533 INFO L273 TraceCheckUtils]: 34: Hoare triple {13792#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13793#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:38,534 INFO L273 TraceCheckUtils]: 35: Hoare triple {13793#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {13793#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:38,535 INFO L273 TraceCheckUtils]: 36: Hoare triple {13793#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13794#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:38,536 INFO L273 TraceCheckUtils]: 37: Hoare triple {13794#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13794#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:38,537 INFO L273 TraceCheckUtils]: 38: Hoare triple {13794#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13795#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:38,538 INFO L273 TraceCheckUtils]: 39: Hoare triple {13795#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13795#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:38,539 INFO L273 TraceCheckUtils]: 40: Hoare triple {13795#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13796#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:38,540 INFO L273 TraceCheckUtils]: 41: Hoare triple {13796#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {13796#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:38,541 INFO L273 TraceCheckUtils]: 42: Hoare triple {13796#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {13927#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:07:38,542 INFO L273 TraceCheckUtils]: 43: Hoare triple {13927#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {13777#false} is VALID [2018-11-23 13:07:38,542 INFO L256 TraceCheckUtils]: 44: Hoare triple {13777#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {13777#false} is VALID [2018-11-23 13:07:38,542 INFO L273 TraceCheckUtils]: 45: Hoare triple {13777#false} ~cond := #in~cond; {13777#false} is VALID [2018-11-23 13:07:38,542 INFO L273 TraceCheckUtils]: 46: Hoare triple {13777#false} assume 0 == ~cond; {13777#false} is VALID [2018-11-23 13:07:38,542 INFO L273 TraceCheckUtils]: 47: Hoare triple {13777#false} assume !false; {13777#false} is VALID [2018-11-23 13:07:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:38,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:38,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 13:07:38,564 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-11-23 13:07:38,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:38,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:07:38,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:38,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:07:38,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:07:38,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:07:38,624 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 23 states. [2018-11-23 13:07:41,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:41,355 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2018-11-23 13:07:41,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:07:41,356 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-11-23 13:07:41,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:07:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 68 transitions. [2018-11-23 13:07:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:07:41,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 68 transitions. [2018-11-23 13:07:41,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 68 transitions. [2018-11-23 13:07:41,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:41,492 INFO L225 Difference]: With dead ends: 94 [2018-11-23 13:07:41,492 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 13:07:41,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:07:41,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 13:07:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-11-23 13:07:41,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:41,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 88 states. [2018-11-23 13:07:41,591 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 88 states. [2018-11-23 13:07:41,591 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 88 states. [2018-11-23 13:07:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:41,593 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-11-23 13:07:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-11-23 13:07:41,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:41,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:41,594 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 89 states. [2018-11-23 13:07:41,594 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 89 states. [2018-11-23 13:07:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:41,596 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-11-23 13:07:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-11-23 13:07:41,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:41,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:41,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:41,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 13:07:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-11-23 13:07:41,597 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 48 [2018-11-23 13:07:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:41,597 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-11-23 13:07:41,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:07:41,598 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-11-23 13:07:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 13:07:41,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:41,598 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:41,598 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:41,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:41,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2020866407, now seen corresponding path program 19 times [2018-11-23 13:07:41,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:41,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:41,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:41,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:41,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:42,083 INFO L256 TraceCheckUtils]: 0: Hoare triple {14396#true} call ULTIMATE.init(); {14396#true} is VALID [2018-11-23 13:07:42,083 INFO L273 TraceCheckUtils]: 1: Hoare triple {14396#true} assume true; {14396#true} is VALID [2018-11-23 13:07:42,083 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14396#true} {14396#true} #37#return; {14396#true} is VALID [2018-11-23 13:07:42,084 INFO L256 TraceCheckUtils]: 3: Hoare triple {14396#true} call #t~ret2 := main(); {14396#true} is VALID [2018-11-23 13:07:42,084 INFO L273 TraceCheckUtils]: 4: Hoare triple {14396#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {14398#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:42,088 INFO L273 TraceCheckUtils]: 5: Hoare triple {14398#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14398#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:42,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {14398#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14399#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:42,090 INFO L273 TraceCheckUtils]: 7: Hoare triple {14399#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {14399#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:42,091 INFO L273 TraceCheckUtils]: 8: Hoare triple {14399#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14400#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:42,092 INFO L273 TraceCheckUtils]: 9: Hoare triple {14400#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {14400#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:42,092 INFO L273 TraceCheckUtils]: 10: Hoare triple {14400#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:42,093 INFO L273 TraceCheckUtils]: 11: Hoare triple {14401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:42,093 INFO L273 TraceCheckUtils]: 12: Hoare triple {14401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14402#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:42,094 INFO L273 TraceCheckUtils]: 13: Hoare triple {14402#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {14402#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:42,095 INFO L273 TraceCheckUtils]: 14: Hoare triple {14402#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14403#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:42,096 INFO L273 TraceCheckUtils]: 15: Hoare triple {14403#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14403#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:42,097 INFO L273 TraceCheckUtils]: 16: Hoare triple {14403#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14404#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:42,098 INFO L273 TraceCheckUtils]: 17: Hoare triple {14404#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14404#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:42,099 INFO L273 TraceCheckUtils]: 18: Hoare triple {14404#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14405#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:42,099 INFO L273 TraceCheckUtils]: 19: Hoare triple {14405#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14405#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:42,101 INFO L273 TraceCheckUtils]: 20: Hoare triple {14405#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14406#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:42,101 INFO L273 TraceCheckUtils]: 21: Hoare triple {14406#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14406#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:42,102 INFO L273 TraceCheckUtils]: 22: Hoare triple {14406#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14407#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:42,103 INFO L273 TraceCheckUtils]: 23: Hoare triple {14407#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14407#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:42,104 INFO L273 TraceCheckUtils]: 24: Hoare triple {14407#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14408#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:42,124 INFO L273 TraceCheckUtils]: 25: Hoare triple {14408#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {14408#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:42,137 INFO L273 TraceCheckUtils]: 26: Hoare triple {14408#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14409#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:42,150 INFO L273 TraceCheckUtils]: 27: Hoare triple {14409#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14409#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:42,151 INFO L273 TraceCheckUtils]: 28: Hoare triple {14409#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14410#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:42,151 INFO L273 TraceCheckUtils]: 29: Hoare triple {14410#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14410#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:42,152 INFO L273 TraceCheckUtils]: 30: Hoare triple {14410#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14411#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:42,152 INFO L273 TraceCheckUtils]: 31: Hoare triple {14411#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14411#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:42,153 INFO L273 TraceCheckUtils]: 32: Hoare triple {14411#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14412#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:42,153 INFO L273 TraceCheckUtils]: 33: Hoare triple {14412#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14412#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:42,154 INFO L273 TraceCheckUtils]: 34: Hoare triple {14412#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14413#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:42,154 INFO L273 TraceCheckUtils]: 35: Hoare triple {14413#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {14413#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:42,155 INFO L273 TraceCheckUtils]: 36: Hoare triple {14413#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14414#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:07:42,156 INFO L273 TraceCheckUtils]: 37: Hoare triple {14414#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14414#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:07:42,157 INFO L273 TraceCheckUtils]: 38: Hoare triple {14414#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14415#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:07:42,158 INFO L273 TraceCheckUtils]: 39: Hoare triple {14415#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {14415#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:07:42,159 INFO L273 TraceCheckUtils]: 40: Hoare triple {14415#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14416#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:07:42,160 INFO L273 TraceCheckUtils]: 41: Hoare triple {14416#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14416#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:07:42,161 INFO L273 TraceCheckUtils]: 42: Hoare triple {14416#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14417#(and (<= main_~x~0 38) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:42,162 INFO L273 TraceCheckUtils]: 43: Hoare triple {14417#(and (<= main_~x~0 38) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {14397#false} is VALID [2018-11-23 13:07:42,162 INFO L256 TraceCheckUtils]: 44: Hoare triple {14397#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14397#false} is VALID [2018-11-23 13:07:42,162 INFO L273 TraceCheckUtils]: 45: Hoare triple {14397#false} ~cond := #in~cond; {14397#false} is VALID [2018-11-23 13:07:42,162 INFO L273 TraceCheckUtils]: 46: Hoare triple {14397#false} assume 0 == ~cond; {14397#false} is VALID [2018-11-23 13:07:42,163 INFO L273 TraceCheckUtils]: 47: Hoare triple {14397#false} assume !false; {14397#false} is VALID [2018-11-23 13:07:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:42,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:42,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:42,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:42,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:42,376 INFO L256 TraceCheckUtils]: 0: Hoare triple {14396#true} call ULTIMATE.init(); {14396#true} is VALID [2018-11-23 13:07:42,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {14396#true} assume true; {14396#true} is VALID [2018-11-23 13:07:42,377 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {14396#true} {14396#true} #37#return; {14396#true} is VALID [2018-11-23 13:07:42,377 INFO L256 TraceCheckUtils]: 3: Hoare triple {14396#true} call #t~ret2 := main(); {14396#true} is VALID [2018-11-23 13:07:42,377 INFO L273 TraceCheckUtils]: 4: Hoare triple {14396#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {14398#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:42,378 INFO L273 TraceCheckUtils]: 5: Hoare triple {14398#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14398#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:42,379 INFO L273 TraceCheckUtils]: 6: Hoare triple {14398#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14399#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:42,379 INFO L273 TraceCheckUtils]: 7: Hoare triple {14399#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {14399#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:42,380 INFO L273 TraceCheckUtils]: 8: Hoare triple {14399#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14400#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:42,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {14400#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {14400#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:42,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {14400#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:42,381 INFO L273 TraceCheckUtils]: 11: Hoare triple {14401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:42,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {14401#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14402#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:42,383 INFO L273 TraceCheckUtils]: 13: Hoare triple {14402#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {14402#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:42,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {14402#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14403#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:42,385 INFO L273 TraceCheckUtils]: 15: Hoare triple {14403#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14403#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:42,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {14403#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14404#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:42,387 INFO L273 TraceCheckUtils]: 17: Hoare triple {14404#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14404#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:42,388 INFO L273 TraceCheckUtils]: 18: Hoare triple {14404#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14405#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:42,389 INFO L273 TraceCheckUtils]: 19: Hoare triple {14405#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14405#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:42,390 INFO L273 TraceCheckUtils]: 20: Hoare triple {14405#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14406#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:42,390 INFO L273 TraceCheckUtils]: 21: Hoare triple {14406#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14406#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:42,392 INFO L273 TraceCheckUtils]: 22: Hoare triple {14406#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14407#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:42,392 INFO L273 TraceCheckUtils]: 23: Hoare triple {14407#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14407#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:42,393 INFO L273 TraceCheckUtils]: 24: Hoare triple {14407#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14408#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:42,394 INFO L273 TraceCheckUtils]: 25: Hoare triple {14408#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {14408#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:42,395 INFO L273 TraceCheckUtils]: 26: Hoare triple {14408#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14409#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:42,396 INFO L273 TraceCheckUtils]: 27: Hoare triple {14409#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14409#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:42,397 INFO L273 TraceCheckUtils]: 28: Hoare triple {14409#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14410#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:42,398 INFO L273 TraceCheckUtils]: 29: Hoare triple {14410#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14410#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:42,399 INFO L273 TraceCheckUtils]: 30: Hoare triple {14410#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14411#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:42,399 INFO L273 TraceCheckUtils]: 31: Hoare triple {14411#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14411#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:42,401 INFO L273 TraceCheckUtils]: 32: Hoare triple {14411#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14412#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:42,401 INFO L273 TraceCheckUtils]: 33: Hoare triple {14412#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14412#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:42,402 INFO L273 TraceCheckUtils]: 34: Hoare triple {14412#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14413#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:42,403 INFO L273 TraceCheckUtils]: 35: Hoare triple {14413#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {14413#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:42,404 INFO L273 TraceCheckUtils]: 36: Hoare triple {14413#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14414#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:07:42,405 INFO L273 TraceCheckUtils]: 37: Hoare triple {14414#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14414#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:07:42,406 INFO L273 TraceCheckUtils]: 38: Hoare triple {14414#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14415#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:07:42,407 INFO L273 TraceCheckUtils]: 39: Hoare triple {14415#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {14415#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:07:42,408 INFO L273 TraceCheckUtils]: 40: Hoare triple {14415#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14416#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:07:42,409 INFO L273 TraceCheckUtils]: 41: Hoare triple {14416#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {14416#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:07:42,415 INFO L273 TraceCheckUtils]: 42: Hoare triple {14416#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {14547#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:07:42,415 INFO L273 TraceCheckUtils]: 43: Hoare triple {14547#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {14397#false} is VALID [2018-11-23 13:07:42,415 INFO L256 TraceCheckUtils]: 44: Hoare triple {14397#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {14397#false} is VALID [2018-11-23 13:07:42,416 INFO L273 TraceCheckUtils]: 45: Hoare triple {14397#false} ~cond := #in~cond; {14397#false} is VALID [2018-11-23 13:07:42,416 INFO L273 TraceCheckUtils]: 46: Hoare triple {14397#false} assume 0 == ~cond; {14397#false} is VALID [2018-11-23 13:07:42,416 INFO L273 TraceCheckUtils]: 47: Hoare triple {14397#false} assume !false; {14397#false} is VALID [2018-11-23 13:07:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:42,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:42,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 13:07:42,438 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-11-23 13:07:42,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:42,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:07:42,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:42,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:07:42,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:07:42,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:07:42,496 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 23 states. [2018-11-23 13:07:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:44,919 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-11-23 13:07:44,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:07:44,919 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-11-23 13:07:44,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:07:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 61 transitions. [2018-11-23 13:07:44,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:07:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 61 transitions. [2018-11-23 13:07:44,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 61 transitions. [2018-11-23 13:07:44,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:44,997 INFO L225 Difference]: With dead ends: 96 [2018-11-23 13:07:44,997 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 13:07:44,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:07:44,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 13:07:45,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-11-23 13:07:45,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:45,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 90 states. [2018-11-23 13:07:45,083 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 90 states. [2018-11-23 13:07:45,083 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 90 states. [2018-11-23 13:07:45,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:45,085 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-11-23 13:07:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-11-23 13:07:45,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:45,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:45,086 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 91 states. [2018-11-23 13:07:45,086 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 91 states. [2018-11-23 13:07:45,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:45,087 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-11-23 13:07:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-11-23 13:07:45,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:45,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:45,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:45,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 13:07:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-11-23 13:07:45,090 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 48 [2018-11-23 13:07:45,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:45,090 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-11-23 13:07:45,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:07:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-11-23 13:07:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 13:07:45,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:45,091 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:45,091 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:45,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:45,091 INFO L82 PathProgramCache]: Analyzing trace with hash 157176188, now seen corresponding path program 20 times [2018-11-23 13:07:45,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:45,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:45,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:45,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:45,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:45,680 INFO L256 TraceCheckUtils]: 0: Hoare triple {15026#true} call ULTIMATE.init(); {15026#true} is VALID [2018-11-23 13:07:45,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {15026#true} assume true; {15026#true} is VALID [2018-11-23 13:07:45,681 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15026#true} {15026#true} #37#return; {15026#true} is VALID [2018-11-23 13:07:45,681 INFO L256 TraceCheckUtils]: 3: Hoare triple {15026#true} call #t~ret2 := main(); {15026#true} is VALID [2018-11-23 13:07:45,682 INFO L273 TraceCheckUtils]: 4: Hoare triple {15026#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {15028#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:45,682 INFO L273 TraceCheckUtils]: 5: Hoare triple {15028#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15028#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:45,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {15028#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15029#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:45,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {15029#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15029#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:45,685 INFO L273 TraceCheckUtils]: 8: Hoare triple {15029#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15030#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:45,686 INFO L273 TraceCheckUtils]: 9: Hoare triple {15030#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {15030#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:45,687 INFO L273 TraceCheckUtils]: 10: Hoare triple {15030#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15031#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:45,688 INFO L273 TraceCheckUtils]: 11: Hoare triple {15031#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15031#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:45,689 INFO L273 TraceCheckUtils]: 12: Hoare triple {15031#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15032#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:45,690 INFO L273 TraceCheckUtils]: 13: Hoare triple {15032#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {15032#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:45,691 INFO L273 TraceCheckUtils]: 14: Hoare triple {15032#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15033#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:45,691 INFO L273 TraceCheckUtils]: 15: Hoare triple {15033#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {15033#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:45,692 INFO L273 TraceCheckUtils]: 16: Hoare triple {15033#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15034#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:45,693 INFO L273 TraceCheckUtils]: 17: Hoare triple {15034#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15034#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:45,694 INFO L273 TraceCheckUtils]: 18: Hoare triple {15034#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15035#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:45,695 INFO L273 TraceCheckUtils]: 19: Hoare triple {15035#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15035#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:45,696 INFO L273 TraceCheckUtils]: 20: Hoare triple {15035#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15036#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:45,697 INFO L273 TraceCheckUtils]: 21: Hoare triple {15036#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {15036#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:45,698 INFO L273 TraceCheckUtils]: 22: Hoare triple {15036#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15037#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:45,699 INFO L273 TraceCheckUtils]: 23: Hoare triple {15037#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {15037#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:45,700 INFO L273 TraceCheckUtils]: 24: Hoare triple {15037#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15038#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:45,700 INFO L273 TraceCheckUtils]: 25: Hoare triple {15038#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15038#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:45,701 INFO L273 TraceCheckUtils]: 26: Hoare triple {15038#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15039#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:45,702 INFO L273 TraceCheckUtils]: 27: Hoare triple {15039#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {15039#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:45,703 INFO L273 TraceCheckUtils]: 28: Hoare triple {15039#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15040#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:45,704 INFO L273 TraceCheckUtils]: 29: Hoare triple {15040#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15040#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:45,705 INFO L273 TraceCheckUtils]: 30: Hoare triple {15040#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15041#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:45,706 INFO L273 TraceCheckUtils]: 31: Hoare triple {15041#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15041#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:45,707 INFO L273 TraceCheckUtils]: 32: Hoare triple {15041#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15042#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:45,708 INFO L273 TraceCheckUtils]: 33: Hoare triple {15042#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15042#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:45,709 INFO L273 TraceCheckUtils]: 34: Hoare triple {15042#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15043#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:45,709 INFO L273 TraceCheckUtils]: 35: Hoare triple {15043#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {15043#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:45,710 INFO L273 TraceCheckUtils]: 36: Hoare triple {15043#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15044#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:45,711 INFO L273 TraceCheckUtils]: 37: Hoare triple {15044#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15044#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:45,712 INFO L273 TraceCheckUtils]: 38: Hoare triple {15044#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15045#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:45,713 INFO L273 TraceCheckUtils]: 39: Hoare triple {15045#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15045#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:45,714 INFO L273 TraceCheckUtils]: 40: Hoare triple {15045#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15046#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:45,715 INFO L273 TraceCheckUtils]: 41: Hoare triple {15046#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15046#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:45,716 INFO L273 TraceCheckUtils]: 42: Hoare triple {15046#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15047#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:07:45,717 INFO L273 TraceCheckUtils]: 43: Hoare triple {15047#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15047#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:07:45,718 INFO L273 TraceCheckUtils]: 44: Hoare triple {15047#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15048#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:45,719 INFO L273 TraceCheckUtils]: 45: Hoare triple {15048#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 99); {15027#false} is VALID [2018-11-23 13:07:45,719 INFO L256 TraceCheckUtils]: 46: Hoare triple {15027#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15027#false} is VALID [2018-11-23 13:07:45,719 INFO L273 TraceCheckUtils]: 47: Hoare triple {15027#false} ~cond := #in~cond; {15027#false} is VALID [2018-11-23 13:07:45,719 INFO L273 TraceCheckUtils]: 48: Hoare triple {15027#false} assume 0 == ~cond; {15027#false} is VALID [2018-11-23 13:07:45,720 INFO L273 TraceCheckUtils]: 49: Hoare triple {15027#false} assume !false; {15027#false} is VALID [2018-11-23 13:07:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:45,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:45,725 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:45,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:07:45,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:07:45,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:45,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:45,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {15026#true} call ULTIMATE.init(); {15026#true} is VALID [2018-11-23 13:07:45,954 INFO L273 TraceCheckUtils]: 1: Hoare triple {15026#true} assume true; {15026#true} is VALID [2018-11-23 13:07:45,954 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15026#true} {15026#true} #37#return; {15026#true} is VALID [2018-11-23 13:07:45,954 INFO L256 TraceCheckUtils]: 3: Hoare triple {15026#true} call #t~ret2 := main(); {15026#true} is VALID [2018-11-23 13:07:45,955 INFO L273 TraceCheckUtils]: 4: Hoare triple {15026#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {15028#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:45,955 INFO L273 TraceCheckUtils]: 5: Hoare triple {15028#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15028#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:45,956 INFO L273 TraceCheckUtils]: 6: Hoare triple {15028#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15029#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:45,956 INFO L273 TraceCheckUtils]: 7: Hoare triple {15029#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15029#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:45,957 INFO L273 TraceCheckUtils]: 8: Hoare triple {15029#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15030#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:45,957 INFO L273 TraceCheckUtils]: 9: Hoare triple {15030#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {15030#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:45,958 INFO L273 TraceCheckUtils]: 10: Hoare triple {15030#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15031#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:45,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {15031#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15031#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:45,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {15031#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15032#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:45,961 INFO L273 TraceCheckUtils]: 13: Hoare triple {15032#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {15032#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:45,962 INFO L273 TraceCheckUtils]: 14: Hoare triple {15032#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15033#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:45,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {15033#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {15033#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:45,964 INFO L273 TraceCheckUtils]: 16: Hoare triple {15033#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15034#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:45,964 INFO L273 TraceCheckUtils]: 17: Hoare triple {15034#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15034#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:45,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {15034#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15035#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:45,966 INFO L273 TraceCheckUtils]: 19: Hoare triple {15035#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15035#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:45,967 INFO L273 TraceCheckUtils]: 20: Hoare triple {15035#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15036#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:45,968 INFO L273 TraceCheckUtils]: 21: Hoare triple {15036#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {15036#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:45,969 INFO L273 TraceCheckUtils]: 22: Hoare triple {15036#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15037#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:45,970 INFO L273 TraceCheckUtils]: 23: Hoare triple {15037#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {15037#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:45,971 INFO L273 TraceCheckUtils]: 24: Hoare triple {15037#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15038#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:45,972 INFO L273 TraceCheckUtils]: 25: Hoare triple {15038#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15038#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:45,973 INFO L273 TraceCheckUtils]: 26: Hoare triple {15038#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15039#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:45,973 INFO L273 TraceCheckUtils]: 27: Hoare triple {15039#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {15039#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:45,974 INFO L273 TraceCheckUtils]: 28: Hoare triple {15039#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15040#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:45,975 INFO L273 TraceCheckUtils]: 29: Hoare triple {15040#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15040#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:45,976 INFO L273 TraceCheckUtils]: 30: Hoare triple {15040#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15041#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:45,977 INFO L273 TraceCheckUtils]: 31: Hoare triple {15041#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15041#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:45,978 INFO L273 TraceCheckUtils]: 32: Hoare triple {15041#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15042#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:45,979 INFO L273 TraceCheckUtils]: 33: Hoare triple {15042#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15042#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:45,980 INFO L273 TraceCheckUtils]: 34: Hoare triple {15042#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15043#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:45,981 INFO L273 TraceCheckUtils]: 35: Hoare triple {15043#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {15043#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:45,985 INFO L273 TraceCheckUtils]: 36: Hoare triple {15043#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15044#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:45,985 INFO L273 TraceCheckUtils]: 37: Hoare triple {15044#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15044#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:45,986 INFO L273 TraceCheckUtils]: 38: Hoare triple {15044#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15045#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:45,986 INFO L273 TraceCheckUtils]: 39: Hoare triple {15045#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15045#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:45,987 INFO L273 TraceCheckUtils]: 40: Hoare triple {15045#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15046#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:45,988 INFO L273 TraceCheckUtils]: 41: Hoare triple {15046#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15046#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:45,989 INFO L273 TraceCheckUtils]: 42: Hoare triple {15046#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15047#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:07:45,989 INFO L273 TraceCheckUtils]: 43: Hoare triple {15047#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15047#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:07:45,991 INFO L273 TraceCheckUtils]: 44: Hoare triple {15047#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {15184#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:45,991 INFO L273 TraceCheckUtils]: 45: Hoare triple {15184#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 99); {15027#false} is VALID [2018-11-23 13:07:45,992 INFO L256 TraceCheckUtils]: 46: Hoare triple {15027#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15027#false} is VALID [2018-11-23 13:07:45,992 INFO L273 TraceCheckUtils]: 47: Hoare triple {15027#false} ~cond := #in~cond; {15027#false} is VALID [2018-11-23 13:07:45,992 INFO L273 TraceCheckUtils]: 48: Hoare triple {15027#false} assume 0 == ~cond; {15027#false} is VALID [2018-11-23 13:07:45,992 INFO L273 TraceCheckUtils]: 49: Hoare triple {15027#false} assume !false; {15027#false} is VALID [2018-11-23 13:07:45,997 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:46,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:46,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 13:07:46,015 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-11-23 13:07:46,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:46,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 13:07:46,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:46,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 13:07:46,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 13:07:46,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:07:46,102 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 24 states. [2018-11-23 13:07:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:49,049 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-11-23 13:07:49,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:07:49,049 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-11-23 13:07:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:07:49,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 71 transitions. [2018-11-23 13:07:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:07:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 71 transitions. [2018-11-23 13:07:49,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 71 transitions. [2018-11-23 13:07:49,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:49,137 INFO L225 Difference]: With dead ends: 98 [2018-11-23 13:07:49,138 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 13:07:49,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:07:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 13:07:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-23 13:07:49,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:49,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 92 states. [2018-11-23 13:07:49,237 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 92 states. [2018-11-23 13:07:49,238 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 92 states. [2018-11-23 13:07:49,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:49,240 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-11-23 13:07:49,240 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-11-23 13:07:49,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:49,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:49,241 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 93 states. [2018-11-23 13:07:49,241 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 93 states. [2018-11-23 13:07:49,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:49,242 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-11-23 13:07:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-11-23 13:07:49,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:49,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:49,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:49,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 13:07:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-11-23 13:07:49,244 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 50 [2018-11-23 13:07:49,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:49,244 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-11-23 13:07:49,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 13:07:49,245 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-11-23 13:07:49,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 13:07:49,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:49,245 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:49,245 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:49,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:49,246 INFO L82 PathProgramCache]: Analyzing trace with hash 405190996, now seen corresponding path program 20 times [2018-11-23 13:07:49,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:49,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:49,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:49,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:49,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:50,139 INFO L256 TraceCheckUtils]: 0: Hoare triple {15673#true} call ULTIMATE.init(); {15673#true} is VALID [2018-11-23 13:07:50,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {15673#true} assume true; {15673#true} is VALID [2018-11-23 13:07:50,139 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15673#true} {15673#true} #37#return; {15673#true} is VALID [2018-11-23 13:07:50,139 INFO L256 TraceCheckUtils]: 3: Hoare triple {15673#true} call #t~ret2 := main(); {15673#true} is VALID [2018-11-23 13:07:50,140 INFO L273 TraceCheckUtils]: 4: Hoare triple {15673#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {15675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:50,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {15675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:50,141 INFO L273 TraceCheckUtils]: 6: Hoare triple {15675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15676#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:50,141 INFO L273 TraceCheckUtils]: 7: Hoare triple {15676#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {15676#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:50,142 INFO L273 TraceCheckUtils]: 8: Hoare triple {15676#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15677#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:50,143 INFO L273 TraceCheckUtils]: 9: Hoare triple {15677#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {15677#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:50,144 INFO L273 TraceCheckUtils]: 10: Hoare triple {15677#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15678#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:50,145 INFO L273 TraceCheckUtils]: 11: Hoare triple {15678#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15678#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:50,146 INFO L273 TraceCheckUtils]: 12: Hoare triple {15678#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15679#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:50,146 INFO L273 TraceCheckUtils]: 13: Hoare triple {15679#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {15679#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:50,147 INFO L273 TraceCheckUtils]: 14: Hoare triple {15679#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15680#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:50,148 INFO L273 TraceCheckUtils]: 15: Hoare triple {15680#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15680#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:50,158 INFO L273 TraceCheckUtils]: 16: Hoare triple {15680#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15681#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:50,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {15681#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15681#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:50,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {15681#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15682#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:50,160 INFO L273 TraceCheckUtils]: 19: Hoare triple {15682#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15682#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:50,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {15682#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15683#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:50,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {15683#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15683#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:50,161 INFO L273 TraceCheckUtils]: 22: Hoare triple {15683#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15684#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:50,162 INFO L273 TraceCheckUtils]: 23: Hoare triple {15684#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15684#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:50,163 INFO L273 TraceCheckUtils]: 24: Hoare triple {15684#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15685#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:50,164 INFO L273 TraceCheckUtils]: 25: Hoare triple {15685#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {15685#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:50,165 INFO L273 TraceCheckUtils]: 26: Hoare triple {15685#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15686#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:50,166 INFO L273 TraceCheckUtils]: 27: Hoare triple {15686#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15686#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:50,167 INFO L273 TraceCheckUtils]: 28: Hoare triple {15686#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15687#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:50,167 INFO L273 TraceCheckUtils]: 29: Hoare triple {15687#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15687#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:50,168 INFO L273 TraceCheckUtils]: 30: Hoare triple {15687#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15688#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:50,169 INFO L273 TraceCheckUtils]: 31: Hoare triple {15688#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15688#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:50,170 INFO L273 TraceCheckUtils]: 32: Hoare triple {15688#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15689#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:50,171 INFO L273 TraceCheckUtils]: 33: Hoare triple {15689#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15689#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:50,172 INFO L273 TraceCheckUtils]: 34: Hoare triple {15689#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15690#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:50,173 INFO L273 TraceCheckUtils]: 35: Hoare triple {15690#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {15690#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:50,174 INFO L273 TraceCheckUtils]: 36: Hoare triple {15690#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15691#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:07:50,175 INFO L273 TraceCheckUtils]: 37: Hoare triple {15691#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15691#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:07:50,176 INFO L273 TraceCheckUtils]: 38: Hoare triple {15691#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15692#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:07:50,176 INFO L273 TraceCheckUtils]: 39: Hoare triple {15692#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {15692#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:07:50,177 INFO L273 TraceCheckUtils]: 40: Hoare triple {15692#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15693#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:07:50,178 INFO L273 TraceCheckUtils]: 41: Hoare triple {15693#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15693#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:07:50,179 INFO L273 TraceCheckUtils]: 42: Hoare triple {15693#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15694#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:07:50,180 INFO L273 TraceCheckUtils]: 43: Hoare triple {15694#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15694#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:07:50,181 INFO L273 TraceCheckUtils]: 44: Hoare triple {15694#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15695#(and (<= main_~x~0 40) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:50,182 INFO L273 TraceCheckUtils]: 45: Hoare triple {15695#(and (<= main_~x~0 40) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {15674#false} is VALID [2018-11-23 13:07:50,182 INFO L256 TraceCheckUtils]: 46: Hoare triple {15674#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15674#false} is VALID [2018-11-23 13:07:50,183 INFO L273 TraceCheckUtils]: 47: Hoare triple {15674#false} ~cond := #in~cond; {15674#false} is VALID [2018-11-23 13:07:50,183 INFO L273 TraceCheckUtils]: 48: Hoare triple {15674#false} assume 0 == ~cond; {15674#false} is VALID [2018-11-23 13:07:50,183 INFO L273 TraceCheckUtils]: 49: Hoare triple {15674#false} assume !false; {15674#false} is VALID [2018-11-23 13:07:50,188 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:50,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:50,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:50,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:07:50,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:07:50,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:50,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:50,375 INFO L256 TraceCheckUtils]: 0: Hoare triple {15673#true} call ULTIMATE.init(); {15673#true} is VALID [2018-11-23 13:07:50,375 INFO L273 TraceCheckUtils]: 1: Hoare triple {15673#true} assume true; {15673#true} is VALID [2018-11-23 13:07:50,375 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {15673#true} {15673#true} #37#return; {15673#true} is VALID [2018-11-23 13:07:50,376 INFO L256 TraceCheckUtils]: 3: Hoare triple {15673#true} call #t~ret2 := main(); {15673#true} is VALID [2018-11-23 13:07:50,377 INFO L273 TraceCheckUtils]: 4: Hoare triple {15673#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {15675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:50,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {15675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:50,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {15675#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15676#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:50,378 INFO L273 TraceCheckUtils]: 7: Hoare triple {15676#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {15676#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:50,379 INFO L273 TraceCheckUtils]: 8: Hoare triple {15676#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15677#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:50,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {15677#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {15677#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:50,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {15677#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15678#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:50,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {15678#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15678#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:50,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {15678#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15679#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:50,383 INFO L273 TraceCheckUtils]: 13: Hoare triple {15679#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {15679#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:50,385 INFO L273 TraceCheckUtils]: 14: Hoare triple {15679#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15680#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:50,385 INFO L273 TraceCheckUtils]: 15: Hoare triple {15680#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15680#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:50,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {15680#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15681#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:50,387 INFO L273 TraceCheckUtils]: 17: Hoare triple {15681#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15681#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:50,388 INFO L273 TraceCheckUtils]: 18: Hoare triple {15681#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15682#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:50,389 INFO L273 TraceCheckUtils]: 19: Hoare triple {15682#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15682#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:50,390 INFO L273 TraceCheckUtils]: 20: Hoare triple {15682#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15683#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:50,391 INFO L273 TraceCheckUtils]: 21: Hoare triple {15683#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15683#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:50,392 INFO L273 TraceCheckUtils]: 22: Hoare triple {15683#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15684#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:50,393 INFO L273 TraceCheckUtils]: 23: Hoare triple {15684#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15684#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:50,394 INFO L273 TraceCheckUtils]: 24: Hoare triple {15684#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15685#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:50,394 INFO L273 TraceCheckUtils]: 25: Hoare triple {15685#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {15685#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:50,395 INFO L273 TraceCheckUtils]: 26: Hoare triple {15685#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15686#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:50,396 INFO L273 TraceCheckUtils]: 27: Hoare triple {15686#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15686#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:07:50,397 INFO L273 TraceCheckUtils]: 28: Hoare triple {15686#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15687#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:50,398 INFO L273 TraceCheckUtils]: 29: Hoare triple {15687#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15687#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:07:50,399 INFO L273 TraceCheckUtils]: 30: Hoare triple {15687#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15688#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:50,400 INFO L273 TraceCheckUtils]: 31: Hoare triple {15688#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15688#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:07:50,401 INFO L273 TraceCheckUtils]: 32: Hoare triple {15688#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15689#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:50,402 INFO L273 TraceCheckUtils]: 33: Hoare triple {15689#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15689#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:07:50,403 INFO L273 TraceCheckUtils]: 34: Hoare triple {15689#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15690#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:50,403 INFO L273 TraceCheckUtils]: 35: Hoare triple {15690#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {15690#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:07:50,404 INFO L273 TraceCheckUtils]: 36: Hoare triple {15690#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15691#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:07:50,405 INFO L273 TraceCheckUtils]: 37: Hoare triple {15691#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15691#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:07:50,406 INFO L273 TraceCheckUtils]: 38: Hoare triple {15691#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15692#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:07:50,407 INFO L273 TraceCheckUtils]: 39: Hoare triple {15692#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {15692#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:07:50,408 INFO L273 TraceCheckUtils]: 40: Hoare triple {15692#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15693#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:07:50,409 INFO L273 TraceCheckUtils]: 41: Hoare triple {15693#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15693#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:07:50,410 INFO L273 TraceCheckUtils]: 42: Hoare triple {15693#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15694#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:07:50,411 INFO L273 TraceCheckUtils]: 43: Hoare triple {15694#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {15694#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:07:50,412 INFO L273 TraceCheckUtils]: 44: Hoare triple {15694#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {15831#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:07:50,413 INFO L273 TraceCheckUtils]: 45: Hoare triple {15831#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {15674#false} is VALID [2018-11-23 13:07:50,413 INFO L256 TraceCheckUtils]: 46: Hoare triple {15674#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {15674#false} is VALID [2018-11-23 13:07:50,413 INFO L273 TraceCheckUtils]: 47: Hoare triple {15674#false} ~cond := #in~cond; {15674#false} is VALID [2018-11-23 13:07:50,413 INFO L273 TraceCheckUtils]: 48: Hoare triple {15674#false} assume 0 == ~cond; {15674#false} is VALID [2018-11-23 13:07:50,413 INFO L273 TraceCheckUtils]: 49: Hoare triple {15674#false} assume !false; {15674#false} is VALID [2018-11-23 13:07:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:50,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:50,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 13:07:50,436 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-11-23 13:07:50,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:50,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 13:07:50,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:50,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 13:07:50,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 13:07:50,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:07:50,497 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 24 states. [2018-11-23 13:07:52,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:52,995 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-11-23 13:07:52,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:07:52,995 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2018-11-23 13:07:52,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:52,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:07:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 63 transitions. [2018-11-23 13:07:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:07:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 63 transitions. [2018-11-23 13:07:52,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 63 transitions. [2018-11-23 13:07:53,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:53,071 INFO L225 Difference]: With dead ends: 100 [2018-11-23 13:07:53,072 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 13:07:53,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:07:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 13:07:53,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-11-23 13:07:53,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:53,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 94 states. [2018-11-23 13:07:53,157 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 94 states. [2018-11-23 13:07:53,157 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 94 states. [2018-11-23 13:07:53,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:53,159 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-11-23 13:07:53,159 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-23 13:07:53,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:53,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:53,160 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 95 states. [2018-11-23 13:07:53,160 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 95 states. [2018-11-23 13:07:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:53,161 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-11-23 13:07:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-11-23 13:07:53,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:53,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:53,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:53,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 13:07:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-11-23 13:07:53,162 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 50 [2018-11-23 13:07:53,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:53,163 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-11-23 13:07:53,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 13:07:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-11-23 13:07:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 13:07:53,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:53,163 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:53,164 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:53,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:53,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1797793337, now seen corresponding path program 21 times [2018-11-23 13:07:53,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:53,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:53,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:53,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:53,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:53,680 INFO L256 TraceCheckUtils]: 0: Hoare triple {16330#true} call ULTIMATE.init(); {16330#true} is VALID [2018-11-23 13:07:53,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {16330#true} assume true; {16330#true} is VALID [2018-11-23 13:07:53,681 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {16330#true} {16330#true} #37#return; {16330#true} is VALID [2018-11-23 13:07:53,681 INFO L256 TraceCheckUtils]: 3: Hoare triple {16330#true} call #t~ret2 := main(); {16330#true} is VALID [2018-11-23 13:07:53,682 INFO L273 TraceCheckUtils]: 4: Hoare triple {16330#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {16332#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:53,682 INFO L273 TraceCheckUtils]: 5: Hoare triple {16332#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16332#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:07:53,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {16332#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16333#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:53,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {16333#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16333#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:07:53,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {16333#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16334#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:53,685 INFO L273 TraceCheckUtils]: 9: Hoare triple {16334#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {16334#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:07:53,685 INFO L273 TraceCheckUtils]: 10: Hoare triple {16334#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16335#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:53,686 INFO L273 TraceCheckUtils]: 11: Hoare triple {16335#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16335#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:07:53,687 INFO L273 TraceCheckUtils]: 12: Hoare triple {16335#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16336#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:53,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {16336#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {16336#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:07:53,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {16336#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16337#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:53,689 INFO L273 TraceCheckUtils]: 15: Hoare triple {16337#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {16337#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:07:53,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {16337#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16338#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:53,691 INFO L273 TraceCheckUtils]: 17: Hoare triple {16338#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16338#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:07:53,692 INFO L273 TraceCheckUtils]: 18: Hoare triple {16338#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16339#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:53,693 INFO L273 TraceCheckUtils]: 19: Hoare triple {16339#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16339#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:07:53,694 INFO L273 TraceCheckUtils]: 20: Hoare triple {16339#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16340#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:53,695 INFO L273 TraceCheckUtils]: 21: Hoare triple {16340#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {16340#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:07:53,696 INFO L273 TraceCheckUtils]: 22: Hoare triple {16340#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16341#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:53,697 INFO L273 TraceCheckUtils]: 23: Hoare triple {16341#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {16341#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:07:53,698 INFO L273 TraceCheckUtils]: 24: Hoare triple {16341#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16342#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:53,698 INFO L273 TraceCheckUtils]: 25: Hoare triple {16342#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16342#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:07:53,699 INFO L273 TraceCheckUtils]: 26: Hoare triple {16342#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16343#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:53,700 INFO L273 TraceCheckUtils]: 27: Hoare triple {16343#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {16343#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:07:53,701 INFO L273 TraceCheckUtils]: 28: Hoare triple {16343#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16344#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:53,702 INFO L273 TraceCheckUtils]: 29: Hoare triple {16344#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16344#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:07:53,703 INFO L273 TraceCheckUtils]: 30: Hoare triple {16344#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16345#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:53,704 INFO L273 TraceCheckUtils]: 31: Hoare triple {16345#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16345#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:07:53,705 INFO L273 TraceCheckUtils]: 32: Hoare triple {16345#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16346#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:53,705 INFO L273 TraceCheckUtils]: 33: Hoare triple {16346#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16346#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:07:53,712 INFO L273 TraceCheckUtils]: 34: Hoare triple {16346#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16347#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:53,713 INFO L273 TraceCheckUtils]: 35: Hoare triple {16347#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {16347#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:07:53,713 INFO L273 TraceCheckUtils]: 36: Hoare triple {16347#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16348#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:53,714 INFO L273 TraceCheckUtils]: 37: Hoare triple {16348#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16348#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:07:53,714 INFO L273 TraceCheckUtils]: 38: Hoare triple {16348#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16349#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:53,715 INFO L273 TraceCheckUtils]: 39: Hoare triple {16349#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16349#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:07:53,715 INFO L273 TraceCheckUtils]: 40: Hoare triple {16349#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16350#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:53,716 INFO L273 TraceCheckUtils]: 41: Hoare triple {16350#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16350#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:07:53,716 INFO L273 TraceCheckUtils]: 42: Hoare triple {16350#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16351#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:07:53,717 INFO L273 TraceCheckUtils]: 43: Hoare triple {16351#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16351#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:07:53,718 INFO L273 TraceCheckUtils]: 44: Hoare triple {16351#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16352#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:53,719 INFO L273 TraceCheckUtils]: 45: Hoare triple {16352#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {16352#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:07:53,720 INFO L273 TraceCheckUtils]: 46: Hoare triple {16352#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16353#(and (<= main_~x~0 21) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:07:53,721 INFO L273 TraceCheckUtils]: 47: Hoare triple {16353#(and (<= main_~x~0 21) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {16331#false} is VALID [2018-11-23 13:07:53,721 INFO L256 TraceCheckUtils]: 48: Hoare triple {16331#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16331#false} is VALID [2018-11-23 13:07:53,721 INFO L273 TraceCheckUtils]: 49: Hoare triple {16331#false} ~cond := #in~cond; {16331#false} is VALID [2018-11-23 13:07:53,722 INFO L273 TraceCheckUtils]: 50: Hoare triple {16331#false} assume 0 == ~cond; {16331#false} is VALID [2018-11-23 13:07:53,722 INFO L273 TraceCheckUtils]: 51: Hoare triple {16331#false} assume !false; {16331#false} is VALID [2018-11-23 13:07:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:07:53,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:53,726 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:07:53,735 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:08:10,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 13:08:10,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:11,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:11,203 INFO L256 TraceCheckUtils]: 0: Hoare triple {16330#true} call ULTIMATE.init(); {16330#true} is VALID [2018-11-23 13:08:11,204 INFO L273 TraceCheckUtils]: 1: Hoare triple {16330#true} assume true; {16330#true} is VALID [2018-11-23 13:08:11,204 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {16330#true} {16330#true} #37#return; {16330#true} is VALID [2018-11-23 13:08:11,204 INFO L256 TraceCheckUtils]: 3: Hoare triple {16330#true} call #t~ret2 := main(); {16330#true} is VALID [2018-11-23 13:08:11,204 INFO L273 TraceCheckUtils]: 4: Hoare triple {16330#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {16332#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:11,205 INFO L273 TraceCheckUtils]: 5: Hoare triple {16332#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16332#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:11,205 INFO L273 TraceCheckUtils]: 6: Hoare triple {16332#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16333#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:11,206 INFO L273 TraceCheckUtils]: 7: Hoare triple {16333#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16333#(and (<= main_~x~0 1) (<= 1 main_~x~0))} is VALID [2018-11-23 13:08:11,206 INFO L273 TraceCheckUtils]: 8: Hoare triple {16333#(and (<= main_~x~0 1) (<= 1 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16334#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:11,207 INFO L273 TraceCheckUtils]: 9: Hoare triple {16334#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {16334#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:11,208 INFO L273 TraceCheckUtils]: 10: Hoare triple {16334#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16335#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:08:11,208 INFO L273 TraceCheckUtils]: 11: Hoare triple {16335#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16335#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2018-11-23 13:08:11,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {16335#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16336#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:11,210 INFO L273 TraceCheckUtils]: 13: Hoare triple {16336#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {16336#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:11,211 INFO L273 TraceCheckUtils]: 14: Hoare triple {16336#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16337#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:08:11,212 INFO L273 TraceCheckUtils]: 15: Hoare triple {16337#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 99); {16337#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2018-11-23 13:08:11,213 INFO L273 TraceCheckUtils]: 16: Hoare triple {16337#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16338#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:11,214 INFO L273 TraceCheckUtils]: 17: Hoare triple {16338#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16338#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:11,215 INFO L273 TraceCheckUtils]: 18: Hoare triple {16338#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16339#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:08:11,215 INFO L273 TraceCheckUtils]: 19: Hoare triple {16339#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16339#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2018-11-23 13:08:11,217 INFO L273 TraceCheckUtils]: 20: Hoare triple {16339#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16340#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:11,217 INFO L273 TraceCheckUtils]: 21: Hoare triple {16340#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {16340#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:11,218 INFO L273 TraceCheckUtils]: 22: Hoare triple {16340#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16341#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:08:11,219 INFO L273 TraceCheckUtils]: 23: Hoare triple {16341#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume !!(~x~0 % 4294967296 < 99); {16341#(and (<= 9 main_~x~0) (<= main_~x~0 9))} is VALID [2018-11-23 13:08:11,220 INFO L273 TraceCheckUtils]: 24: Hoare triple {16341#(and (<= 9 main_~x~0) (<= main_~x~0 9))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16342#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:11,221 INFO L273 TraceCheckUtils]: 25: Hoare triple {16342#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16342#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:11,222 INFO L273 TraceCheckUtils]: 26: Hoare triple {16342#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16343#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:08:11,223 INFO L273 TraceCheckUtils]: 27: Hoare triple {16343#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume !!(~x~0 % 4294967296 < 99); {16343#(and (<= 11 main_~x~0) (<= main_~x~0 11))} is VALID [2018-11-23 13:08:11,224 INFO L273 TraceCheckUtils]: 28: Hoare triple {16343#(and (<= 11 main_~x~0) (<= main_~x~0 11))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16344#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:11,224 INFO L273 TraceCheckUtils]: 29: Hoare triple {16344#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16344#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:11,242 INFO L273 TraceCheckUtils]: 30: Hoare triple {16344#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16345#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:08:11,242 INFO L273 TraceCheckUtils]: 31: Hoare triple {16345#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16345#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2018-11-23 13:08:11,243 INFO L273 TraceCheckUtils]: 32: Hoare triple {16345#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16346#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:11,243 INFO L273 TraceCheckUtils]: 33: Hoare triple {16346#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16346#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:11,244 INFO L273 TraceCheckUtils]: 34: Hoare triple {16346#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16347#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:08:11,244 INFO L273 TraceCheckUtils]: 35: Hoare triple {16347#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 99); {16347#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2018-11-23 13:08:11,245 INFO L273 TraceCheckUtils]: 36: Hoare triple {16347#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16348#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:11,263 INFO L273 TraceCheckUtils]: 37: Hoare triple {16348#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16348#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:11,272 INFO L273 TraceCheckUtils]: 38: Hoare triple {16348#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16349#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:08:11,274 INFO L273 TraceCheckUtils]: 39: Hoare triple {16349#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16349#(and (<= main_~x~0 17) (<= 17 main_~x~0))} is VALID [2018-11-23 13:08:11,275 INFO L273 TraceCheckUtils]: 40: Hoare triple {16349#(and (<= main_~x~0 17) (<= 17 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16350#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:11,275 INFO L273 TraceCheckUtils]: 41: Hoare triple {16350#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16350#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:11,276 INFO L273 TraceCheckUtils]: 42: Hoare triple {16350#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16351#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:08:11,276 INFO L273 TraceCheckUtils]: 43: Hoare triple {16351#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {16351#(and (<= main_~x~0 19) (<= 19 main_~x~0))} is VALID [2018-11-23 13:08:11,277 INFO L273 TraceCheckUtils]: 44: Hoare triple {16351#(and (<= main_~x~0 19) (<= 19 main_~x~0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16352#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:11,277 INFO L273 TraceCheckUtils]: 45: Hoare triple {16352#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {16352#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:11,278 INFO L273 TraceCheckUtils]: 46: Hoare triple {16352#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post1 := ~x~0;~x~0 := 1 + #t~post1;havoc #t~post1; {16495#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2018-11-23 13:08:11,279 INFO L273 TraceCheckUtils]: 47: Hoare triple {16495#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !(~x~0 % 4294967296 < 99); {16331#false} is VALID [2018-11-23 13:08:11,279 INFO L256 TraceCheckUtils]: 48: Hoare triple {16331#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {16331#false} is VALID [2018-11-23 13:08:11,279 INFO L273 TraceCheckUtils]: 49: Hoare triple {16331#false} ~cond := #in~cond; {16331#false} is VALID [2018-11-23 13:08:11,280 INFO L273 TraceCheckUtils]: 50: Hoare triple {16331#false} assume 0 == ~cond; {16331#false} is VALID [2018-11-23 13:08:11,280 INFO L273 TraceCheckUtils]: 51: Hoare triple {16331#false} assume !false; {16331#false} is VALID [2018-11-23 13:08:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:11,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:11,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 13:08:11,306 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-11-23 13:08:11,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:11,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:08:11,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:11,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:08:11,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:08:11,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:08:11,370 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 25 states. [2018-11-23 13:08:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:14,473 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-11-23 13:08:14,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:08:14,474 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 52 [2018-11-23 13:08:14,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:08:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 73 transitions. [2018-11-23 13:08:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:08:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 73 transitions. [2018-11-23 13:08:14,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 73 transitions. [2018-11-23 13:08:14,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:14,563 INFO L225 Difference]: With dead ends: 102 [2018-11-23 13:08:14,563 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 13:08:14,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:08:14,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 13:08:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-11-23 13:08:14,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:14,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 96 states. [2018-11-23 13:08:14,670 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 96 states. [2018-11-23 13:08:14,670 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 96 states. [2018-11-23 13:08:14,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:14,672 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-11-23 13:08:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-11-23 13:08:14,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:14,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:14,673 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 97 states. [2018-11-23 13:08:14,673 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 97 states. [2018-11-23 13:08:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:14,674 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-11-23 13:08:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-11-23 13:08:14,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:14,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:14,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:14,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:14,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 13:08:14,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-11-23 13:08:14,677 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 52 [2018-11-23 13:08:14,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:14,677 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-11-23 13:08:14,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:08:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-11-23 13:08:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 13:08:14,678 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:14,678 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:14,678 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:14,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:14,678 INFO L82 PathProgramCache]: Analyzing trace with hash -320886449, now seen corresponding path program 21 times [2018-11-23 13:08:14,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:14,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:14,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:14,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:14,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:15,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {17004#true} call ULTIMATE.init(); {17004#true} is VALID [2018-11-23 13:08:15,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {17004#true} assume true; {17004#true} is VALID [2018-11-23 13:08:15,536 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {17004#true} {17004#true} #37#return; {17004#true} is VALID [2018-11-23 13:08:15,536 INFO L256 TraceCheckUtils]: 3: Hoare triple {17004#true} call #t~ret2 := main(); {17004#true} is VALID [2018-11-23 13:08:15,536 INFO L273 TraceCheckUtils]: 4: Hoare triple {17004#true} ~x~0 := 0;~y~0 := #t~nondet0;havoc #t~nondet0; {17006#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:15,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {17006#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17006#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:15,537 INFO L273 TraceCheckUtils]: 6: Hoare triple {17006#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:15,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {17007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {17007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:15,538 INFO L273 TraceCheckUtils]: 8: Hoare triple {17007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17008#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:15,539 INFO L273 TraceCheckUtils]: 9: Hoare triple {17008#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 99); {17008#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:15,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {17008#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17009#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:15,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {17009#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17009#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:15,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {17009#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17010#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:15,543 INFO L273 TraceCheckUtils]: 13: Hoare triple {17010#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 99); {17010#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:15,544 INFO L273 TraceCheckUtils]: 14: Hoare triple {17010#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:15,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {17011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:15,545 INFO L273 TraceCheckUtils]: 16: Hoare triple {17011#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:15,546 INFO L273 TraceCheckUtils]: 17: Hoare triple {17012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:15,547 INFO L273 TraceCheckUtils]: 18: Hoare triple {17012#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17013#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:15,548 INFO L273 TraceCheckUtils]: 19: Hoare triple {17013#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17013#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:15,549 INFO L273 TraceCheckUtils]: 20: Hoare triple {17013#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:15,550 INFO L273 TraceCheckUtils]: 21: Hoare triple {17014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:15,551 INFO L273 TraceCheckUtils]: 22: Hoare triple {17014#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:15,552 INFO L273 TraceCheckUtils]: 23: Hoare triple {17015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:15,553 INFO L273 TraceCheckUtils]: 24: Hoare triple {17015#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17016#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:15,553 INFO L273 TraceCheckUtils]: 25: Hoare triple {17016#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 99); {17016#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:15,555 INFO L273 TraceCheckUtils]: 26: Hoare triple {17016#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17017#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:15,555 INFO L273 TraceCheckUtils]: 27: Hoare triple {17017#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17017#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:15,558 INFO L273 TraceCheckUtils]: 28: Hoare triple {17017#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:15,559 INFO L273 TraceCheckUtils]: 29: Hoare triple {17018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:15,560 INFO L273 TraceCheckUtils]: 30: Hoare triple {17018#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:15,560 INFO L273 TraceCheckUtils]: 31: Hoare triple {17019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:15,561 INFO L273 TraceCheckUtils]: 32: Hoare triple {17019#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17020#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:15,561 INFO L273 TraceCheckUtils]: 33: Hoare triple {17020#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17020#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:15,562 INFO L273 TraceCheckUtils]: 34: Hoare triple {17020#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:15,562 INFO L273 TraceCheckUtils]: 35: Hoare triple {17021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 99); {17021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:15,563 INFO L273 TraceCheckUtils]: 36: Hoare triple {17021#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:15,564 INFO L273 TraceCheckUtils]: 37: Hoare triple {17022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:15,565 INFO L273 TraceCheckUtils]: 38: Hoare triple {17022#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17023#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:15,566 INFO L273 TraceCheckUtils]: 39: Hoare triple {17023#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 99); {17023#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:15,567 INFO L273 TraceCheckUtils]: 40: Hoare triple {17023#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17024#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:15,568 INFO L273 TraceCheckUtils]: 41: Hoare triple {17024#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17024#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:15,569 INFO L273 TraceCheckUtils]: 42: Hoare triple {17024#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17025#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:08:15,569 INFO L273 TraceCheckUtils]: 43: Hoare triple {17025#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17025#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:08:15,571 INFO L273 TraceCheckUtils]: 44: Hoare triple {17025#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17026#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:08:15,571 INFO L273 TraceCheckUtils]: 45: Hoare triple {17026#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {17026#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:08:15,573 INFO L273 TraceCheckUtils]: 46: Hoare triple {17026#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {17027#(and (<= main_~x~0 42) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:15,573 INFO L273 TraceCheckUtils]: 47: Hoare triple {17027#(and (<= main_~x~0 42) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 99); {17005#false} is VALID [2018-11-23 13:08:15,574 INFO L256 TraceCheckUtils]: 48: Hoare triple {17005#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {17005#false} is VALID [2018-11-23 13:08:15,574 INFO L273 TraceCheckUtils]: 49: Hoare triple {17005#false} ~cond := #in~cond; {17005#false} is VALID [2018-11-23 13:08:15,574 INFO L273 TraceCheckUtils]: 50: Hoare triple {17005#false} assume 0 == ~cond; {17005#false} is VALID [2018-11-23 13:08:15,574 INFO L273 TraceCheckUtils]: 51: Hoare triple {17005#false} assume !false; {17005#false} is VALID [2018-11-23 13:08:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:15,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:15,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:15,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2