java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:32:50,004 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:32:50,006 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:32:50,023 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:32:50,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:32:50,024 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:32:50,025 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:32:50,027 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:32:50,029 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:32:50,030 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:32:50,031 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:32:50,031 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:32:50,032 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:32:50,033 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:32:50,034 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:32:50,035 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:32:50,036 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:32:50,038 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:32:50,040 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:32:50,041 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:32:50,046 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:32:50,047 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:32:50,052 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:32:50,056 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:32:50,056 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:32:50,057 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:32:50,058 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:32:50,059 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:32:50,059 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:32:50,063 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:32:50,063 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:32:50,064 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:32:50,064 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:32:50,064 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:32:50,067 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:32:50,067 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:32:50,068 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:32:50,095 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:32:50,095 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:32:50,096 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:32:50,096 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:32:50,097 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:32:50,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:32:50,098 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:32:50,098 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:32:50,098 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:32:50,099 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:32:50,099 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:32:50,099 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:32:50,099 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:32:50,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:32:50,100 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:32:50,101 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:32:50,101 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:32:50,101 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:32:50,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:32:50,102 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:32:50,102 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:32:50,102 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:32:50,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:32:50,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:32:50,103 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:32:50,103 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:32:50,103 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:32:50,103 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:32:50,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:32:50,104 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:32:50,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:32:50,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:32:50,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:32:50,177 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:32:50,177 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:32:50,178 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call1.i [2018-11-14 17:32:50,238 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df40955da/e1d7ed78e4c941b4a2386fd545733ccb/FLAG660b816d1 [2018-11-14 17:32:50,655 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:32:50,655 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call1.i [2018-11-14 17:32:50,661 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df40955da/e1d7ed78e4c941b4a2386fd545733ccb/FLAG660b816d1 [2018-11-14 17:32:50,677 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df40955da/e1d7ed78e4c941b4a2386fd545733ccb [2018-11-14 17:32:50,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:32:50,690 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:32:50,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:32:50,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:32:50,695 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:32:50,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:32:50" (1/1) ... [2018-11-14 17:32:50,700 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56fa85a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:50, skipping insertion in model container [2018-11-14 17:32:50,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:32:50" (1/1) ... [2018-11-14 17:32:50,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:32:50,735 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:32:50,986 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:32:50,992 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:32:51,010 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:32:51,027 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:32:51,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:51 WrapperNode [2018-11-14 17:32:51,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:32:51,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:32:51,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:32:51,029 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:32:51,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:51" (1/1) ... [2018-11-14 17:32:51,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:51" (1/1) ... [2018-11-14 17:32:51,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:51" (1/1) ... [2018-11-14 17:32:51,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:51" (1/1) ... [2018-11-14 17:32:51,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:51" (1/1) ... [2018-11-14 17:32:51,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:51" (1/1) ... [2018-11-14 17:32:51,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:51" (1/1) ... [2018-11-14 17:32:51,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:32:51,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:32:51,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:32:51,065 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:32:51,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:32:51,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:32:51,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:32:51,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:32:51,224 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:32:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:32:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:32:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:32:51,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:32:51,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:32:51,680 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:32:51,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:32:51 BoogieIcfgContainer [2018-11-14 17:32:51,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:32:51,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:32:51,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:32:51,685 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:32:51,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:32:50" (1/3) ... [2018-11-14 17:32:51,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c24160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:32:51, skipping insertion in model container [2018-11-14 17:32:51,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:32:51" (2/3) ... [2018-11-14 17:32:51,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c24160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:32:51, skipping insertion in model container [2018-11-14 17:32:51,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:32:51" (3/3) ... [2018-11-14 17:32:51,688 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call1.i [2018-11-14 17:32:51,698 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:32:51,707 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:32:51,725 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:32:51,758 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:32:51,759 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:32:51,759 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:32:51,759 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:32:51,759 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:32:51,759 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:32:51,760 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:32:51,760 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:32:51,760 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:32:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-14 17:32:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 17:32:51,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:51,787 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:51,789 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:51,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:51,795 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-14 17:32:51,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:51,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:51,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:51,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:51,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:51,919 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-14 17:32:51,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-14 17:32:51,923 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-14 17:32:51,924 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret0 := main(); {21#true} is VALID [2018-11-14 17:32:51,924 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 0; {21#true} is VALID [2018-11-14 17:32:51,926 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-14 17:32:51,927 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {22#false} is VALID [2018-11-14 17:32:51,927 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-14 17:32:51,927 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume ~cond == 0; {22#false} is VALID [2018-11-14 17:32:51,928 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-14 17:32:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:51,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:32:51,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:32:51,939 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 17:32:51,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:51,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:32:52,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-14 17:32:52,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:32:52,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:32:52,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:32:52,040 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-14 17:32:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:52,123 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-14 17:32:52,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:32:52,123 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 17:32:52,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:32:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-14 17:32:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:32:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-14 17:32:52,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2018-11-14 17:32:52,332 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-14 17:32:52,342 INFO L225 Difference]: With dead ends: 29 [2018-11-14 17:32:52,342 INFO L226 Difference]: Without dead ends: 12 [2018-11-14 17:32:52,345 INFO L604 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-14 17:32:52,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-14 17:32:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-14 17:32:52,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:52,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-14 17:32:52,423 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 17:32:52,423 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 17:32:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:52,427 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 17:32:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 17:32:52,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:52,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:52,428 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 17:32:52,428 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 17:32:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:52,431 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 17:32:52,431 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 17:32:52,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:52,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:52,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:52,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:32:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-14 17:32:52,437 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-14 17:32:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:52,438 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-14 17:32:52,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:32:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 17:32:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 17:32:52,439 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:52,439 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:52,439 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:52,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:52,440 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-14 17:32:52,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:52,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:52,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:52,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:52,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:52,767 INFO L256 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {106#true} is VALID [2018-11-14 17:32:52,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {106#true} assume true; {106#true} is VALID [2018-11-14 17:32:52,768 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} #32#return; {106#true} is VALID [2018-11-14 17:32:52,768 INFO L256 TraceCheckUtils]: 3: Hoare triple {106#true} call #t~ret0 := main(); {106#true} is VALID [2018-11-14 17:32:52,769 INFO L273 TraceCheckUtils]: 4: Hoare triple {106#true} ~x~0 := 0; {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:52,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:52,771 INFO L273 TraceCheckUtils]: 6: Hoare triple {108#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {107#false} is VALID [2018-11-14 17:32:52,772 INFO L256 TraceCheckUtils]: 7: Hoare triple {107#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {107#false} is VALID [2018-11-14 17:32:52,772 INFO L273 TraceCheckUtils]: 8: Hoare triple {107#false} ~cond := #in~cond; {107#false} is VALID [2018-11-14 17:32:52,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {107#false} assume ~cond == 0; {107#false} is VALID [2018-11-14 17:32:52,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {107#false} assume !false; {107#false} is VALID [2018-11-14 17:32:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:52,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:32:52,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:32:52,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 17:32:52,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:52,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:32:52,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:52,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:32:52,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:32:52,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:32:52,824 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-14 17:32:52,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:52,926 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 17:32:52,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:32:52,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 17:32:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:52,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:32:52,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-14 17:32:52,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:32:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-14 17:32:52,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2018-11-14 17:32:52,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:52,980 INFO L225 Difference]: With dead ends: 19 [2018-11-14 17:32:52,980 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 17:32:52,981 INFO L604 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-14 17:32:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 17:32:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 17:32:53,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:53,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 17:32:53,089 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 17:32:53,089 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 17:32:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:53,091 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 17:32:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 17:32:53,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:53,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:53,092 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 17:32:53,092 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 17:32:53,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:53,094 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 17:32:53,094 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 17:32:53,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:53,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:53,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:53,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:53,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:32:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-14 17:32:53,097 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-14 17:32:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:53,097 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-14 17:32:53,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:32:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 17:32:53,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 17:32:53,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:53,098 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:53,099 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:53,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:53,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-14 17:32:53,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:53,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:53,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:53,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:53,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:53,256 INFO L256 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2018-11-14 17:32:53,256 INFO L273 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2018-11-14 17:32:53,256 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #32#return; {190#true} is VALID [2018-11-14 17:32:53,257 INFO L256 TraceCheckUtils]: 3: Hoare triple {190#true} call #t~ret0 := main(); {190#true} is VALID [2018-11-14 17:32:53,257 INFO L273 TraceCheckUtils]: 4: Hoare triple {190#true} ~x~0 := 0; {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:53,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:53,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {193#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:53,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {193#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {193#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:53,264 INFO L273 TraceCheckUtils]: 8: Hoare triple {193#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {191#false} is VALID [2018-11-14 17:32:53,264 INFO L256 TraceCheckUtils]: 9: Hoare triple {191#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {191#false} is VALID [2018-11-14 17:32:53,265 INFO L273 TraceCheckUtils]: 10: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2018-11-14 17:32:53,265 INFO L273 TraceCheckUtils]: 11: Hoare triple {191#false} assume ~cond == 0; {191#false} is VALID [2018-11-14 17:32:53,266 INFO L273 TraceCheckUtils]: 12: Hoare triple {191#false} assume !false; {191#false} is VALID [2018-11-14 17:32:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:53,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:53,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:53,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:53,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:53,466 INFO L256 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2018-11-14 17:32:53,467 INFO L273 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2018-11-14 17:32:53,467 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #32#return; {190#true} is VALID [2018-11-14 17:32:53,468 INFO L256 TraceCheckUtils]: 3: Hoare triple {190#true} call #t~ret0 := main(); {190#true} is VALID [2018-11-14 17:32:53,486 INFO L273 TraceCheckUtils]: 4: Hoare triple {190#true} ~x~0 := 0; {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:53,500 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:53,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {215#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:53,530 INFO L273 TraceCheckUtils]: 7: Hoare triple {215#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {215#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:53,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {191#false} is VALID [2018-11-14 17:32:53,545 INFO L256 TraceCheckUtils]: 9: Hoare triple {191#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {191#false} is VALID [2018-11-14 17:32:53,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2018-11-14 17:32:53,546 INFO L273 TraceCheckUtils]: 11: Hoare triple {191#false} assume ~cond == 0; {191#false} is VALID [2018-11-14 17:32:53,546 INFO L273 TraceCheckUtils]: 12: Hoare triple {191#false} assume !false; {191#false} is VALID [2018-11-14 17:32:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:53,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:53,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 17:32:53,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 17:32:53,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:53,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:32:53,743 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-14 17:32:53,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:32:53,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:32:53,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:32:53,745 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 5 states. [2018-11-14 17:32:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:54,037 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-14 17:32:54,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:32:54,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-14 17:32:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:54,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:32:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-14 17:32:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:32:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-14 17:32:54,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2018-11-14 17:32:54,154 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-14 17:32:54,155 INFO L225 Difference]: With dead ends: 21 [2018-11-14 17:32:54,155 INFO L226 Difference]: Without dead ends: 16 [2018-11-14 17:32:54,156 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:32:54,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-14 17:32:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-14 17:32:54,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:54,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-14 17:32:54,166 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 17:32:54,166 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 17:32:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:54,168 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 17:32:54,168 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 17:32:54,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:54,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:54,169 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-14 17:32:54,169 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-14 17:32:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:54,171 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-14 17:32:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 17:32:54,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:54,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:54,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:54,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:54,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:32:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-14 17:32:54,173 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-14 17:32:54,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:54,174 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-14 17:32:54,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:32:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-14 17:32:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:32:54,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:54,175 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:54,175 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:54,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:54,176 INFO L82 PathProgramCache]: Analyzing trace with hash -720896604, now seen corresponding path program 2 times [2018-11-14 17:32:54,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:54,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:54,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:54,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:54,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:54,351 INFO L256 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2018-11-14 17:32:54,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2018-11-14 17:32:54,351 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #32#return; {322#true} is VALID [2018-11-14 17:32:54,351 INFO L256 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret0 := main(); {322#true} is VALID [2018-11-14 17:32:54,357 INFO L273 TraceCheckUtils]: 4: Hoare triple {322#true} ~x~0 := 0; {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:54,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:54,362 INFO L273 TraceCheckUtils]: 6: Hoare triple {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {325#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:54,363 INFO L273 TraceCheckUtils]: 7: Hoare triple {325#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {325#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:54,364 INFO L273 TraceCheckUtils]: 8: Hoare triple {325#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {326#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:54,364 INFO L273 TraceCheckUtils]: 9: Hoare triple {326#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {326#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:54,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {326#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {323#false} is VALID [2018-11-14 17:32:54,366 INFO L256 TraceCheckUtils]: 11: Hoare triple {323#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {323#false} is VALID [2018-11-14 17:32:54,367 INFO L273 TraceCheckUtils]: 12: Hoare triple {323#false} ~cond := #in~cond; {323#false} is VALID [2018-11-14 17:32:54,367 INFO L273 TraceCheckUtils]: 13: Hoare triple {323#false} assume ~cond == 0; {323#false} is VALID [2018-11-14 17:32:54,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {323#false} assume !false; {323#false} is VALID [2018-11-14 17:32:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:54,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:54,370 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:54,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:32:54,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:32:54,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:54,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:54,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {322#true} call ULTIMATE.init(); {322#true} is VALID [2018-11-14 17:32:54,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {322#true} assume true; {322#true} is VALID [2018-11-14 17:32:54,536 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {322#true} {322#true} #32#return; {322#true} is VALID [2018-11-14 17:32:54,536 INFO L256 TraceCheckUtils]: 3: Hoare triple {322#true} call #t~ret0 := main(); {322#true} is VALID [2018-11-14 17:32:54,537 INFO L273 TraceCheckUtils]: 4: Hoare triple {322#true} ~x~0 := 0; {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:54,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:54,541 INFO L273 TraceCheckUtils]: 6: Hoare triple {324#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {325#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:54,541 INFO L273 TraceCheckUtils]: 7: Hoare triple {325#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {325#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:54,542 INFO L273 TraceCheckUtils]: 8: Hoare triple {325#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {354#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:54,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {354#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {354#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:54,544 INFO L273 TraceCheckUtils]: 10: Hoare triple {354#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 268435455); {323#false} is VALID [2018-11-14 17:32:54,544 INFO L256 TraceCheckUtils]: 11: Hoare triple {323#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {323#false} is VALID [2018-11-14 17:32:54,544 INFO L273 TraceCheckUtils]: 12: Hoare triple {323#false} ~cond := #in~cond; {323#false} is VALID [2018-11-14 17:32:54,545 INFO L273 TraceCheckUtils]: 13: Hoare triple {323#false} assume ~cond == 0; {323#false} is VALID [2018-11-14 17:32:54,545 INFO L273 TraceCheckUtils]: 14: Hoare triple {323#false} assume !false; {323#false} is VALID [2018-11-14 17:32:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:54,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:54,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 17:32:54,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 17:32:54,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:54,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:32:54,607 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-14 17:32:54,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:32:54,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:32:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:32:54,608 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 6 states. [2018-11-14 17:32:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:54,759 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-14 17:32:54,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:32:54,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-14 17:32:54,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:32:54,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-14 17:32:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:32:54,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-14 17:32:54,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2018-11-14 17:32:54,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:54,803 INFO L225 Difference]: With dead ends: 23 [2018-11-14 17:32:54,803 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 17:32:54,804 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:32:54,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 17:32:54,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-14 17:32:54,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:54,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-14 17:32:54,866 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 17:32:54,866 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 17:32:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:54,867 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 17:32:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 17:32:54,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:54,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:54,869 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 17:32:54,869 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 17:32:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:54,870 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-14 17:32:54,871 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 17:32:54,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:54,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:54,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:54,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:54,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:32:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-14 17:32:54,873 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-14 17:32:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:54,873 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-14 17:32:54,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:32:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-14 17:32:54,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:32:54,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:54,875 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:54,875 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:54,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:54,875 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 3 times [2018-11-14 17:32:54,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:54,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:54,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:54,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:54,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:55,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2018-11-14 17:32:55,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-14 17:32:55,190 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {471#true} {471#true} #32#return; {471#true} is VALID [2018-11-14 17:32:55,191 INFO L256 TraceCheckUtils]: 3: Hoare triple {471#true} call #t~ret0 := main(); {471#true} is VALID [2018-11-14 17:32:55,192 INFO L273 TraceCheckUtils]: 4: Hoare triple {471#true} ~x~0 := 0; {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:55,192 INFO L273 TraceCheckUtils]: 5: Hoare triple {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:55,195 INFO L273 TraceCheckUtils]: 6: Hoare triple {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {474#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:55,196 INFO L273 TraceCheckUtils]: 7: Hoare triple {474#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {474#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:55,197 INFO L273 TraceCheckUtils]: 8: Hoare triple {474#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {475#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:55,198 INFO L273 TraceCheckUtils]: 9: Hoare triple {475#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {475#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:55,207 INFO L273 TraceCheckUtils]: 10: Hoare triple {475#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {476#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:55,207 INFO L273 TraceCheckUtils]: 11: Hoare triple {476#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {476#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:55,208 INFO L273 TraceCheckUtils]: 12: Hoare triple {476#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {472#false} is VALID [2018-11-14 17:32:55,208 INFO L256 TraceCheckUtils]: 13: Hoare triple {472#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {472#false} is VALID [2018-11-14 17:32:55,209 INFO L273 TraceCheckUtils]: 14: Hoare triple {472#false} ~cond := #in~cond; {472#false} is VALID [2018-11-14 17:32:55,209 INFO L273 TraceCheckUtils]: 15: Hoare triple {472#false} assume ~cond == 0; {472#false} is VALID [2018-11-14 17:32:55,209 INFO L273 TraceCheckUtils]: 16: Hoare triple {472#false} assume !false; {472#false} is VALID [2018-11-14 17:32:55,210 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:55,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:55,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:55,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:32:55,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 17:32:55,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:55,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:55,342 INFO L256 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2018-11-14 17:32:55,342 INFO L273 TraceCheckUtils]: 1: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-14 17:32:55,343 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {471#true} {471#true} #32#return; {471#true} is VALID [2018-11-14 17:32:55,343 INFO L256 TraceCheckUtils]: 3: Hoare triple {471#true} call #t~ret0 := main(); {471#true} is VALID [2018-11-14 17:32:55,345 INFO L273 TraceCheckUtils]: 4: Hoare triple {471#true} ~x~0 := 0; {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:55,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:55,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {474#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:55,350 INFO L273 TraceCheckUtils]: 7: Hoare triple {474#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {474#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:55,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {474#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {475#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:55,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {475#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {475#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:55,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {475#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {510#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:55,358 INFO L273 TraceCheckUtils]: 11: Hoare triple {510#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {510#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:55,359 INFO L273 TraceCheckUtils]: 12: Hoare triple {510#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {472#false} is VALID [2018-11-14 17:32:55,360 INFO L256 TraceCheckUtils]: 13: Hoare triple {472#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {472#false} is VALID [2018-11-14 17:32:55,360 INFO L273 TraceCheckUtils]: 14: Hoare triple {472#false} ~cond := #in~cond; {472#false} is VALID [2018-11-14 17:32:55,360 INFO L273 TraceCheckUtils]: 15: Hoare triple {472#false} assume ~cond == 0; {472#false} is VALID [2018-11-14 17:32:55,360 INFO L273 TraceCheckUtils]: 16: Hoare triple {472#false} assume !false; {472#false} is VALID [2018-11-14 17:32:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:55,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:55,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 17:32:55,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-14 17:32:55,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:55,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:32:55,417 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-14 17:32:55,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:32:55,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:32:55,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:32:55,419 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 7 states. [2018-11-14 17:32:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:55,633 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-14 17:32:55,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:32:55,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-14 17:32:55,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:32:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2018-11-14 17:32:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:32:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2018-11-14 17:32:55,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2018-11-14 17:32:55,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:55,690 INFO L225 Difference]: With dead ends: 25 [2018-11-14 17:32:55,690 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 17:32:55,691 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 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-14 17:32:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 17:32:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 17:32:55,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:55,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 17:32:55,709 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 17:32:55,709 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 17:32:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:55,711 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 17:32:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 17:32:55,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:55,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:55,713 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 17:32:55,713 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 17:32:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:55,714 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 17:32:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 17:32:55,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:55,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:55,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:55,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:32:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-14 17:32:55,717 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-14 17:32:55,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:55,718 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-14 17:32:55,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:32:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 17:32:55,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:32:55,719 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:55,719 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:55,719 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:55,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:55,719 INFO L82 PathProgramCache]: Analyzing trace with hash -873685328, now seen corresponding path program 4 times [2018-11-14 17:32:55,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:55,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:55,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:55,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:55,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:55,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {637#true} call ULTIMATE.init(); {637#true} is VALID [2018-11-14 17:32:55,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {637#true} assume true; {637#true} is VALID [2018-11-14 17:32:55,961 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {637#true} {637#true} #32#return; {637#true} is VALID [2018-11-14 17:32:55,961 INFO L256 TraceCheckUtils]: 3: Hoare triple {637#true} call #t~ret0 := main(); {637#true} is VALID [2018-11-14 17:32:55,962 INFO L273 TraceCheckUtils]: 4: Hoare triple {637#true} ~x~0 := 0; {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:55,963 INFO L273 TraceCheckUtils]: 5: Hoare triple {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:55,964 INFO L273 TraceCheckUtils]: 6: Hoare triple {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {640#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:55,965 INFO L273 TraceCheckUtils]: 7: Hoare triple {640#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {640#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:55,966 INFO L273 TraceCheckUtils]: 8: Hoare triple {640#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {641#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:55,966 INFO L273 TraceCheckUtils]: 9: Hoare triple {641#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {641#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:55,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {641#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {642#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:55,984 INFO L273 TraceCheckUtils]: 11: Hoare triple {642#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {642#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:55,985 INFO L273 TraceCheckUtils]: 12: Hoare triple {642#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {643#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:55,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {643#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {643#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:55,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {643#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {638#false} is VALID [2018-11-14 17:32:55,988 INFO L256 TraceCheckUtils]: 15: Hoare triple {638#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {638#false} is VALID [2018-11-14 17:32:55,989 INFO L273 TraceCheckUtils]: 16: Hoare triple {638#false} ~cond := #in~cond; {638#false} is VALID [2018-11-14 17:32:55,989 INFO L273 TraceCheckUtils]: 17: Hoare triple {638#false} assume ~cond == 0; {638#false} is VALID [2018-11-14 17:32:55,990 INFO L273 TraceCheckUtils]: 18: Hoare triple {638#false} assume !false; {638#false} is VALID [2018-11-14 17:32:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:55,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:55,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:56,003 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:32:56,014 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:32:56,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:56,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:56,211 INFO L256 TraceCheckUtils]: 0: Hoare triple {637#true} call ULTIMATE.init(); {637#true} is VALID [2018-11-14 17:32:56,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {637#true} assume true; {637#true} is VALID [2018-11-14 17:32:56,212 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {637#true} {637#true} #32#return; {637#true} is VALID [2018-11-14 17:32:56,213 INFO L256 TraceCheckUtils]: 3: Hoare triple {637#true} call #t~ret0 := main(); {637#true} is VALID [2018-11-14 17:32:56,214 INFO L273 TraceCheckUtils]: 4: Hoare triple {637#true} ~x~0 := 0; {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:56,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:56,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {639#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {640#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:56,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {640#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {640#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:56,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {640#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {641#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:56,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {641#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {641#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:56,220 INFO L273 TraceCheckUtils]: 10: Hoare triple {641#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {642#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:56,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {642#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {642#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:56,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {642#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {683#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:56,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {683#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {683#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:56,224 INFO L273 TraceCheckUtils]: 14: Hoare triple {683#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 268435455); {638#false} is VALID [2018-11-14 17:32:56,224 INFO L256 TraceCheckUtils]: 15: Hoare triple {638#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {638#false} is VALID [2018-11-14 17:32:56,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {638#false} ~cond := #in~cond; {638#false} is VALID [2018-11-14 17:32:56,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {638#false} assume ~cond == 0; {638#false} is VALID [2018-11-14 17:32:56,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {638#false} assume !false; {638#false} is VALID [2018-11-14 17:32:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:56,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:56,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 17:32:56,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 17:32:56,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:56,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:32:56,291 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-14 17:32:56,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:32:56,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:32:56,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:32:56,292 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2018-11-14 17:32:56,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:56,555 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 17:32:56,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:32:56,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 17:32:56,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:32:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-11-14 17:32:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:32:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-11-14 17:32:56,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2018-11-14 17:32:56,714 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-14 17:32:56,715 INFO L225 Difference]: With dead ends: 27 [2018-11-14 17:32:56,715 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 17:32:56,716 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:32:56,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 17:32:56,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 17:32:56,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:56,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 17:32:56,734 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:32:56,735 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:32:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:56,737 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 17:32:56,738 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 17:32:56,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:56,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:56,738 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:32:56,739 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:32:56,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:56,740 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 17:32:56,740 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 17:32:56,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:56,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:56,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:56,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:32:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-14 17:32:56,743 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-14 17:32:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:56,743 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-14 17:32:56,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:32:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 17:32:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:32:56,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:56,744 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:56,745 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:56,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:56,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 5 times [2018-11-14 17:32:56,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:56,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:56,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:56,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:56,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:57,056 INFO L256 TraceCheckUtils]: 0: Hoare triple {820#true} call ULTIMATE.init(); {820#true} is VALID [2018-11-14 17:32:57,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {820#true} assume true; {820#true} is VALID [2018-11-14 17:32:57,057 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {820#true} {820#true} #32#return; {820#true} is VALID [2018-11-14 17:32:57,058 INFO L256 TraceCheckUtils]: 3: Hoare triple {820#true} call #t~ret0 := main(); {820#true} is VALID [2018-11-14 17:32:57,059 INFO L273 TraceCheckUtils]: 4: Hoare triple {820#true} ~x~0 := 0; {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:57,059 INFO L273 TraceCheckUtils]: 5: Hoare triple {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:57,060 INFO L273 TraceCheckUtils]: 6: Hoare triple {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:57,061 INFO L273 TraceCheckUtils]: 7: Hoare triple {823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:57,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {824#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:57,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {824#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {824#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:57,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {824#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {825#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:57,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {825#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {825#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:57,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {825#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {826#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:57,066 INFO L273 TraceCheckUtils]: 13: Hoare triple {826#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {826#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:57,068 INFO L273 TraceCheckUtils]: 14: Hoare triple {826#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {827#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:57,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {827#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {827#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:57,070 INFO L273 TraceCheckUtils]: 16: Hoare triple {827#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {821#false} is VALID [2018-11-14 17:32:57,070 INFO L256 TraceCheckUtils]: 17: Hoare triple {821#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {821#false} is VALID [2018-11-14 17:32:57,070 INFO L273 TraceCheckUtils]: 18: Hoare triple {821#false} ~cond := #in~cond; {821#false} is VALID [2018-11-14 17:32:57,071 INFO L273 TraceCheckUtils]: 19: Hoare triple {821#false} assume ~cond == 0; {821#false} is VALID [2018-11-14 17:32:57,071 INFO L273 TraceCheckUtils]: 20: Hoare triple {821#false} assume !false; {821#false} is VALID [2018-11-14 17:32:57,073 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:57,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:57,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:57,082 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:32:57,096 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 17:32:57,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:57,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:57,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {820#true} call ULTIMATE.init(); {820#true} is VALID [2018-11-14 17:32:57,210 INFO L273 TraceCheckUtils]: 1: Hoare triple {820#true} assume true; {820#true} is VALID [2018-11-14 17:32:57,210 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {820#true} {820#true} #32#return; {820#true} is VALID [2018-11-14 17:32:57,211 INFO L256 TraceCheckUtils]: 3: Hoare triple {820#true} call #t~ret0 := main(); {820#true} is VALID [2018-11-14 17:32:57,213 INFO L273 TraceCheckUtils]: 4: Hoare triple {820#true} ~x~0 := 0; {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:57,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:57,214 INFO L273 TraceCheckUtils]: 6: Hoare triple {822#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:57,215 INFO L273 TraceCheckUtils]: 7: Hoare triple {823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:57,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {824#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:57,216 INFO L273 TraceCheckUtils]: 9: Hoare triple {824#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {824#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:57,217 INFO L273 TraceCheckUtils]: 10: Hoare triple {824#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {825#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:57,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {825#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {825#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:57,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {825#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {826#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:57,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {826#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {826#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:57,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {826#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {873#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:57,222 INFO L273 TraceCheckUtils]: 15: Hoare triple {873#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {873#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:57,224 INFO L273 TraceCheckUtils]: 16: Hoare triple {873#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {821#false} is VALID [2018-11-14 17:32:57,224 INFO L256 TraceCheckUtils]: 17: Hoare triple {821#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {821#false} is VALID [2018-11-14 17:32:57,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {821#false} ~cond := #in~cond; {821#false} is VALID [2018-11-14 17:32:57,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {821#false} assume ~cond == 0; {821#false} is VALID [2018-11-14 17:32:57,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {821#false} assume !false; {821#false} is VALID [2018-11-14 17:32:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:57,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:57,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 17:32:57,249 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-14 17:32:57,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:57,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:32:57,281 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-14 17:32:57,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:32:57,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:32:57,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:32:57,282 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 9 states. [2018-11-14 17:32:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:57,557 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-14 17:32:57,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:32:57,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-14 17:32:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:32:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-11-14 17:32:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:32:57,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-11-14 17:32:57,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2018-11-14 17:32:57,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:57,599 INFO L225 Difference]: With dead ends: 29 [2018-11-14 17:32:57,599 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 17:32:57,600 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 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-14 17:32:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 17:32:57,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 17:32:57,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:57,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 17:32:57,640 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 17:32:57,640 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 17:32:57,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:57,641 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 17:32:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 17:32:57,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:57,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:57,642 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 17:32:57,643 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 17:32:57,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:57,644 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-14 17:32:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 17:32:57,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:57,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:57,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:57,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:32:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-14 17:32:57,647 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-11-14 17:32:57,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:57,648 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-14 17:32:57,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:32:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-14 17:32:57,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 17:32:57,649 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:57,649 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:57,649 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:57,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:57,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1908287044, now seen corresponding path program 6 times [2018-11-14 17:32:57,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:57,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:57,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:57,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:57,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:58,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {1020#true} call ULTIMATE.init(); {1020#true} is VALID [2018-11-14 17:32:58,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {1020#true} assume true; {1020#true} is VALID [2018-11-14 17:32:58,604 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1020#true} {1020#true} #32#return; {1020#true} is VALID [2018-11-14 17:32:58,605 INFO L256 TraceCheckUtils]: 3: Hoare triple {1020#true} call #t~ret0 := main(); {1020#true} is VALID [2018-11-14 17:32:58,605 INFO L273 TraceCheckUtils]: 4: Hoare triple {1020#true} ~x~0 := 0; {1022#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:58,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {1022#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1022#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:58,607 INFO L273 TraceCheckUtils]: 6: Hoare triple {1022#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1023#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:58,607 INFO L273 TraceCheckUtils]: 7: Hoare triple {1023#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1023#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:58,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {1023#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1024#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:58,609 INFO L273 TraceCheckUtils]: 9: Hoare triple {1024#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1024#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:58,611 INFO L273 TraceCheckUtils]: 10: Hoare triple {1024#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1025#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:58,612 INFO L273 TraceCheckUtils]: 11: Hoare triple {1025#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1025#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:58,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {1025#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1026#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:58,619 INFO L273 TraceCheckUtils]: 13: Hoare triple {1026#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1026#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:58,620 INFO L273 TraceCheckUtils]: 14: Hoare triple {1026#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:58,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {1027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:58,621 INFO L273 TraceCheckUtils]: 16: Hoare triple {1027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1028#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:58,626 INFO L273 TraceCheckUtils]: 17: Hoare triple {1028#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1028#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:58,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {1028#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1021#false} is VALID [2018-11-14 17:32:58,628 INFO L256 TraceCheckUtils]: 19: Hoare triple {1021#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1021#false} is VALID [2018-11-14 17:32:58,628 INFO L273 TraceCheckUtils]: 20: Hoare triple {1021#false} ~cond := #in~cond; {1021#false} is VALID [2018-11-14 17:32:58,628 INFO L273 TraceCheckUtils]: 21: Hoare triple {1021#false} assume ~cond == 0; {1021#false} is VALID [2018-11-14 17:32:58,628 INFO L273 TraceCheckUtils]: 22: Hoare triple {1021#false} assume !false; {1021#false} is VALID [2018-11-14 17:32:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:58,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:58,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:58,639 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:32:58,656 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 17:32:58,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:32:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:58,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:58,818 INFO L256 TraceCheckUtils]: 0: Hoare triple {1020#true} call ULTIMATE.init(); {1020#true} is VALID [2018-11-14 17:32:58,818 INFO L273 TraceCheckUtils]: 1: Hoare triple {1020#true} assume true; {1020#true} is VALID [2018-11-14 17:32:58,818 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1020#true} {1020#true} #32#return; {1020#true} is VALID [2018-11-14 17:32:58,818 INFO L256 TraceCheckUtils]: 3: Hoare triple {1020#true} call #t~ret0 := main(); {1020#true} is VALID [2018-11-14 17:32:58,819 INFO L273 TraceCheckUtils]: 4: Hoare triple {1020#true} ~x~0 := 0; {1022#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:58,819 INFO L273 TraceCheckUtils]: 5: Hoare triple {1022#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1022#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:58,822 INFO L273 TraceCheckUtils]: 6: Hoare triple {1022#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1023#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:58,825 INFO L273 TraceCheckUtils]: 7: Hoare triple {1023#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1023#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:58,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {1023#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1024#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:58,831 INFO L273 TraceCheckUtils]: 9: Hoare triple {1024#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1024#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:58,831 INFO L273 TraceCheckUtils]: 10: Hoare triple {1024#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1025#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:58,833 INFO L273 TraceCheckUtils]: 11: Hoare triple {1025#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1025#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:58,833 INFO L273 TraceCheckUtils]: 12: Hoare triple {1025#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1026#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:58,835 INFO L273 TraceCheckUtils]: 13: Hoare triple {1026#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1026#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:58,835 INFO L273 TraceCheckUtils]: 14: Hoare triple {1026#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:58,837 INFO L273 TraceCheckUtils]: 15: Hoare triple {1027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:58,839 INFO L273 TraceCheckUtils]: 16: Hoare triple {1027#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1080#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:58,840 INFO L273 TraceCheckUtils]: 17: Hoare triple {1080#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1080#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:58,840 INFO L273 TraceCheckUtils]: 18: Hoare triple {1080#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1021#false} is VALID [2018-11-14 17:32:58,840 INFO L256 TraceCheckUtils]: 19: Hoare triple {1021#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1021#false} is VALID [2018-11-14 17:32:58,841 INFO L273 TraceCheckUtils]: 20: Hoare triple {1021#false} ~cond := #in~cond; {1021#false} is VALID [2018-11-14 17:32:58,841 INFO L273 TraceCheckUtils]: 21: Hoare triple {1021#false} assume ~cond == 0; {1021#false} is VALID [2018-11-14 17:32:58,841 INFO L273 TraceCheckUtils]: 22: Hoare triple {1021#false} assume !false; {1021#false} is VALID [2018-11-14 17:32:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:58,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:58,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 17:32:58,862 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-14 17:32:58,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:58,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:32:58,890 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-14 17:32:58,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:32:58,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:32:58,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:32:58,891 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 10 states. [2018-11-14 17:32:59,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:59,184 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-14 17:32:59,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 17:32:59,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-11-14 17:32:59,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:32:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:32:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2018-11-14 17:32:59,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:32:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2018-11-14 17:32:59,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 31 transitions. [2018-11-14 17:32:59,221 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-14 17:32:59,223 INFO L225 Difference]: With dead ends: 31 [2018-11-14 17:32:59,223 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 17:32:59,224 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:32:59,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 17:32:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-14 17:32:59,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:32:59,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-14 17:32:59,241 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 17:32:59,241 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 17:32:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:59,244 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-14 17:32:59,244 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 17:32:59,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:59,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:59,245 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 17:32:59,245 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 17:32:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:32:59,246 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-14 17:32:59,247 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 17:32:59,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:32:59,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:32:59,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:32:59,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:32:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:32:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-14 17:32:59,249 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-11-14 17:32:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:32:59,249 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-14 17:32:59,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:32:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-14 17:32:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:32:59,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:32:59,251 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:32:59,251 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:32:59,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:32:59,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1082171650, now seen corresponding path program 7 times [2018-11-14 17:32:59,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:32:59,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:32:59,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:59,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:32:59,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:32:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:59,564 INFO L256 TraceCheckUtils]: 0: Hoare triple {1237#true} call ULTIMATE.init(); {1237#true} is VALID [2018-11-14 17:32:59,565 INFO L273 TraceCheckUtils]: 1: Hoare triple {1237#true} assume true; {1237#true} is VALID [2018-11-14 17:32:59,565 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1237#true} {1237#true} #32#return; {1237#true} is VALID [2018-11-14 17:32:59,566 INFO L256 TraceCheckUtils]: 3: Hoare triple {1237#true} call #t~ret0 := main(); {1237#true} is VALID [2018-11-14 17:32:59,566 INFO L273 TraceCheckUtils]: 4: Hoare triple {1237#true} ~x~0 := 0; {1239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:59,567 INFO L273 TraceCheckUtils]: 5: Hoare triple {1239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:59,568 INFO L273 TraceCheckUtils]: 6: Hoare triple {1239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1240#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:59,568 INFO L273 TraceCheckUtils]: 7: Hoare triple {1240#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1240#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:59,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {1240#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1241#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:59,569 INFO L273 TraceCheckUtils]: 9: Hoare triple {1241#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1241#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:59,570 INFO L273 TraceCheckUtils]: 10: Hoare triple {1241#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1242#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:59,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {1242#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1242#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:59,574 INFO L273 TraceCheckUtils]: 12: Hoare triple {1242#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1243#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:59,575 INFO L273 TraceCheckUtils]: 13: Hoare triple {1243#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1243#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:59,576 INFO L273 TraceCheckUtils]: 14: Hoare triple {1243#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1244#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:59,576 INFO L273 TraceCheckUtils]: 15: Hoare triple {1244#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1244#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:59,577 INFO L273 TraceCheckUtils]: 16: Hoare triple {1244#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1245#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:59,581 INFO L273 TraceCheckUtils]: 17: Hoare triple {1245#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1245#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:59,584 INFO L273 TraceCheckUtils]: 18: Hoare triple {1245#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1246#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:59,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {1246#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1246#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:32:59,587 INFO L273 TraceCheckUtils]: 20: Hoare triple {1246#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1238#false} is VALID [2018-11-14 17:32:59,587 INFO L256 TraceCheckUtils]: 21: Hoare triple {1238#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1238#false} is VALID [2018-11-14 17:32:59,587 INFO L273 TraceCheckUtils]: 22: Hoare triple {1238#false} ~cond := #in~cond; {1238#false} is VALID [2018-11-14 17:32:59,588 INFO L273 TraceCheckUtils]: 23: Hoare triple {1238#false} assume ~cond == 0; {1238#false} is VALID [2018-11-14 17:32:59,588 INFO L273 TraceCheckUtils]: 24: Hoare triple {1238#false} assume !false; {1238#false} is VALID [2018-11-14 17:32:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:59,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:32:59,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:32:59,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:32:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:32:59,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:32:59,767 INFO L256 TraceCheckUtils]: 0: Hoare triple {1237#true} call ULTIMATE.init(); {1237#true} is VALID [2018-11-14 17:32:59,767 INFO L273 TraceCheckUtils]: 1: Hoare triple {1237#true} assume true; {1237#true} is VALID [2018-11-14 17:32:59,768 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1237#true} {1237#true} #32#return; {1237#true} is VALID [2018-11-14 17:32:59,768 INFO L256 TraceCheckUtils]: 3: Hoare triple {1237#true} call #t~ret0 := main(); {1237#true} is VALID [2018-11-14 17:32:59,769 INFO L273 TraceCheckUtils]: 4: Hoare triple {1237#true} ~x~0 := 0; {1239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:59,769 INFO L273 TraceCheckUtils]: 5: Hoare triple {1239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:32:59,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {1239#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1240#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:59,770 INFO L273 TraceCheckUtils]: 7: Hoare triple {1240#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1240#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:32:59,771 INFO L273 TraceCheckUtils]: 8: Hoare triple {1240#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1241#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:59,772 INFO L273 TraceCheckUtils]: 9: Hoare triple {1241#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1241#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:32:59,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {1241#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1242#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:59,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {1242#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1242#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:32:59,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {1242#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1243#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:59,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {1243#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1243#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:32:59,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {1243#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1244#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:59,778 INFO L273 TraceCheckUtils]: 15: Hoare triple {1244#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1244#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:32:59,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {1244#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1245#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:59,780 INFO L273 TraceCheckUtils]: 17: Hoare triple {1245#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1245#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:32:59,781 INFO L273 TraceCheckUtils]: 18: Hoare triple {1245#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1304#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:32:59,782 INFO L273 TraceCheckUtils]: 19: Hoare triple {1304#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1304#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:32:59,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {1304#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1238#false} is VALID [2018-11-14 17:32:59,783 INFO L256 TraceCheckUtils]: 21: Hoare triple {1238#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1238#false} is VALID [2018-11-14 17:32:59,783 INFO L273 TraceCheckUtils]: 22: Hoare triple {1238#false} ~cond := #in~cond; {1238#false} is VALID [2018-11-14 17:32:59,784 INFO L273 TraceCheckUtils]: 23: Hoare triple {1238#false} assume ~cond == 0; {1238#false} is VALID [2018-11-14 17:32:59,784 INFO L273 TraceCheckUtils]: 24: Hoare triple {1238#false} assume !false; {1238#false} is VALID [2018-11-14 17:32:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:32:59,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:32:59,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 17:32:59,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-11-14 17:32:59,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:32:59,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:32:59,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:32:59,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:32:59,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:32:59,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:32:59,837 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 11 states. [2018-11-14 17:33:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:00,370 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-14 17:33:00,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:33:00,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-11-14 17:33:00,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:33:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2018-11-14 17:33:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:33:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2018-11-14 17:33:00,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2018-11-14 17:33:00,538 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-14 17:33:00,538 INFO L225 Difference]: With dead ends: 33 [2018-11-14 17:33:00,539 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 17:33:00,539 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 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-14 17:33:00,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 17:33:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 17:33:00,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:00,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 17:33:00,561 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 17:33:00,561 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 17:33:00,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:00,563 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 17:33:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:33:00,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:00,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:00,563 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 17:33:00,563 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 17:33:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:00,565 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-14 17:33:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:33:00,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:00,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:00,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:00,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:00,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:33:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-14 17:33:00,567 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-11-14 17:33:00,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:00,567 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-14 17:33:00,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:33:00,568 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-14 17:33:00,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:33:00,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:00,568 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:00,569 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:00,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:00,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1579855560, now seen corresponding path program 8 times [2018-11-14 17:33:00,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:00,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:00,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:00,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:33:00,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:01,170 INFO L256 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2018-11-14 17:33:01,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {1471#true} assume true; {1471#true} is VALID [2018-11-14 17:33:01,171 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1471#true} {1471#true} #32#return; {1471#true} is VALID [2018-11-14 17:33:01,171 INFO L256 TraceCheckUtils]: 3: Hoare triple {1471#true} call #t~ret0 := main(); {1471#true} is VALID [2018-11-14 17:33:01,172 INFO L273 TraceCheckUtils]: 4: Hoare triple {1471#true} ~x~0 := 0; {1473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:01,172 INFO L273 TraceCheckUtils]: 5: Hoare triple {1473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:01,173 INFO L273 TraceCheckUtils]: 6: Hoare triple {1473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1474#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:01,173 INFO L273 TraceCheckUtils]: 7: Hoare triple {1474#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1474#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:01,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {1474#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1475#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:01,174 INFO L273 TraceCheckUtils]: 9: Hoare triple {1475#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1475#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:01,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {1475#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1476#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:01,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {1476#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1476#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:01,177 INFO L273 TraceCheckUtils]: 12: Hoare triple {1476#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1477#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:01,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {1477#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1477#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:01,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {1477#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1478#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:01,197 INFO L273 TraceCheckUtils]: 15: Hoare triple {1478#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1478#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:01,211 INFO L273 TraceCheckUtils]: 16: Hoare triple {1478#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1479#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:01,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {1479#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1479#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:01,240 INFO L273 TraceCheckUtils]: 18: Hoare triple {1479#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:01,252 INFO L273 TraceCheckUtils]: 19: Hoare triple {1480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:01,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {1480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1481#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:33:01,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {1481#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1481#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:33:01,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {1481#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1472#false} is VALID [2018-11-14 17:33:01,256 INFO L256 TraceCheckUtils]: 23: Hoare triple {1472#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1472#false} is VALID [2018-11-14 17:33:01,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {1472#false} ~cond := #in~cond; {1472#false} is VALID [2018-11-14 17:33:01,256 INFO L273 TraceCheckUtils]: 25: Hoare triple {1472#false} assume ~cond == 0; {1472#false} is VALID [2018-11-14 17:33:01,256 INFO L273 TraceCheckUtils]: 26: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2018-11-14 17:33:01,259 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:01,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:01,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:01,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:33:01,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:33:01,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:33:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:01,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:01,445 INFO L256 TraceCheckUtils]: 0: Hoare triple {1471#true} call ULTIMATE.init(); {1471#true} is VALID [2018-11-14 17:33:01,445 INFO L273 TraceCheckUtils]: 1: Hoare triple {1471#true} assume true; {1471#true} is VALID [2018-11-14 17:33:01,446 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1471#true} {1471#true} #32#return; {1471#true} is VALID [2018-11-14 17:33:01,446 INFO L256 TraceCheckUtils]: 3: Hoare triple {1471#true} call #t~ret0 := main(); {1471#true} is VALID [2018-11-14 17:33:01,446 INFO L273 TraceCheckUtils]: 4: Hoare triple {1471#true} ~x~0 := 0; {1473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:01,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {1473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:01,447 INFO L273 TraceCheckUtils]: 6: Hoare triple {1473#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1474#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:01,448 INFO L273 TraceCheckUtils]: 7: Hoare triple {1474#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1474#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:01,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {1474#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1475#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:01,449 INFO L273 TraceCheckUtils]: 9: Hoare triple {1475#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1475#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:01,449 INFO L273 TraceCheckUtils]: 10: Hoare triple {1475#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1476#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:01,450 INFO L273 TraceCheckUtils]: 11: Hoare triple {1476#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1476#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:01,451 INFO L273 TraceCheckUtils]: 12: Hoare triple {1476#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1477#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:01,453 INFO L273 TraceCheckUtils]: 13: Hoare triple {1477#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1477#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:01,455 INFO L273 TraceCheckUtils]: 14: Hoare triple {1477#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1478#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:01,455 INFO L273 TraceCheckUtils]: 15: Hoare triple {1478#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1478#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:01,456 INFO L273 TraceCheckUtils]: 16: Hoare triple {1478#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1479#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:01,456 INFO L273 TraceCheckUtils]: 17: Hoare triple {1479#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1479#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:01,457 INFO L273 TraceCheckUtils]: 18: Hoare triple {1479#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:01,457 INFO L273 TraceCheckUtils]: 19: Hoare triple {1480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:01,459 INFO L273 TraceCheckUtils]: 20: Hoare triple {1480#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1545#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:33:01,459 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {1545#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:33:01,460 INFO L273 TraceCheckUtils]: 22: Hoare triple {1545#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1472#false} is VALID [2018-11-14 17:33:01,460 INFO L256 TraceCheckUtils]: 23: Hoare triple {1472#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1472#false} is VALID [2018-11-14 17:33:01,461 INFO L273 TraceCheckUtils]: 24: Hoare triple {1472#false} ~cond := #in~cond; {1472#false} is VALID [2018-11-14 17:33:01,461 INFO L273 TraceCheckUtils]: 25: Hoare triple {1472#false} assume ~cond == 0; {1472#false} is VALID [2018-11-14 17:33:01,461 INFO L273 TraceCheckUtils]: 26: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2018-11-14 17:33:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:01,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:01,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 17:33:01,485 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-14 17:33:01,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:01,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:33:01,522 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-14 17:33:01,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:33:01,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:33:01,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:33:01,523 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 12 states. [2018-11-14 17:33:02,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:02,085 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-14 17:33:02,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:33:02,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-14 17:33:02,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:33:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2018-11-14 17:33:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:33:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 35 transitions. [2018-11-14 17:33:02,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 35 transitions. [2018-11-14 17:33:02,166 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-14 17:33:02,167 INFO L225 Difference]: With dead ends: 35 [2018-11-14 17:33:02,167 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 17:33:02,168 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:33:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 17:33:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-14 17:33:02,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:02,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-14 17:33:02,188 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-14 17:33:02,188 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-14 17:33:02,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:02,192 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 17:33:02,192 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 17:33:02,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:02,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:02,192 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-14 17:33:02,193 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-14 17:33:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:02,194 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-14 17:33:02,195 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 17:33:02,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:02,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:02,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:02,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:33:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-14 17:33:02,197 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-11-14 17:33:02,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:02,197 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-14 17:33:02,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:33:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-14 17:33:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 17:33:02,197 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:02,198 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:02,198 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:02,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:02,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1182244082, now seen corresponding path program 9 times [2018-11-14 17:33:02,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:02,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:02,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:02,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:33:02,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:02,814 INFO L256 TraceCheckUtils]: 0: Hoare triple {1722#true} call ULTIMATE.init(); {1722#true} is VALID [2018-11-14 17:33:02,814 INFO L273 TraceCheckUtils]: 1: Hoare triple {1722#true} assume true; {1722#true} is VALID [2018-11-14 17:33:02,815 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1722#true} {1722#true} #32#return; {1722#true} is VALID [2018-11-14 17:33:02,815 INFO L256 TraceCheckUtils]: 3: Hoare triple {1722#true} call #t~ret0 := main(); {1722#true} is VALID [2018-11-14 17:33:02,816 INFO L273 TraceCheckUtils]: 4: Hoare triple {1722#true} ~x~0 := 0; {1724#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:02,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {1724#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1724#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:02,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {1724#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1725#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:02,818 INFO L273 TraceCheckUtils]: 7: Hoare triple {1725#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1725#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:02,818 INFO L273 TraceCheckUtils]: 8: Hoare triple {1725#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1726#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:02,819 INFO L273 TraceCheckUtils]: 9: Hoare triple {1726#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1726#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:02,819 INFO L273 TraceCheckUtils]: 10: Hoare triple {1726#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1727#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:02,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {1727#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1727#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:02,821 INFO L273 TraceCheckUtils]: 12: Hoare triple {1727#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1728#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:02,822 INFO L273 TraceCheckUtils]: 13: Hoare triple {1728#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1728#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:02,823 INFO L273 TraceCheckUtils]: 14: Hoare triple {1728#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1729#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:02,823 INFO L273 TraceCheckUtils]: 15: Hoare triple {1729#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1729#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:02,824 INFO L273 TraceCheckUtils]: 16: Hoare triple {1729#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1730#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:02,825 INFO L273 TraceCheckUtils]: 17: Hoare triple {1730#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1730#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:02,826 INFO L273 TraceCheckUtils]: 18: Hoare triple {1730#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1731#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:02,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {1731#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1731#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:02,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {1731#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1732#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:33:02,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {1732#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {1732#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:33:02,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {1732#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1733#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:33:02,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {1733#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {1733#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:33:02,831 INFO L273 TraceCheckUtils]: 24: Hoare triple {1733#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1723#false} is VALID [2018-11-14 17:33:02,831 INFO L256 TraceCheckUtils]: 25: Hoare triple {1723#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1723#false} is VALID [2018-11-14 17:33:02,831 INFO L273 TraceCheckUtils]: 26: Hoare triple {1723#false} ~cond := #in~cond; {1723#false} is VALID [2018-11-14 17:33:02,832 INFO L273 TraceCheckUtils]: 27: Hoare triple {1723#false} assume ~cond == 0; {1723#false} is VALID [2018-11-14 17:33:02,832 INFO L273 TraceCheckUtils]: 28: Hoare triple {1723#false} assume !false; {1723#false} is VALID [2018-11-14 17:33:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:02,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:02,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:33:02,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:33:16,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 17:33:16,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:33:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:16,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:16,452 INFO L256 TraceCheckUtils]: 0: Hoare triple {1722#true} call ULTIMATE.init(); {1722#true} is VALID [2018-11-14 17:33:16,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {1722#true} assume true; {1722#true} is VALID [2018-11-14 17:33:16,452 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1722#true} {1722#true} #32#return; {1722#true} is VALID [2018-11-14 17:33:16,452 INFO L256 TraceCheckUtils]: 3: Hoare triple {1722#true} call #t~ret0 := main(); {1722#true} is VALID [2018-11-14 17:33:16,453 INFO L273 TraceCheckUtils]: 4: Hoare triple {1722#true} ~x~0 := 0; {1724#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:16,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {1724#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1724#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:16,460 INFO L273 TraceCheckUtils]: 6: Hoare triple {1724#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1725#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:16,462 INFO L273 TraceCheckUtils]: 7: Hoare triple {1725#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1725#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:16,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {1725#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1726#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:16,463 INFO L273 TraceCheckUtils]: 9: Hoare triple {1726#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1726#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:16,463 INFO L273 TraceCheckUtils]: 10: Hoare triple {1726#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1727#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:16,464 INFO L273 TraceCheckUtils]: 11: Hoare triple {1727#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1727#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:16,464 INFO L273 TraceCheckUtils]: 12: Hoare triple {1727#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1728#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:16,465 INFO L273 TraceCheckUtils]: 13: Hoare triple {1728#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1728#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:16,469 INFO L273 TraceCheckUtils]: 14: Hoare triple {1728#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1729#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:16,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {1729#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1729#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:16,470 INFO L273 TraceCheckUtils]: 16: Hoare triple {1729#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1730#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:16,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {1730#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1730#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:16,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {1730#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1731#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:16,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {1731#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1731#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:16,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {1731#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1732#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:33:16,473 INFO L273 TraceCheckUtils]: 21: Hoare triple {1732#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {1732#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:33:16,474 INFO L273 TraceCheckUtils]: 22: Hoare triple {1732#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1803#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:33:16,474 INFO L273 TraceCheckUtils]: 23: Hoare triple {1803#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {1803#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:33:16,475 INFO L273 TraceCheckUtils]: 24: Hoare triple {1803#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1723#false} is VALID [2018-11-14 17:33:16,476 INFO L256 TraceCheckUtils]: 25: Hoare triple {1723#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1723#false} is VALID [2018-11-14 17:33:16,476 INFO L273 TraceCheckUtils]: 26: Hoare triple {1723#false} ~cond := #in~cond; {1723#false} is VALID [2018-11-14 17:33:16,476 INFO L273 TraceCheckUtils]: 27: Hoare triple {1723#false} assume ~cond == 0; {1723#false} is VALID [2018-11-14 17:33:16,476 INFO L273 TraceCheckUtils]: 28: Hoare triple {1723#false} assume !false; {1723#false} is VALID [2018-11-14 17:33:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:16,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:16,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 17:33:16,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-14 17:33:16,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:16,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 17:33:16,529 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-14 17:33:16,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 17:33:16,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 17:33:16,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:33:16,530 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 13 states. [2018-11-14 17:33:16,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:16,971 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-14 17:33:16,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:33:16,971 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-14 17:33:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:33:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 37 transitions. [2018-11-14 17:33:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:33:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 37 transitions. [2018-11-14 17:33:16,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 37 transitions. [2018-11-14 17:33:17,007 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-14 17:33:17,009 INFO L225 Difference]: With dead ends: 37 [2018-11-14 17:33:17,009 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:33:17,010 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:33:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:33:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-14 17:33:17,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:17,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-14 17:33:17,040 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 17:33:17,040 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 17:33:17,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:17,042 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-14 17:33:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-14 17:33:17,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:17,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:17,042 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 17:33:17,043 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 17:33:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:17,044 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-14 17:33:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-14 17:33:17,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:17,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:17,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:17,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:17,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:33:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-14 17:33:17,046 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-11-14 17:33:17,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:17,046 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-14 17:33:17,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 17:33:17,046 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-14 17:33:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:33:17,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:17,047 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:17,047 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:17,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:17,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1270211116, now seen corresponding path program 10 times [2018-11-14 17:33:17,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:17,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:17,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:17,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:33:17,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:17,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {1990#true} call ULTIMATE.init(); {1990#true} is VALID [2018-11-14 17:33:17,723 INFO L273 TraceCheckUtils]: 1: Hoare triple {1990#true} assume true; {1990#true} is VALID [2018-11-14 17:33:17,723 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1990#true} {1990#true} #32#return; {1990#true} is VALID [2018-11-14 17:33:17,723 INFO L256 TraceCheckUtils]: 3: Hoare triple {1990#true} call #t~ret0 := main(); {1990#true} is VALID [2018-11-14 17:33:17,724 INFO L273 TraceCheckUtils]: 4: Hoare triple {1990#true} ~x~0 := 0; {1992#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:17,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {1992#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1992#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:17,725 INFO L273 TraceCheckUtils]: 6: Hoare triple {1992#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1993#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:17,725 INFO L273 TraceCheckUtils]: 7: Hoare triple {1993#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1993#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:17,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {1993#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1994#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:17,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {1994#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1994#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:17,728 INFO L273 TraceCheckUtils]: 10: Hoare triple {1994#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1995#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:17,728 INFO L273 TraceCheckUtils]: 11: Hoare triple {1995#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1995#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:17,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {1995#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1996#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:17,730 INFO L273 TraceCheckUtils]: 13: Hoare triple {1996#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1996#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:17,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {1996#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1997#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:17,732 INFO L273 TraceCheckUtils]: 15: Hoare triple {1997#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1997#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:17,738 INFO L273 TraceCheckUtils]: 16: Hoare triple {1997#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1998#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:17,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {1998#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1998#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:17,740 INFO L273 TraceCheckUtils]: 18: Hoare triple {1998#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1999#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:17,740 INFO L273 TraceCheckUtils]: 19: Hoare triple {1999#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1999#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:17,741 INFO L273 TraceCheckUtils]: 20: Hoare triple {1999#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2000#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:33:17,741 INFO L273 TraceCheckUtils]: 21: Hoare triple {2000#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2000#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:33:17,742 INFO L273 TraceCheckUtils]: 22: Hoare triple {2000#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2001#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:33:17,742 INFO L273 TraceCheckUtils]: 23: Hoare triple {2001#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {2001#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:33:17,743 INFO L273 TraceCheckUtils]: 24: Hoare triple {2001#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2002#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} is VALID [2018-11-14 17:33:17,744 INFO L273 TraceCheckUtils]: 25: Hoare triple {2002#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} assume true; {2002#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} is VALID [2018-11-14 17:33:17,745 INFO L273 TraceCheckUtils]: 26: Hoare triple {2002#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 268435455); {1991#false} is VALID [2018-11-14 17:33:17,745 INFO L256 TraceCheckUtils]: 27: Hoare triple {1991#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1991#false} is VALID [2018-11-14 17:33:17,745 INFO L273 TraceCheckUtils]: 28: Hoare triple {1991#false} ~cond := #in~cond; {1991#false} is VALID [2018-11-14 17:33:17,745 INFO L273 TraceCheckUtils]: 29: Hoare triple {1991#false} assume ~cond == 0; {1991#false} is VALID [2018-11-14 17:33:17,746 INFO L273 TraceCheckUtils]: 30: Hoare triple {1991#false} assume !false; {1991#false} is VALID [2018-11-14 17:33:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:17,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:17,748 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-14 17:33:17,757 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:33:17,774 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:33:17,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:33:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:17,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:33:17,894 INFO L256 TraceCheckUtils]: 0: Hoare triple {1990#true} call ULTIMATE.init(); {1990#true} is VALID [2018-11-14 17:33:17,894 INFO L273 TraceCheckUtils]: 1: Hoare triple {1990#true} assume true; {1990#true} is VALID [2018-11-14 17:33:17,894 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1990#true} {1990#true} #32#return; {1990#true} is VALID [2018-11-14 17:33:17,894 INFO L256 TraceCheckUtils]: 3: Hoare triple {1990#true} call #t~ret0 := main(); {1990#true} is VALID [2018-11-14 17:33:17,895 INFO L273 TraceCheckUtils]: 4: Hoare triple {1990#true} ~x~0 := 0; {1992#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:17,895 INFO L273 TraceCheckUtils]: 5: Hoare triple {1992#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {1992#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:17,896 INFO L273 TraceCheckUtils]: 6: Hoare triple {1992#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1993#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:17,896 INFO L273 TraceCheckUtils]: 7: Hoare triple {1993#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {1993#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:17,897 INFO L273 TraceCheckUtils]: 8: Hoare triple {1993#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1994#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:17,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {1994#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {1994#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:17,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {1994#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1995#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:17,899 INFO L273 TraceCheckUtils]: 11: Hoare triple {1995#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {1995#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:17,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {1995#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1996#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:17,901 INFO L273 TraceCheckUtils]: 13: Hoare triple {1996#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {1996#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:17,902 INFO L273 TraceCheckUtils]: 14: Hoare triple {1996#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1997#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:17,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {1997#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1997#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:17,903 INFO L273 TraceCheckUtils]: 16: Hoare triple {1997#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1998#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:17,904 INFO L273 TraceCheckUtils]: 17: Hoare triple {1998#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1998#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:17,905 INFO L273 TraceCheckUtils]: 18: Hoare triple {1998#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {1999#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:17,906 INFO L273 TraceCheckUtils]: 19: Hoare triple {1999#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1999#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:17,907 INFO L273 TraceCheckUtils]: 20: Hoare triple {1999#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2000#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:33:17,907 INFO L273 TraceCheckUtils]: 21: Hoare triple {2000#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2000#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:33:17,908 INFO L273 TraceCheckUtils]: 22: Hoare triple {2000#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2001#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:33:17,909 INFO L273 TraceCheckUtils]: 23: Hoare triple {2001#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {2001#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:33:17,910 INFO L273 TraceCheckUtils]: 24: Hoare triple {2001#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2078#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 17:33:17,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {2078#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {2078#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 17:33:17,912 INFO L273 TraceCheckUtils]: 26: Hoare triple {2078#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 268435455); {1991#false} is VALID [2018-11-14 17:33:17,912 INFO L256 TraceCheckUtils]: 27: Hoare triple {1991#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {1991#false} is VALID [2018-11-14 17:33:17,912 INFO L273 TraceCheckUtils]: 28: Hoare triple {1991#false} ~cond := #in~cond; {1991#false} is VALID [2018-11-14 17:33:17,913 INFO L273 TraceCheckUtils]: 29: Hoare triple {1991#false} assume ~cond == 0; {1991#false} is VALID [2018-11-14 17:33:17,913 INFO L273 TraceCheckUtils]: 30: Hoare triple {1991#false} assume !false; {1991#false} is VALID [2018-11-14 17:33:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:17,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:33:17,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 17:33:17,935 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-11-14 17:33:17,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:33:17,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:33:17,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:33:17,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:33:17,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:33:17,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:33:17,970 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 14 states. [2018-11-14 17:33:18,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:18,493 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-14 17:33:18,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:33:18,494 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-11-14 17:33:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:33:18,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:33:18,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 39 transitions. [2018-11-14 17:33:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:33:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 39 transitions. [2018-11-14 17:33:18,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 39 transitions. [2018-11-14 17:33:18,540 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-14 17:33:18,541 INFO L225 Difference]: With dead ends: 39 [2018-11-14 17:33:18,542 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 17:33:18,542 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:33:18,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 17:33:18,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-14 17:33:18,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:33:18,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-14 17:33:18,570 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 17:33:18,570 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 17:33:18,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:18,571 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-14 17:33:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 17:33:18,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:18,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:18,571 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 17:33:18,571 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 17:33:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:33:18,572 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-14 17:33:18,572 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 17:33:18,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:33:18,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:33:18,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:33:18,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:33:18,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:33:18,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-14 17:33:18,574 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-11-14 17:33:18,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:33:18,574 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-14 17:33:18,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:33:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-14 17:33:18,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 17:33:18,575 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:33:18,575 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:33:18,575 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:33:18,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:33:18,576 INFO L82 PathProgramCache]: Analyzing trace with hash 92815130, now seen corresponding path program 11 times [2018-11-14 17:33:18,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:33:18,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:33:18,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:18,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:33:18,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:33:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:33:18,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {2275#true} call ULTIMATE.init(); {2275#true} is VALID [2018-11-14 17:33:18,858 INFO L273 TraceCheckUtils]: 1: Hoare triple {2275#true} assume true; {2275#true} is VALID [2018-11-14 17:33:18,858 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2275#true} {2275#true} #32#return; {2275#true} is VALID [2018-11-14 17:33:18,859 INFO L256 TraceCheckUtils]: 3: Hoare triple {2275#true} call #t~ret0 := main(); {2275#true} is VALID [2018-11-14 17:33:18,859 INFO L273 TraceCheckUtils]: 4: Hoare triple {2275#true} ~x~0 := 0; {2277#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:18,860 INFO L273 TraceCheckUtils]: 5: Hoare triple {2277#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2277#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:33:18,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {2277#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2278#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:18,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {2278#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2278#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:33:18,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {2278#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2279#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:18,884 INFO L273 TraceCheckUtils]: 9: Hoare triple {2279#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2279#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:33:18,901 INFO L273 TraceCheckUtils]: 10: Hoare triple {2279#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2280#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:18,916 INFO L273 TraceCheckUtils]: 11: Hoare triple {2280#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2280#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:33:18,932 INFO L273 TraceCheckUtils]: 12: Hoare triple {2280#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2281#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:18,947 INFO L273 TraceCheckUtils]: 13: Hoare triple {2281#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2281#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:33:18,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {2281#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2282#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:18,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {2282#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2282#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:33:18,950 INFO L273 TraceCheckUtils]: 16: Hoare triple {2282#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2283#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:18,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {2283#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2283#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:33:18,952 INFO L273 TraceCheckUtils]: 18: Hoare triple {2283#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2284#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:18,954 INFO L273 TraceCheckUtils]: 19: Hoare triple {2284#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2284#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:33:18,955 INFO L273 TraceCheckUtils]: 20: Hoare triple {2284#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2285#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:33:18,956 INFO L273 TraceCheckUtils]: 21: Hoare triple {2285#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2285#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:33:18,956 INFO L273 TraceCheckUtils]: 22: Hoare triple {2285#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2286#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:33:18,957 INFO L273 TraceCheckUtils]: 23: Hoare triple {2286#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {2286#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:33:18,957 INFO L273 TraceCheckUtils]: 24: Hoare triple {2286#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2287#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 17:33:18,958 INFO L273 TraceCheckUtils]: 25: Hoare triple {2287#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {2287#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 17:33:18,959 INFO L273 TraceCheckUtils]: 26: Hoare triple {2287#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2288#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:33:18,959 INFO L273 TraceCheckUtils]: 27: Hoare triple {2288#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {2288#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:33:18,960 INFO L273 TraceCheckUtils]: 28: Hoare triple {2288#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2276#false} is VALID [2018-11-14 17:33:18,961 INFO L256 TraceCheckUtils]: 29: Hoare triple {2276#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {2276#false} is VALID [2018-11-14 17:33:18,961 INFO L273 TraceCheckUtils]: 30: Hoare triple {2276#false} ~cond := #in~cond; {2276#false} is VALID [2018-11-14 17:33:18,961 INFO L273 TraceCheckUtils]: 31: Hoare triple {2276#false} assume ~cond == 0; {2276#false} is VALID [2018-11-14 17:33:18,961 INFO L273 TraceCheckUtils]: 32: Hoare triple {2276#false} assume !false; {2276#false} is VALID [2018-11-14 17:33:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:33:18,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:33:18,964 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-14 17:33:18,973 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:34:02,506 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 17:34:02,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:34:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:02,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:34:02,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {2275#true} call ULTIMATE.init(); {2275#true} is VALID [2018-11-14 17:34:02,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {2275#true} assume true; {2275#true} is VALID [2018-11-14 17:34:02,719 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2275#true} {2275#true} #32#return; {2275#true} is VALID [2018-11-14 17:34:02,719 INFO L256 TraceCheckUtils]: 3: Hoare triple {2275#true} call #t~ret0 := main(); {2275#true} is VALID [2018-11-14 17:34:02,720 INFO L273 TraceCheckUtils]: 4: Hoare triple {2275#true} ~x~0 := 0; {2277#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:34:02,720 INFO L273 TraceCheckUtils]: 5: Hoare triple {2277#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2277#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:34:02,721 INFO L273 TraceCheckUtils]: 6: Hoare triple {2277#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2278#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:34:02,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {2278#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2278#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:34:02,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {2278#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2279#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:34:02,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {2279#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2279#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:34:02,724 INFO L273 TraceCheckUtils]: 10: Hoare triple {2279#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2280#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:34:02,724 INFO L273 TraceCheckUtils]: 11: Hoare triple {2280#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2280#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:34:02,725 INFO L273 TraceCheckUtils]: 12: Hoare triple {2280#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2281#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:34:02,726 INFO L273 TraceCheckUtils]: 13: Hoare triple {2281#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2281#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:34:02,727 INFO L273 TraceCheckUtils]: 14: Hoare triple {2281#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2282#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:34:02,728 INFO L273 TraceCheckUtils]: 15: Hoare triple {2282#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2282#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:34:02,729 INFO L273 TraceCheckUtils]: 16: Hoare triple {2282#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2283#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:34:02,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {2283#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2283#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:34:02,746 INFO L273 TraceCheckUtils]: 18: Hoare triple {2283#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2284#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:34:02,747 INFO L273 TraceCheckUtils]: 19: Hoare triple {2284#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2284#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:34:02,747 INFO L273 TraceCheckUtils]: 20: Hoare triple {2284#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2285#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:34:02,748 INFO L273 TraceCheckUtils]: 21: Hoare triple {2285#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2285#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:34:02,748 INFO L273 TraceCheckUtils]: 22: Hoare triple {2285#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2286#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:34:02,749 INFO L273 TraceCheckUtils]: 23: Hoare triple {2286#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {2286#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:34:02,749 INFO L273 TraceCheckUtils]: 24: Hoare triple {2286#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2287#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 17:34:02,750 INFO L273 TraceCheckUtils]: 25: Hoare triple {2287#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {2287#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 17:34:02,750 INFO L273 TraceCheckUtils]: 26: Hoare triple {2287#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2370#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 17:34:02,751 INFO L273 TraceCheckUtils]: 27: Hoare triple {2370#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {2370#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 17:34:02,752 INFO L273 TraceCheckUtils]: 28: Hoare triple {2370#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2276#false} is VALID [2018-11-14 17:34:02,752 INFO L256 TraceCheckUtils]: 29: Hoare triple {2276#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {2276#false} is VALID [2018-11-14 17:34:02,753 INFO L273 TraceCheckUtils]: 30: Hoare triple {2276#false} ~cond := #in~cond; {2276#false} is VALID [2018-11-14 17:34:02,753 INFO L273 TraceCheckUtils]: 31: Hoare triple {2276#false} assume ~cond == 0; {2276#false} is VALID [2018-11-14 17:34:02,753 INFO L273 TraceCheckUtils]: 32: Hoare triple {2276#false} assume !false; {2276#false} is VALID [2018-11-14 17:34:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:02,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:34:02,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 17:34:02,778 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-11-14 17:34:02,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:34:02,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 17:34:02,824 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-14 17:34:02,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 17:34:02,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 17:34:02,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:34:02,825 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 15 states. [2018-11-14 17:34:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:03,495 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-14 17:34:03,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 17:34:03,495 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-11-14 17:34:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:34:03,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:34:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 41 transitions. [2018-11-14 17:34:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 17:34:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 41 transitions. [2018-11-14 17:34:03,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 41 transitions. [2018-11-14 17:34:03,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:34:03,563 INFO L225 Difference]: With dead ends: 41 [2018-11-14 17:34:03,563 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:34:03,564 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-14 17:34:03,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:34:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-14 17:34:03,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:34:03,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-14 17:34:03,585 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 17:34:03,585 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 17:34:03,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:03,586 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-14 17:34:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-14 17:34:03,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:03,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:03,586 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 17:34:03,586 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 17:34:03,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:34:03,587 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-14 17:34:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-14 17:34:03,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:34:03,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:34:03,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:34:03,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:34:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 17:34:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-14 17:34:03,589 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-11-14 17:34:03,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:34:03,590 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-14 17:34:03,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 17:34:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-14 17:34:03,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 17:34:03,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:34:03,591 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:34:03,591 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:34:03,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:34:03,591 INFO L82 PathProgramCache]: Analyzing trace with hash -3987744, now seen corresponding path program 12 times [2018-11-14 17:34:03,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:34:03,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:34:03,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:03,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:34:03,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:34:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:34:04,357 INFO L256 TraceCheckUtils]: 0: Hoare triple {2577#true} call ULTIMATE.init(); {2577#true} is VALID [2018-11-14 17:34:04,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {2577#true} assume true; {2577#true} is VALID [2018-11-14 17:34:04,357 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2577#true} {2577#true} #32#return; {2577#true} is VALID [2018-11-14 17:34:04,357 INFO L256 TraceCheckUtils]: 3: Hoare triple {2577#true} call #t~ret0 := main(); {2577#true} is VALID [2018-11-14 17:34:04,358 INFO L273 TraceCheckUtils]: 4: Hoare triple {2577#true} ~x~0 := 0; {2579#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:34:04,359 INFO L273 TraceCheckUtils]: 5: Hoare triple {2579#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume true; {2579#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-14 17:34:04,360 INFO L273 TraceCheckUtils]: 6: Hoare triple {2579#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2580#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:34:04,361 INFO L273 TraceCheckUtils]: 7: Hoare triple {2580#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume true; {2580#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-14 17:34:04,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {2580#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2581#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:34:04,363 INFO L273 TraceCheckUtils]: 9: Hoare triple {2581#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume true; {2581#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-14 17:34:04,364 INFO L273 TraceCheckUtils]: 10: Hoare triple {2581#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2582#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:34:04,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {2582#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume true; {2582#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-14 17:34:04,365 INFO L273 TraceCheckUtils]: 12: Hoare triple {2582#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2583#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:34:04,366 INFO L273 TraceCheckUtils]: 13: Hoare triple {2583#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume true; {2583#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-14 17:34:04,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {2583#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2584#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:34:04,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {2584#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2584#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-14 17:34:04,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {2584#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2585#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:34:04,370 INFO L273 TraceCheckUtils]: 17: Hoare triple {2585#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2585#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-14 17:34:04,371 INFO L273 TraceCheckUtils]: 18: Hoare triple {2585#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2586#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:34:04,371 INFO L273 TraceCheckUtils]: 19: Hoare triple {2586#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2586#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-14 17:34:04,372 INFO L273 TraceCheckUtils]: 20: Hoare triple {2586#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2587#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:34:04,373 INFO L273 TraceCheckUtils]: 21: Hoare triple {2587#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2587#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-14 17:34:04,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {2587#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2588#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:34:04,375 INFO L273 TraceCheckUtils]: 23: Hoare triple {2588#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {2588#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-14 17:34:04,376 INFO L273 TraceCheckUtils]: 24: Hoare triple {2588#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2589#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 17:34:04,377 INFO L273 TraceCheckUtils]: 25: Hoare triple {2589#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {2589#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-14 17:34:04,378 INFO L273 TraceCheckUtils]: 26: Hoare triple {2589#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2590#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 17:34:04,379 INFO L273 TraceCheckUtils]: 27: Hoare triple {2590#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {2590#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-14 17:34:04,380 INFO L273 TraceCheckUtils]: 28: Hoare triple {2590#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := ~x~0 + 2; {2591#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:34:04,380 INFO L273 TraceCheckUtils]: 29: Hoare triple {2591#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume true; {2591#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-14 17:34:04,381 INFO L273 TraceCheckUtils]: 30: Hoare triple {2591#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2578#false} is VALID [2018-11-14 17:34:04,382 INFO L256 TraceCheckUtils]: 31: Hoare triple {2578#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && ~x~0 % 4294967296 % 2 != 0 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == 0 then 1 else 0)); {2578#false} is VALID [2018-11-14 17:34:04,382 INFO L273 TraceCheckUtils]: 32: Hoare triple {2578#false} ~cond := #in~cond; {2578#false} is VALID [2018-11-14 17:34:04,382 INFO L273 TraceCheckUtils]: 33: Hoare triple {2578#false} assume ~cond == 0; {2578#false} is VALID [2018-11-14 17:34:04,383 INFO L273 TraceCheckUtils]: 34: Hoare triple {2578#false} assume !false; {2578#false} is VALID [2018-11-14 17:34:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:34:04,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:34:04,386 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-14 17:34:04,396 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE