java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:08:19,121 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:08:19,123 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:08:19,134 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:08:19,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:08:19,136 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:08:19,137 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:08:19,139 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:08:19,140 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:08:19,141 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:08:19,142 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:08:19,142 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:08:19,143 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:08:19,144 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:08:19,145 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:08:19,146 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:08:19,147 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:08:19,148 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:08:19,150 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:08:19,152 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:08:19,153 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:08:19,154 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:08:19,156 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:08:19,157 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:08:19,157 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:08:19,158 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:08:19,159 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:08:19,159 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:08:19,160 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:08:19,161 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:08:19,161 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:08:19,162 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:08:19,162 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:08:19,163 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:08:19,164 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:08:19,164 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:08:19,165 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:08:19,189 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:08:19,190 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:08:19,190 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:08:19,191 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:08:19,191 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:08:19,191 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:08:19,192 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:08:19,193 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:08:19,193 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:08:19,193 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:08:19,193 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:08:19,193 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:08:19,193 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:08:19,194 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:08:19,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:08:19,194 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:08:19,195 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:08:19,195 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:08:19,195 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:08:19,195 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:08:19,195 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:08:19,195 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:08:19,196 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:08:19,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:08:19,196 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:08:19,196 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:08:19,196 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:08:19,198 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:08:19,198 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:08:19,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:08:19,199 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:08:19,264 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:08:19,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:08:19,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:08:19,285 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:08:19,286 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:08:19,286 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-23 13:08:19,339 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd45c60bc/a9a49ebd88234e29aa250b53c1df1042/FLAGd30193ad9 [2018-11-23 13:08:19,746 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:08:19,746 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_true-unreach-call1.i [2018-11-23 13:08:19,752 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd45c60bc/a9a49ebd88234e29aa250b53c1df1042/FLAGd30193ad9 [2018-11-23 13:08:20,133 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd45c60bc/a9a49ebd88234e29aa250b53c1df1042 [2018-11-23 13:08:20,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:08:20,143 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:08:20,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:08:20,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:08:20,148 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:08:20,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b79002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20, skipping insertion in model container [2018-11-23 13:08:20,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:08:20,182 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:08:20,422 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:08:20,429 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:08:20,448 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:08:20,466 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:08:20,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20 WrapperNode [2018-11-23 13:08:20,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:08:20,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:08:20,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:08:20,468 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:08:20,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:08:20,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:08:20,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:08:20,494 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:08:20,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:08:20,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:08:20,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:08:20,523 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:08:20,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:08:20,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:08:20,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:08:20,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:08:20,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:08:20,690 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:08:20,690 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:08:20,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:08:20,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:08:21,075 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:08:21,075 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:08:21,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:21 BoogieIcfgContainer [2018-11-23 13:08:21,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:08:21,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:08:21,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:08:21,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:08:21,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:08:20" (1/3) ... [2018-11-23 13:08:21,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771b441e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:08:21, skipping insertion in model container [2018-11-23 13:08:21,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (2/3) ... [2018-11-23 13:08:21,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771b441e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:08:21, skipping insertion in model container [2018-11-23 13:08:21,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:21" (3/3) ... [2018-11-23 13:08:21,084 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call1.i [2018-11-23 13:08:21,095 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:08:21,103 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:08:21,121 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:08:21,148 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:08:21,149 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:08:21,149 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:08:21,150 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:08:21,150 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:08:21,150 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:08:21,150 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:08:21,150 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:08:21,150 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:08:21,168 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 13:08:21,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:08:21,174 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:21,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:21,177 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:21,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:21,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 13:08:21,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:21,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:21,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:21,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:21,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:21,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 13:08:21,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 13:08:21,520 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 13:08:21,520 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret0 := main(); {20#true} is VALID [2018-11-23 13:08:21,521 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~x~0 := 0; {22#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:21,523 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {21#false} is VALID [2018-11-23 13:08:21,523 INFO L256 TraceCheckUtils]: 6: Hoare triple {21#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {21#false} is VALID [2018-11-23 13:08:21,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2018-11-23 13:08:21,524 INFO L273 TraceCheckUtils]: 8: Hoare triple {21#false} assume 0 == ~cond; {21#false} is VALID [2018-11-23 13:08:21,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 13:08:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:21,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:08:21,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:08:21,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:08:21,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:21,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:08:21,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:21,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:08:21,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:08:21,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:08:21,597 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-11-23 13:08:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:21,859 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 13:08:21,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:08:21,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:08:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:08:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 13:08:21,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:08:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 13:08:21,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 13:08:22,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:22,128 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:08:22,129 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:08:22,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:08:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:08:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:08:22,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:22,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:22,170 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:22,170 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:22,174 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:08:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:08:22,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:22,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:22,175 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:22,175 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:22,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:22,177 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:08:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:08:22,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:22,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:22,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:22,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:22,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:08:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:08:22,182 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 13:08:22,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:22,182 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:08:22,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:08:22,183 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:08:22,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:08:22,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:22,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:22,184 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:22,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:22,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 13:08:22,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:22,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:22,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:22,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:22,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:22,470 INFO L256 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {108#true} is VALID [2018-11-23 13:08:22,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {108#true} assume true; {108#true} is VALID [2018-11-23 13:08:22,471 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {108#true} {108#true} #31#return; {108#true} is VALID [2018-11-23 13:08:22,471 INFO L256 TraceCheckUtils]: 3: Hoare triple {108#true} call #t~ret0 := main(); {108#true} is VALID [2018-11-23 13:08:22,472 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#true} ~x~0 := 0; {110#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:22,474 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {111#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:22,475 INFO L273 TraceCheckUtils]: 6: Hoare triple {111#(and (<= main_~x~0 2) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {109#false} is VALID [2018-11-23 13:08:22,475 INFO L256 TraceCheckUtils]: 7: Hoare triple {109#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {109#false} is VALID [2018-11-23 13:08:22,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2018-11-23 13:08:22,476 INFO L273 TraceCheckUtils]: 9: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2018-11-23 13:08:22,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {109#false} assume !false; {109#false} is VALID [2018-11-23 13:08:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:22,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:22,478 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:22,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:22,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:22,610 INFO L256 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {108#true} is VALID [2018-11-23 13:08:22,611 INFO L273 TraceCheckUtils]: 1: Hoare triple {108#true} assume true; {108#true} is VALID [2018-11-23 13:08:22,611 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {108#true} {108#true} #31#return; {108#true} is VALID [2018-11-23 13:08:22,612 INFO L256 TraceCheckUtils]: 3: Hoare triple {108#true} call #t~ret0 := main(); {108#true} is VALID [2018-11-23 13:08:22,614 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#true} ~x~0 := 0; {110#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:22,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {130#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:22,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {130#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {109#false} is VALID [2018-11-23 13:08:22,617 INFO L256 TraceCheckUtils]: 7: Hoare triple {109#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {109#false} is VALID [2018-11-23 13:08:22,617 INFO L273 TraceCheckUtils]: 8: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2018-11-23 13:08:22,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2018-11-23 13:08:22,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {109#false} assume !false; {109#false} is VALID [2018-11-23 13:08:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:22,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:22,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:08:22,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:08:22,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:22,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:08:22,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:22,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:08:22,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:08:22,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:08:22,664 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2018-11-23 13:08:22,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:22,940 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:08:22,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:08:22,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:08:22,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:08:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:08:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:08:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:08:22,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2018-11-23 13:08:23,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:23,188 INFO L225 Difference]: With dead ends: 18 [2018-11-23 13:08:23,188 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:08:23,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:08:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:08:23,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:08:23,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:23,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:08:23,282 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:08:23,282 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:08:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:23,284 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:08:23,284 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:08:23,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:23,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:23,285 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:08:23,285 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:08:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:23,287 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:08:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:08:23,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:23,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:23,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:23,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:08:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:08:23,289 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 13:08:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:23,290 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:08:23,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:08:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:08:23,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:08:23,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:23,291 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:23,291 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:23,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:23,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2018-11-23 13:08:23,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:23,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:23,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:23,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:23,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:23,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 13:08:23,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 13:08:23,553 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #31#return; {222#true} is VALID [2018-11-23 13:08:23,553 INFO L256 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret0 := main(); {222#true} is VALID [2018-11-23 13:08:23,554 INFO L273 TraceCheckUtils]: 4: Hoare triple {222#true} ~x~0 := 0; {224#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:23,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {225#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:23,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {225#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {226#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:23,557 INFO L273 TraceCheckUtils]: 7: Hoare triple {226#(and (<= main_~x~0 4) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {223#false} is VALID [2018-11-23 13:08:23,558 INFO L256 TraceCheckUtils]: 8: Hoare triple {223#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {223#false} is VALID [2018-11-23 13:08:23,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 13:08:23,559 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 13:08:23,559 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 13:08:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:23,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:23,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:23,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:08:23,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:08:23,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:23,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:23,693 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 13:08:23,693 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 13:08:23,694 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #31#return; {222#true} is VALID [2018-11-23 13:08:23,694 INFO L256 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret0 := main(); {222#true} is VALID [2018-11-23 13:08:23,695 INFO L273 TraceCheckUtils]: 4: Hoare triple {222#true} ~x~0 := 0; {224#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:23,696 INFO L273 TraceCheckUtils]: 5: Hoare triple {224#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {225#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:23,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {225#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:23,703 INFO L273 TraceCheckUtils]: 7: Hoare triple {248#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !(~x~0 % 4294967296 < 268435455); {223#false} is VALID [2018-11-23 13:08:23,704 INFO L256 TraceCheckUtils]: 8: Hoare triple {223#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {223#false} is VALID [2018-11-23 13:08:23,704 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 13:08:23,704 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 13:08:23,704 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 13:08:23,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:23,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:23,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:08:23,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:08:23,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:23,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:08:23,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:23,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:08:23,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:08:23,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:08:23,756 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-11-23 13:08:23,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:23,883 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:08:23,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:08:23,884 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:08:23,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:23,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:08:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:08:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:08:23,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:08:23,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2018-11-23 13:08:23,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:23,970 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:08:23,971 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:08:23,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:08:23,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:08:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:08:23,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:23,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:23,987 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:23,987 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:23,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:23,989 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:08:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:08:23,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:23,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:23,990 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:23,990 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:23,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:23,992 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:08:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:08:23,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:23,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:23,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:23,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:23,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:08:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:08:23,995 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 13:08:23,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:23,995 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:08:23,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:08:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:08:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:08:23,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:23,996 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:23,996 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:23,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:23,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2018-11-23 13:08:23,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:23,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:23,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:23,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:23,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:24,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2018-11-23 13:08:24,214 INFO L273 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2018-11-23 13:08:24,214 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #31#return; {346#true} is VALID [2018-11-23 13:08:24,214 INFO L256 TraceCheckUtils]: 3: Hoare triple {346#true} call #t~ret0 := main(); {346#true} is VALID [2018-11-23 13:08:24,215 INFO L273 TraceCheckUtils]: 4: Hoare triple {346#true} ~x~0 := 0; {348#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:24,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {348#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {349#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:24,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {349#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {350#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:24,220 INFO L273 TraceCheckUtils]: 7: Hoare triple {350#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {351#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:24,221 INFO L273 TraceCheckUtils]: 8: Hoare triple {351#(and (<= main_~x~0 6) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {347#false} is VALID [2018-11-23 13:08:24,221 INFO L256 TraceCheckUtils]: 9: Hoare triple {347#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {347#false} is VALID [2018-11-23 13:08:24,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {347#false} ~cond := #in~cond; {347#false} is VALID [2018-11-23 13:08:24,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {347#false} assume 0 == ~cond; {347#false} is VALID [2018-11-23 13:08:24,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {347#false} assume !false; {347#false} is VALID [2018-11-23 13:08:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:24,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:24,223 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:24,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:08:24,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:08:24,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:24,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:24,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2018-11-23 13:08:24,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2018-11-23 13:08:24,356 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #31#return; {346#true} is VALID [2018-11-23 13:08:24,356 INFO L256 TraceCheckUtils]: 3: Hoare triple {346#true} call #t~ret0 := main(); {346#true} is VALID [2018-11-23 13:08:24,357 INFO L273 TraceCheckUtils]: 4: Hoare triple {346#true} ~x~0 := 0; {348#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:24,357 INFO L273 TraceCheckUtils]: 5: Hoare triple {348#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {349#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:24,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {349#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {350#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:24,359 INFO L273 TraceCheckUtils]: 7: Hoare triple {350#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {376#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:24,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {376#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {347#false} is VALID [2018-11-23 13:08:24,360 INFO L256 TraceCheckUtils]: 9: Hoare triple {347#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {347#false} is VALID [2018-11-23 13:08:24,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {347#false} ~cond := #in~cond; {347#false} is VALID [2018-11-23 13:08:24,360 INFO L273 TraceCheckUtils]: 11: Hoare triple {347#false} assume 0 == ~cond; {347#false} is VALID [2018-11-23 13:08:24,361 INFO L273 TraceCheckUtils]: 12: Hoare triple {347#false} assume !false; {347#false} is VALID [2018-11-23 13:08:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:24,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:24,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:08:24,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 13:08:24,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:24,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:08:24,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:24,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:08:24,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:08:24,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:08:24,399 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2018-11-23 13:08:24,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:24,532 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:08:24,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:08:24,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 13:08:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:08:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-23 13:08:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:08:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-23 13:08:24,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2018-11-23 13:08:24,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:24,567 INFO L225 Difference]: With dead ends: 20 [2018-11-23 13:08:24,567 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:08:24,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:08:24,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:08:24,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:08:24,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:24,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 13:08:24,587 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:08:24,587 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:08:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:24,588 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:08:24,589 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:08:24,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:24,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:24,590 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:08:24,590 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:08:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:24,591 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:08:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:08:24,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:24,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:24,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:24,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:08:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 13:08:24,594 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-11-23 13:08:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:24,594 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 13:08:24,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:08:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:08:24,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:08:24,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:24,595 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:24,596 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:24,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:24,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2018-11-23 13:08:24,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:24,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:24,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:24,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:24,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:25,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2018-11-23 13:08:25,048 INFO L273 TraceCheckUtils]: 1: Hoare triple {480#true} assume true; {480#true} is VALID [2018-11-23 13:08:25,048 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {480#true} {480#true} #31#return; {480#true} is VALID [2018-11-23 13:08:25,048 INFO L256 TraceCheckUtils]: 3: Hoare triple {480#true} call #t~ret0 := main(); {480#true} is VALID [2018-11-23 13:08:25,050 INFO L273 TraceCheckUtils]: 4: Hoare triple {480#true} ~x~0 := 0; {482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:25,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {483#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:25,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {483#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {484#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:25,057 INFO L273 TraceCheckUtils]: 7: Hoare triple {484#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {485#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:25,058 INFO L273 TraceCheckUtils]: 8: Hoare triple {485#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {486#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:25,058 INFO L273 TraceCheckUtils]: 9: Hoare triple {486#(and (<= main_~x~0 8) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {481#false} is VALID [2018-11-23 13:08:25,059 INFO L256 TraceCheckUtils]: 10: Hoare triple {481#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {481#false} is VALID [2018-11-23 13:08:25,059 INFO L273 TraceCheckUtils]: 11: Hoare triple {481#false} ~cond := #in~cond; {481#false} is VALID [2018-11-23 13:08:25,059 INFO L273 TraceCheckUtils]: 12: Hoare triple {481#false} assume 0 == ~cond; {481#false} is VALID [2018-11-23 13:08:25,059 INFO L273 TraceCheckUtils]: 13: Hoare triple {481#false} assume !false; {481#false} is VALID [2018-11-23 13:08:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:25,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:25,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:25,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:08:25,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:08:25,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:25,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:25,265 INFO L256 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2018-11-23 13:08:25,266 INFO L273 TraceCheckUtils]: 1: Hoare triple {480#true} assume true; {480#true} is VALID [2018-11-23 13:08:25,266 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {480#true} {480#true} #31#return; {480#true} is VALID [2018-11-23 13:08:25,266 INFO L256 TraceCheckUtils]: 3: Hoare triple {480#true} call #t~ret0 := main(); {480#true} is VALID [2018-11-23 13:08:25,267 INFO L273 TraceCheckUtils]: 4: Hoare triple {480#true} ~x~0 := 0; {482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:25,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {482#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {483#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:25,269 INFO L273 TraceCheckUtils]: 6: Hoare triple {483#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {484#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:25,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {484#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {485#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:25,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {485#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {514#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:25,278 INFO L273 TraceCheckUtils]: 9: Hoare triple {514#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !(~x~0 % 4294967296 < 268435455); {481#false} is VALID [2018-11-23 13:08:25,278 INFO L256 TraceCheckUtils]: 10: Hoare triple {481#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {481#false} is VALID [2018-11-23 13:08:25,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {481#false} ~cond := #in~cond; {481#false} is VALID [2018-11-23 13:08:25,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {481#false} assume 0 == ~cond; {481#false} is VALID [2018-11-23 13:08:25,279 INFO L273 TraceCheckUtils]: 13: Hoare triple {481#false} assume !false; {481#false} is VALID [2018-11-23 13:08:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:25,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:25,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:08:25,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 13:08:25,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:25,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:08:25,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:25,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:08:25,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:08:25,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:08:25,327 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-11-23 13:08:25,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:25,582 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:08:25,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:08:25,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 13:08:25,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:08:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-11-23 13:08:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:08:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-11-23 13:08:25,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2018-11-23 13:08:25,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:25,616 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:08:25,617 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:08:25,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:08:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:08:25,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:08:25,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:25,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:08:25,656 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:08:25,656 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:08:25,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:25,657 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:08:25,657 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:08:25,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:25,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:25,658 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:08:25,658 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:08:25,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:25,660 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:08:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:08:25,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:25,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:25,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:25,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:08:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 13:08:25,662 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-23 13:08:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:25,663 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 13:08:25,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:08:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:08:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:08:25,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:25,664 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:25,664 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:25,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:25,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2018-11-23 13:08:25,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:25,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:25,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:25,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:25,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:26,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {624#true} is VALID [2018-11-23 13:08:26,310 INFO L273 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2018-11-23 13:08:26,311 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #31#return; {624#true} is VALID [2018-11-23 13:08:26,311 INFO L256 TraceCheckUtils]: 3: Hoare triple {624#true} call #t~ret0 := main(); {624#true} is VALID [2018-11-23 13:08:26,311 INFO L273 TraceCheckUtils]: 4: Hoare triple {624#true} ~x~0 := 0; {626#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:26,312 INFO L273 TraceCheckUtils]: 5: Hoare triple {626#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:26,313 INFO L273 TraceCheckUtils]: 6: Hoare triple {627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {628#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:26,314 INFO L273 TraceCheckUtils]: 7: Hoare triple {628#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {629#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:26,314 INFO L273 TraceCheckUtils]: 8: Hoare triple {629#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {630#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:26,315 INFO L273 TraceCheckUtils]: 9: Hoare triple {630#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {631#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:26,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {631#(and (<= main_~x~0 10) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {625#false} is VALID [2018-11-23 13:08:26,320 INFO L256 TraceCheckUtils]: 11: Hoare triple {625#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {625#false} is VALID [2018-11-23 13:08:26,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {625#false} ~cond := #in~cond; {625#false} is VALID [2018-11-23 13:08:26,320 INFO L273 TraceCheckUtils]: 13: Hoare triple {625#false} assume 0 == ~cond; {625#false} is VALID [2018-11-23 13:08:26,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {625#false} assume !false; {625#false} is VALID [2018-11-23 13:08:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:26,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:26,322 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:26,341 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:08:26,354 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 13:08:26,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:26,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:26,463 INFO L256 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {624#true} is VALID [2018-11-23 13:08:26,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2018-11-23 13:08:26,464 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #31#return; {624#true} is VALID [2018-11-23 13:08:26,464 INFO L256 TraceCheckUtils]: 3: Hoare triple {624#true} call #t~ret0 := main(); {624#true} is VALID [2018-11-23 13:08:26,467 INFO L273 TraceCheckUtils]: 4: Hoare triple {624#true} ~x~0 := 0; {626#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:26,468 INFO L273 TraceCheckUtils]: 5: Hoare triple {626#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:26,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {628#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:26,470 INFO L273 TraceCheckUtils]: 7: Hoare triple {628#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {629#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:26,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {629#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {630#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:26,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {630#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {662#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:26,473 INFO L273 TraceCheckUtils]: 10: Hoare triple {662#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {625#false} is VALID [2018-11-23 13:08:26,473 INFO L256 TraceCheckUtils]: 11: Hoare triple {625#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {625#false} is VALID [2018-11-23 13:08:26,474 INFO L273 TraceCheckUtils]: 12: Hoare triple {625#false} ~cond := #in~cond; {625#false} is VALID [2018-11-23 13:08:26,474 INFO L273 TraceCheckUtils]: 13: Hoare triple {625#false} assume 0 == ~cond; {625#false} is VALID [2018-11-23 13:08:26,475 INFO L273 TraceCheckUtils]: 14: Hoare triple {625#false} assume !false; {625#false} is VALID [2018-11-23 13:08:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:26,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:26,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:08:26,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-11-23 13:08:26,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:26,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:08:26,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:26,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:08:26,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:08:26,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:08:26,513 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2018-11-23 13:08:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:26,746 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:08:26,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:08:26,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-11-23 13:08:26,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:26,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:08:26,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-11-23 13:08:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:08:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-11-23 13:08:26,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2018-11-23 13:08:26,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:26,782 INFO L225 Difference]: With dead ends: 22 [2018-11-23 13:08:26,782 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 13:08:26,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:08:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 13:08:26,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 13:08:26,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:26,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 13:08:26,798 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:08:26,799 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:08:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:26,801 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 13:08:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:08:26,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:26,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:26,802 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:08:26,802 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:08:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:26,803 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 13:08:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:08:26,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:26,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:26,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:26,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:08:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 13:08:26,806 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-11-23 13:08:26,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:26,806 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 13:08:26,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:08:26,806 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:08:26,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:08:26,807 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:26,807 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:26,808 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:26,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:26,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2018-11-23 13:08:26,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:26,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:26,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:26,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:26,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:27,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {778#true} call ULTIMATE.init(); {778#true} is VALID [2018-11-23 13:08:27,120 INFO L273 TraceCheckUtils]: 1: Hoare triple {778#true} assume true; {778#true} is VALID [2018-11-23 13:08:27,120 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {778#true} {778#true} #31#return; {778#true} is VALID [2018-11-23 13:08:27,120 INFO L256 TraceCheckUtils]: 3: Hoare triple {778#true} call #t~ret0 := main(); {778#true} is VALID [2018-11-23 13:08:27,121 INFO L273 TraceCheckUtils]: 4: Hoare triple {778#true} ~x~0 := 0; {780#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:27,122 INFO L273 TraceCheckUtils]: 5: Hoare triple {780#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {781#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:27,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {781#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {782#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:27,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {782#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {783#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:27,125 INFO L273 TraceCheckUtils]: 8: Hoare triple {783#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {784#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:27,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {784#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {785#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:27,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {785#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {786#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:27,129 INFO L273 TraceCheckUtils]: 11: Hoare triple {786#(and (<= main_~x~0 12) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {779#false} is VALID [2018-11-23 13:08:27,129 INFO L256 TraceCheckUtils]: 12: Hoare triple {779#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {779#false} is VALID [2018-11-23 13:08:27,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {779#false} ~cond := #in~cond; {779#false} is VALID [2018-11-23 13:08:27,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {779#false} assume 0 == ~cond; {779#false} is VALID [2018-11-23 13:08:27,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {779#false} assume !false; {779#false} is VALID [2018-11-23 13:08:27,131 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:27,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:27,132 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:27,149 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:08:27,169 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 13:08:27,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:27,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:27,461 INFO L256 TraceCheckUtils]: 0: Hoare triple {778#true} call ULTIMATE.init(); {778#true} is VALID [2018-11-23 13:08:27,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {778#true} assume true; {778#true} is VALID [2018-11-23 13:08:27,462 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {778#true} {778#true} #31#return; {778#true} is VALID [2018-11-23 13:08:27,462 INFO L256 TraceCheckUtils]: 3: Hoare triple {778#true} call #t~ret0 := main(); {778#true} is VALID [2018-11-23 13:08:27,463 INFO L273 TraceCheckUtils]: 4: Hoare triple {778#true} ~x~0 := 0; {780#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:27,464 INFO L273 TraceCheckUtils]: 5: Hoare triple {780#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {781#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:27,465 INFO L273 TraceCheckUtils]: 6: Hoare triple {781#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {782#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:27,466 INFO L273 TraceCheckUtils]: 7: Hoare triple {782#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {783#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:27,467 INFO L273 TraceCheckUtils]: 8: Hoare triple {783#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {784#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:27,468 INFO L273 TraceCheckUtils]: 9: Hoare triple {784#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {785#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:27,469 INFO L273 TraceCheckUtils]: 10: Hoare triple {785#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {820#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:27,470 INFO L273 TraceCheckUtils]: 11: Hoare triple {820#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {779#false} is VALID [2018-11-23 13:08:27,471 INFO L256 TraceCheckUtils]: 12: Hoare triple {779#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {779#false} is VALID [2018-11-23 13:08:27,471 INFO L273 TraceCheckUtils]: 13: Hoare triple {779#false} ~cond := #in~cond; {779#false} is VALID [2018-11-23 13:08:27,471 INFO L273 TraceCheckUtils]: 14: Hoare triple {779#false} assume 0 == ~cond; {779#false} is VALID [2018-11-23 13:08:27,472 INFO L273 TraceCheckUtils]: 15: Hoare triple {779#false} assume !false; {779#false} is VALID [2018-11-23 13:08:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:27,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:27,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 13:08:27,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 13:08:27,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:27,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:08:27,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:27,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:08:27,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:08:27,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:08:27,526 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-11-23 13:08:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:27,731 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:08:27,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:08:27,731 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 13:08:27,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:08:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-11-23 13:08:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:08:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-11-23 13:08:27,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2018-11-23 13:08:27,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:27,764 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:08:27,765 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:08:27,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:08:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:08:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:08:27,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:27,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 13:08:27,786 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:08:27,786 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:08:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:27,788 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:08:27,789 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:08:27,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:27,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:27,790 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:08:27,790 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:08:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:27,791 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:08:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:08:27,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:27,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:27,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:27,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:08:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 13:08:27,793 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-11-23 13:08:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:27,794 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 13:08:27,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:08:27,794 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:08:27,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:08:27,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:27,795 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:27,795 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:27,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:27,796 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2018-11-23 13:08:27,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:27,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:27,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:27,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:27,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:28,126 INFO L256 TraceCheckUtils]: 0: Hoare triple {942#true} call ULTIMATE.init(); {942#true} is VALID [2018-11-23 13:08:28,127 INFO L273 TraceCheckUtils]: 1: Hoare triple {942#true} assume true; {942#true} is VALID [2018-11-23 13:08:28,127 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {942#true} {942#true} #31#return; {942#true} is VALID [2018-11-23 13:08:28,127 INFO L256 TraceCheckUtils]: 3: Hoare triple {942#true} call #t~ret0 := main(); {942#true} is VALID [2018-11-23 13:08:28,128 INFO L273 TraceCheckUtils]: 4: Hoare triple {942#true} ~x~0 := 0; {944#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:28,129 INFO L273 TraceCheckUtils]: 5: Hoare triple {944#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {945#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:28,130 INFO L273 TraceCheckUtils]: 6: Hoare triple {945#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {946#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:28,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {946#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {947#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:28,131 INFO L273 TraceCheckUtils]: 8: Hoare triple {947#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {948#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:28,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {948#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {949#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:28,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {949#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {950#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:28,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {950#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {951#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:28,135 INFO L273 TraceCheckUtils]: 12: Hoare triple {951#(and (<= main_~x~0 14) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {943#false} is VALID [2018-11-23 13:08:28,135 INFO L256 TraceCheckUtils]: 13: Hoare triple {943#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {943#false} is VALID [2018-11-23 13:08:28,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {943#false} ~cond := #in~cond; {943#false} is VALID [2018-11-23 13:08:28,136 INFO L273 TraceCheckUtils]: 15: Hoare triple {943#false} assume 0 == ~cond; {943#false} is VALID [2018-11-23 13:08:28,136 INFO L273 TraceCheckUtils]: 16: Hoare triple {943#false} assume !false; {943#false} is VALID [2018-11-23 13:08:28,137 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:28,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:28,138 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:28,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:28,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:28,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {942#true} call ULTIMATE.init(); {942#true} is VALID [2018-11-23 13:08:28,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {942#true} assume true; {942#true} is VALID [2018-11-23 13:08:28,278 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {942#true} {942#true} #31#return; {942#true} is VALID [2018-11-23 13:08:28,279 INFO L256 TraceCheckUtils]: 3: Hoare triple {942#true} call #t~ret0 := main(); {942#true} is VALID [2018-11-23 13:08:28,280 INFO L273 TraceCheckUtils]: 4: Hoare triple {942#true} ~x~0 := 0; {944#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:28,282 INFO L273 TraceCheckUtils]: 5: Hoare triple {944#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {945#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:28,282 INFO L273 TraceCheckUtils]: 6: Hoare triple {945#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {946#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:28,283 INFO L273 TraceCheckUtils]: 7: Hoare triple {946#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {947#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:28,284 INFO L273 TraceCheckUtils]: 8: Hoare triple {947#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {948#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:28,285 INFO L273 TraceCheckUtils]: 9: Hoare triple {948#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {949#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:28,286 INFO L273 TraceCheckUtils]: 10: Hoare triple {949#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {950#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:28,288 INFO L273 TraceCheckUtils]: 11: Hoare triple {950#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {988#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:28,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {988#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {943#false} is VALID [2018-11-23 13:08:28,289 INFO L256 TraceCheckUtils]: 13: Hoare triple {943#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {943#false} is VALID [2018-11-23 13:08:28,290 INFO L273 TraceCheckUtils]: 14: Hoare triple {943#false} ~cond := #in~cond; {943#false} is VALID [2018-11-23 13:08:28,290 INFO L273 TraceCheckUtils]: 15: Hoare triple {943#false} assume 0 == ~cond; {943#false} is VALID [2018-11-23 13:08:28,291 INFO L273 TraceCheckUtils]: 16: Hoare triple {943#false} assume !false; {943#false} is VALID [2018-11-23 13:08:28,292 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:28,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:28,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:08:28,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-23 13:08:28,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:28,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:08:28,343 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:28,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:08:28,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:08:28,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:08:28,344 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2018-11-23 13:08:28,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:28,675 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:08:28,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:08:28,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-23 13:08:28,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:28,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:08:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2018-11-23 13:08:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:08:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2018-11-23 13:08:28,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2018-11-23 13:08:28,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:28,716 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:08:28,716 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 13:08:28,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:08:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 13:08:28,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 13:08:28,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:28,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 13:08:28,828 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 13:08:28,828 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 13:08:28,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:28,830 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:08:28,830 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:08:28,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:28,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:28,831 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 13:08:28,831 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 13:08:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:28,832 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:08:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:08:28,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:28,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:28,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:28,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:08:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 13:08:28,835 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-11-23 13:08:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:28,835 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-23 13:08:28,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:08:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:08:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:08:28,836 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:28,836 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:28,836 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:28,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:28,837 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2018-11-23 13:08:28,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:28,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:28,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:28,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:28,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:29,291 INFO L256 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2018-11-23 13:08:29,291 INFO L273 TraceCheckUtils]: 1: Hoare triple {1116#true} assume true; {1116#true} is VALID [2018-11-23 13:08:29,291 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1116#true} {1116#true} #31#return; {1116#true} is VALID [2018-11-23 13:08:29,292 INFO L256 TraceCheckUtils]: 3: Hoare triple {1116#true} call #t~ret0 := main(); {1116#true} is VALID [2018-11-23 13:08:29,292 INFO L273 TraceCheckUtils]: 4: Hoare triple {1116#true} ~x~0 := 0; {1118#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:29,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {1118#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1119#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:29,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {1119#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1120#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:29,294 INFO L273 TraceCheckUtils]: 7: Hoare triple {1120#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1121#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:29,295 INFO L273 TraceCheckUtils]: 8: Hoare triple {1121#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1122#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:29,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {1122#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1123#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:29,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {1123#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1124#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:29,302 INFO L273 TraceCheckUtils]: 11: Hoare triple {1124#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1125#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:29,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {1125#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1126#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:29,304 INFO L273 TraceCheckUtils]: 13: Hoare triple {1126#(and (<= main_~x~0 16) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1117#false} is VALID [2018-11-23 13:08:29,304 INFO L256 TraceCheckUtils]: 14: Hoare triple {1117#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1117#false} is VALID [2018-11-23 13:08:29,304 INFO L273 TraceCheckUtils]: 15: Hoare triple {1117#false} ~cond := #in~cond; {1117#false} is VALID [2018-11-23 13:08:29,304 INFO L273 TraceCheckUtils]: 16: Hoare triple {1117#false} assume 0 == ~cond; {1117#false} is VALID [2018-11-23 13:08:29,305 INFO L273 TraceCheckUtils]: 17: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2018-11-23 13:08:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:29,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:29,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:29,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:08:29,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:08:29,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:29,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:29,481 INFO L256 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2018-11-23 13:08:29,482 INFO L273 TraceCheckUtils]: 1: Hoare triple {1116#true} assume true; {1116#true} is VALID [2018-11-23 13:08:29,482 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1116#true} {1116#true} #31#return; {1116#true} is VALID [2018-11-23 13:08:29,482 INFO L256 TraceCheckUtils]: 3: Hoare triple {1116#true} call #t~ret0 := main(); {1116#true} is VALID [2018-11-23 13:08:29,483 INFO L273 TraceCheckUtils]: 4: Hoare triple {1116#true} ~x~0 := 0; {1118#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:29,483 INFO L273 TraceCheckUtils]: 5: Hoare triple {1118#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1119#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:29,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {1119#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1120#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:29,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {1120#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1121#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:29,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {1121#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1122#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:29,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {1122#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1123#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:29,491 INFO L273 TraceCheckUtils]: 10: Hoare triple {1123#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1124#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:29,498 INFO L273 TraceCheckUtils]: 11: Hoare triple {1124#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1125#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:29,499 INFO L273 TraceCheckUtils]: 12: Hoare triple {1125#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1166#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:29,499 INFO L273 TraceCheckUtils]: 13: Hoare triple {1166#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1117#false} is VALID [2018-11-23 13:08:29,500 INFO L256 TraceCheckUtils]: 14: Hoare triple {1117#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1117#false} is VALID [2018-11-23 13:08:29,500 INFO L273 TraceCheckUtils]: 15: Hoare triple {1117#false} ~cond := #in~cond; {1117#false} is VALID [2018-11-23 13:08:29,500 INFO L273 TraceCheckUtils]: 16: Hoare triple {1117#false} assume 0 == ~cond; {1117#false} is VALID [2018-11-23 13:08:29,500 INFO L273 TraceCheckUtils]: 17: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2018-11-23 13:08:29,502 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:29,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:29,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 13:08:29,523 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-23 13:08:29,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:29,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:08:29,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:29,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:08:29,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:08:29,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:08:29,556 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2018-11-23 13:08:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:30,171 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 13:08:30,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:08:30,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-23 13:08:30,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:08:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2018-11-23 13:08:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:08:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2018-11-23 13:08:30,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 25 transitions. [2018-11-23 13:08:30,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:30,201 INFO L225 Difference]: With dead ends: 25 [2018-11-23 13:08:30,201 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:08:30,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:08:30,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:08:30,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:08:30,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:30,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 13:08:30,226 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:08:30,226 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:08:30,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:30,228 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:08:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:08:30,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:30,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:30,229 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:08:30,229 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:08:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:30,230 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:08:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:08:30,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:30,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:30,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:30,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:30,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:08:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-23 13:08:30,232 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-11-23 13:08:30,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:30,232 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-23 13:08:30,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:08:30,232 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:08:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:08:30,233 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:30,233 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:30,233 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:30,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:30,233 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2018-11-23 13:08:30,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:30,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:30,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:30,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:30,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:30,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {1300#true} call ULTIMATE.init(); {1300#true} is VALID [2018-11-23 13:08:30,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {1300#true} assume true; {1300#true} is VALID [2018-11-23 13:08:30,720 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1300#true} {1300#true} #31#return; {1300#true} is VALID [2018-11-23 13:08:30,720 INFO L256 TraceCheckUtils]: 3: Hoare triple {1300#true} call #t~ret0 := main(); {1300#true} is VALID [2018-11-23 13:08:30,721 INFO L273 TraceCheckUtils]: 4: Hoare triple {1300#true} ~x~0 := 0; {1302#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:30,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {1302#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:30,726 INFO L273 TraceCheckUtils]: 6: Hoare triple {1303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1304#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:30,727 INFO L273 TraceCheckUtils]: 7: Hoare triple {1304#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1305#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:30,727 INFO L273 TraceCheckUtils]: 8: Hoare triple {1305#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1306#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:30,729 INFO L273 TraceCheckUtils]: 9: Hoare triple {1306#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1307#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:30,730 INFO L273 TraceCheckUtils]: 10: Hoare triple {1307#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1308#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:30,733 INFO L273 TraceCheckUtils]: 11: Hoare triple {1308#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1309#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:30,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {1309#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1310#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:30,743 INFO L273 TraceCheckUtils]: 13: Hoare triple {1310#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1311#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:30,749 INFO L273 TraceCheckUtils]: 14: Hoare triple {1311#(and (<= main_~x~0 18) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1301#false} is VALID [2018-11-23 13:08:30,749 INFO L256 TraceCheckUtils]: 15: Hoare triple {1301#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1301#false} is VALID [2018-11-23 13:08:30,749 INFO L273 TraceCheckUtils]: 16: Hoare triple {1301#false} ~cond := #in~cond; {1301#false} is VALID [2018-11-23 13:08:30,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {1301#false} assume 0 == ~cond; {1301#false} is VALID [2018-11-23 13:08:30,750 INFO L273 TraceCheckUtils]: 18: Hoare triple {1301#false} assume !false; {1301#false} is VALID [2018-11-23 13:08:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:30,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:30,751 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:30,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:08:43,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 13:08:43,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:43,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:43,979 INFO L256 TraceCheckUtils]: 0: Hoare triple {1300#true} call ULTIMATE.init(); {1300#true} is VALID [2018-11-23 13:08:43,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {1300#true} assume true; {1300#true} is VALID [2018-11-23 13:08:43,980 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1300#true} {1300#true} #31#return; {1300#true} is VALID [2018-11-23 13:08:43,980 INFO L256 TraceCheckUtils]: 3: Hoare triple {1300#true} call #t~ret0 := main(); {1300#true} is VALID [2018-11-23 13:08:43,980 INFO L273 TraceCheckUtils]: 4: Hoare triple {1300#true} ~x~0 := 0; {1302#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:43,981 INFO L273 TraceCheckUtils]: 5: Hoare triple {1302#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:43,981 INFO L273 TraceCheckUtils]: 6: Hoare triple {1303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1304#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:43,982 INFO L273 TraceCheckUtils]: 7: Hoare triple {1304#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1305#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:43,983 INFO L273 TraceCheckUtils]: 8: Hoare triple {1305#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1306#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:43,983 INFO L273 TraceCheckUtils]: 9: Hoare triple {1306#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1307#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:43,985 INFO L273 TraceCheckUtils]: 10: Hoare triple {1307#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1308#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:43,986 INFO L273 TraceCheckUtils]: 11: Hoare triple {1308#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1309#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:43,987 INFO L273 TraceCheckUtils]: 12: Hoare triple {1309#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1310#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:44,006 INFO L273 TraceCheckUtils]: 13: Hoare triple {1310#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1354#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:44,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {1354#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1301#false} is VALID [2018-11-23 13:08:44,015 INFO L256 TraceCheckUtils]: 15: Hoare triple {1301#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1301#false} is VALID [2018-11-23 13:08:44,015 INFO L273 TraceCheckUtils]: 16: Hoare triple {1301#false} ~cond := #in~cond; {1301#false} is VALID [2018-11-23 13:08:44,016 INFO L273 TraceCheckUtils]: 17: Hoare triple {1301#false} assume 0 == ~cond; {1301#false} is VALID [2018-11-23 13:08:44,016 INFO L273 TraceCheckUtils]: 18: Hoare triple {1301#false} assume !false; {1301#false} is VALID [2018-11-23 13:08:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:44,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:44,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 13:08:44,046 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-11-23 13:08:44,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:44,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:08:44,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:44,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:08:44,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:08:44,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:08:44,095 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2018-11-23 13:08:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:44,508 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:08:44,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:08:44,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-11-23 13:08:44,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:44,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:08:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2018-11-23 13:08:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:08:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2018-11-23 13:08:44,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2018-11-23 13:08:44,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:44,570 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:08:44,570 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 13:08:44,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:08:44,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 13:08:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 13:08:44,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:44,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 13:08:44,590 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:08:44,590 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:08:44,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:44,591 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:08:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:08:44,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:44,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:44,592 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:08:44,592 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:08:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:44,593 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:08:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:08:44,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:44,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:44,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:44,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:08:44,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 13:08:44,596 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-11-23 13:08:44,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:44,596 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 13:08:44,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:08:44,596 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:08:44,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:08:44,597 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:44,597 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:44,597 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:44,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:44,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2018-11-23 13:08:44,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:44,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:44,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:44,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:44,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:45,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {1494#true} call ULTIMATE.init(); {1494#true} is VALID [2018-11-23 13:08:45,021 INFO L273 TraceCheckUtils]: 1: Hoare triple {1494#true} assume true; {1494#true} is VALID [2018-11-23 13:08:45,022 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1494#true} {1494#true} #31#return; {1494#true} is VALID [2018-11-23 13:08:45,022 INFO L256 TraceCheckUtils]: 3: Hoare triple {1494#true} call #t~ret0 := main(); {1494#true} is VALID [2018-11-23 13:08:45,023 INFO L273 TraceCheckUtils]: 4: Hoare triple {1494#true} ~x~0 := 0; {1496#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:45,024 INFO L273 TraceCheckUtils]: 5: Hoare triple {1496#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1497#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:45,025 INFO L273 TraceCheckUtils]: 6: Hoare triple {1497#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1498#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:45,026 INFO L273 TraceCheckUtils]: 7: Hoare triple {1498#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1499#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:45,027 INFO L273 TraceCheckUtils]: 8: Hoare triple {1499#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1500#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:45,028 INFO L273 TraceCheckUtils]: 9: Hoare triple {1500#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1501#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:45,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {1501#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1502#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:45,030 INFO L273 TraceCheckUtils]: 11: Hoare triple {1502#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1503#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:45,031 INFO L273 TraceCheckUtils]: 12: Hoare triple {1503#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1504#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:45,032 INFO L273 TraceCheckUtils]: 13: Hoare triple {1504#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1505#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:45,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {1505#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1506#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:45,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {1506#(and (< 0 (+ (div main_~x~0 4294967296) 1)) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 268435455); {1495#false} is VALID [2018-11-23 13:08:45,034 INFO L256 TraceCheckUtils]: 16: Hoare triple {1495#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1495#false} is VALID [2018-11-23 13:08:45,035 INFO L273 TraceCheckUtils]: 17: Hoare triple {1495#false} ~cond := #in~cond; {1495#false} is VALID [2018-11-23 13:08:45,035 INFO L273 TraceCheckUtils]: 18: Hoare triple {1495#false} assume 0 == ~cond; {1495#false} is VALID [2018-11-23 13:08:45,035 INFO L273 TraceCheckUtils]: 19: Hoare triple {1495#false} assume !false; {1495#false} is VALID [2018-11-23 13:08:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:45,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:45,036 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:45,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:08:45,078 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:08:45,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:45,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:45,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {1494#true} call ULTIMATE.init(); {1494#true} is VALID [2018-11-23 13:08:45,336 INFO L273 TraceCheckUtils]: 1: Hoare triple {1494#true} assume true; {1494#true} is VALID [2018-11-23 13:08:45,337 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1494#true} {1494#true} #31#return; {1494#true} is VALID [2018-11-23 13:08:45,337 INFO L256 TraceCheckUtils]: 3: Hoare triple {1494#true} call #t~ret0 := main(); {1494#true} is VALID [2018-11-23 13:08:45,337 INFO L273 TraceCheckUtils]: 4: Hoare triple {1494#true} ~x~0 := 0; {1496#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:45,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {1496#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1497#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:45,339 INFO L273 TraceCheckUtils]: 6: Hoare triple {1497#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1498#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:45,342 INFO L273 TraceCheckUtils]: 7: Hoare triple {1498#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1499#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:45,342 INFO L273 TraceCheckUtils]: 8: Hoare triple {1499#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1500#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:45,343 INFO L273 TraceCheckUtils]: 9: Hoare triple {1500#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1501#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:45,344 INFO L273 TraceCheckUtils]: 10: Hoare triple {1501#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1502#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:45,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {1502#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1503#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:45,346 INFO L273 TraceCheckUtils]: 12: Hoare triple {1503#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1504#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:45,347 INFO L273 TraceCheckUtils]: 13: Hoare triple {1504#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1505#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:45,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {1505#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1552#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:45,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {1552#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 < 268435455); {1495#false} is VALID [2018-11-23 13:08:45,350 INFO L256 TraceCheckUtils]: 16: Hoare triple {1495#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1495#false} is VALID [2018-11-23 13:08:45,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {1495#false} ~cond := #in~cond; {1495#false} is VALID [2018-11-23 13:08:45,350 INFO L273 TraceCheckUtils]: 18: Hoare triple {1495#false} assume 0 == ~cond; {1495#false} is VALID [2018-11-23 13:08:45,351 INFO L273 TraceCheckUtils]: 19: Hoare triple {1495#false} assume !false; {1495#false} is VALID [2018-11-23 13:08:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:45,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:45,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 13:08:45,374 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-11-23 13:08:45,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:45,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:08:45,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:45,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:08:45,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:08:45,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:08:45,397 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2018-11-23 13:08:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:46,009 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 13:08:46,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:08:46,009 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-11-23 13:08:46,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:46,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:08:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2018-11-23 13:08:46,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:08:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2018-11-23 13:08:46,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 27 transitions. [2018-11-23 13:08:46,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:46,106 INFO L225 Difference]: With dead ends: 27 [2018-11-23 13:08:46,106 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:08:46,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:08:46,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:08:46,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 13:08:46,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:46,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 13:08:46,169 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:08:46,169 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:08:46,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:46,170 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:08:46,170 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:08:46,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:46,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:46,171 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:08:46,171 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:08:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:46,172 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:08:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:08:46,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:46,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:46,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:46,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:08:46,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-23 13:08:46,174 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-11-23 13:08:46,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:46,174 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-23 13:08:46,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:08:46,174 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:08:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:08:46,175 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:46,175 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:46,175 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:46,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:46,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2018-11-23 13:08:46,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:46,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:46,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:46,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:46,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:46,517 INFO L256 TraceCheckUtils]: 0: Hoare triple {1698#true} call ULTIMATE.init(); {1698#true} is VALID [2018-11-23 13:08:46,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {1698#true} assume true; {1698#true} is VALID [2018-11-23 13:08:46,518 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1698#true} {1698#true} #31#return; {1698#true} is VALID [2018-11-23 13:08:46,518 INFO L256 TraceCheckUtils]: 3: Hoare triple {1698#true} call #t~ret0 := main(); {1698#true} is VALID [2018-11-23 13:08:46,519 INFO L273 TraceCheckUtils]: 4: Hoare triple {1698#true} ~x~0 := 0; {1700#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:08:46,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {1700#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1701#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:08:46,521 INFO L273 TraceCheckUtils]: 6: Hoare triple {1701#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1702#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:08:46,522 INFO L273 TraceCheckUtils]: 7: Hoare triple {1702#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1703#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:08:46,523 INFO L273 TraceCheckUtils]: 8: Hoare triple {1703#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:08:46,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {1704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1705#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:46,525 INFO L273 TraceCheckUtils]: 10: Hoare triple {1705#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1706#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:46,526 INFO L273 TraceCheckUtils]: 11: Hoare triple {1706#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1707#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:46,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {1707#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1708#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:46,535 INFO L273 TraceCheckUtils]: 13: Hoare triple {1708#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1709#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:46,536 INFO L273 TraceCheckUtils]: 14: Hoare triple {1709#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:46,537 INFO L273 TraceCheckUtils]: 15: Hoare triple {1710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1711#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:46,537 INFO L273 TraceCheckUtils]: 16: Hoare triple {1711#(and (<= main_~x~0 22) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1699#false} is VALID [2018-11-23 13:08:46,538 INFO L256 TraceCheckUtils]: 17: Hoare triple {1699#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1699#false} is VALID [2018-11-23 13:08:46,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {1699#false} ~cond := #in~cond; {1699#false} is VALID [2018-11-23 13:08:46,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {1699#false} assume 0 == ~cond; {1699#false} is VALID [2018-11-23 13:08:46,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {1699#false} assume !false; {1699#false} is VALID [2018-11-23 13:08:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:46,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:46,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:46,550 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:09:12,737 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 13:09:12,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:13,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:13,347 INFO L256 TraceCheckUtils]: 0: Hoare triple {1698#true} call ULTIMATE.init(); {1698#true} is VALID [2018-11-23 13:09:13,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {1698#true} assume true; {1698#true} is VALID [2018-11-23 13:09:13,348 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1698#true} {1698#true} #31#return; {1698#true} is VALID [2018-11-23 13:09:13,348 INFO L256 TraceCheckUtils]: 3: Hoare triple {1698#true} call #t~ret0 := main(); {1698#true} is VALID [2018-11-23 13:09:13,349 INFO L273 TraceCheckUtils]: 4: Hoare triple {1698#true} ~x~0 := 0; {1700#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:13,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {1700#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1701#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:13,353 INFO L273 TraceCheckUtils]: 6: Hoare triple {1701#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1702#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:13,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {1702#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1703#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:13,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {1703#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:13,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {1704#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1705#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:13,356 INFO L273 TraceCheckUtils]: 10: Hoare triple {1705#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1706#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:13,356 INFO L273 TraceCheckUtils]: 11: Hoare triple {1706#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1707#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:13,357 INFO L273 TraceCheckUtils]: 12: Hoare triple {1707#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1708#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:13,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {1708#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1709#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:13,359 INFO L273 TraceCheckUtils]: 14: Hoare triple {1709#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:13,360 INFO L273 TraceCheckUtils]: 15: Hoare triple {1710#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1760#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:13,361 INFO L273 TraceCheckUtils]: 16: Hoare triple {1760#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1699#false} is VALID [2018-11-23 13:09:13,361 INFO L256 TraceCheckUtils]: 17: Hoare triple {1699#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1699#false} is VALID [2018-11-23 13:09:13,362 INFO L273 TraceCheckUtils]: 18: Hoare triple {1699#false} ~cond := #in~cond; {1699#false} is VALID [2018-11-23 13:09:13,362 INFO L273 TraceCheckUtils]: 19: Hoare triple {1699#false} assume 0 == ~cond; {1699#false} is VALID [2018-11-23 13:09:13,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {1699#false} assume !false; {1699#false} is VALID [2018-11-23 13:09:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:13,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:13,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 13:09:13,385 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 13:09:13,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:13,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:09:13,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:13,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:09:13,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:09:13,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:09:13,405 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2018-11-23 13:09:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:13,951 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:09:13,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:09:13,952 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 13:09:13,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:13,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:09:13,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-11-23 13:09:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:09:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-11-23 13:09:13,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2018-11-23 13:09:13,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:13,981 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:09:13,982 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 13:09:13,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:09:13,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 13:09:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 13:09:14,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:14,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 13:09:14,005 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 13:09:14,005 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 13:09:14,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:14,006 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:09:14,006 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:09:14,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:14,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:14,007 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 13:09:14,007 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 13:09:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:14,007 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:09:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:09:14,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:14,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:14,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:14,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:14,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:09:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-23 13:09:14,008 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-11-23 13:09:14,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:14,009 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-23 13:09:14,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:09:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:09:14,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:09:14,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:14,009 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:14,010 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:14,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:14,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2018-11-23 13:09:14,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:14,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:14,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:14,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:14,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:14,409 INFO L256 TraceCheckUtils]: 0: Hoare triple {1912#true} call ULTIMATE.init(); {1912#true} is VALID [2018-11-23 13:09:14,409 INFO L273 TraceCheckUtils]: 1: Hoare triple {1912#true} assume true; {1912#true} is VALID [2018-11-23 13:09:14,409 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1912#true} {1912#true} #31#return; {1912#true} is VALID [2018-11-23 13:09:14,409 INFO L256 TraceCheckUtils]: 3: Hoare triple {1912#true} call #t~ret0 := main(); {1912#true} is VALID [2018-11-23 13:09:14,410 INFO L273 TraceCheckUtils]: 4: Hoare triple {1912#true} ~x~0 := 0; {1914#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:14,410 INFO L273 TraceCheckUtils]: 5: Hoare triple {1914#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1915#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:14,411 INFO L273 TraceCheckUtils]: 6: Hoare triple {1915#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1916#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:14,412 INFO L273 TraceCheckUtils]: 7: Hoare triple {1916#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1917#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:14,412 INFO L273 TraceCheckUtils]: 8: Hoare triple {1917#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1918#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:14,413 INFO L273 TraceCheckUtils]: 9: Hoare triple {1918#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1919#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:14,414 INFO L273 TraceCheckUtils]: 10: Hoare triple {1919#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:14,414 INFO L273 TraceCheckUtils]: 11: Hoare triple {1920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1921#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:14,416 INFO L273 TraceCheckUtils]: 12: Hoare triple {1921#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1922#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:14,417 INFO L273 TraceCheckUtils]: 13: Hoare triple {1922#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1923#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:14,418 INFO L273 TraceCheckUtils]: 14: Hoare triple {1923#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1924#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:14,419 INFO L273 TraceCheckUtils]: 15: Hoare triple {1924#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1925#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:14,424 INFO L273 TraceCheckUtils]: 16: Hoare triple {1925#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1926#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:09:14,425 INFO L273 TraceCheckUtils]: 17: Hoare triple {1926#(and (<= main_~x~0 24) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {1913#false} is VALID [2018-11-23 13:09:14,425 INFO L256 TraceCheckUtils]: 18: Hoare triple {1913#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1913#false} is VALID [2018-11-23 13:09:14,426 INFO L273 TraceCheckUtils]: 19: Hoare triple {1913#false} ~cond := #in~cond; {1913#false} is VALID [2018-11-23 13:09:14,426 INFO L273 TraceCheckUtils]: 20: Hoare triple {1913#false} assume 0 == ~cond; {1913#false} is VALID [2018-11-23 13:09:14,426 INFO L273 TraceCheckUtils]: 21: Hoare triple {1913#false} assume !false; {1913#false} is VALID [2018-11-23 13:09:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:14,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:14,427 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:14,450 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:09:14,508 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:09:14,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:14,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:14,695 INFO L256 TraceCheckUtils]: 0: Hoare triple {1912#true} call ULTIMATE.init(); {1912#true} is VALID [2018-11-23 13:09:14,696 INFO L273 TraceCheckUtils]: 1: Hoare triple {1912#true} assume true; {1912#true} is VALID [2018-11-23 13:09:14,696 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1912#true} {1912#true} #31#return; {1912#true} is VALID [2018-11-23 13:09:14,696 INFO L256 TraceCheckUtils]: 3: Hoare triple {1912#true} call #t~ret0 := main(); {1912#true} is VALID [2018-11-23 13:09:14,697 INFO L273 TraceCheckUtils]: 4: Hoare triple {1912#true} ~x~0 := 0; {1914#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:14,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {1914#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1915#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:14,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {1915#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1916#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:14,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {1916#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1917#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:14,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {1917#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1918#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:14,701 INFO L273 TraceCheckUtils]: 9: Hoare triple {1918#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1919#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:14,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {1919#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:14,703 INFO L273 TraceCheckUtils]: 11: Hoare triple {1920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1921#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:14,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {1921#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1922#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:14,705 INFO L273 TraceCheckUtils]: 13: Hoare triple {1922#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1923#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:14,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {1923#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1924#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:14,707 INFO L273 TraceCheckUtils]: 15: Hoare triple {1924#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1925#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:14,708 INFO L273 TraceCheckUtils]: 16: Hoare triple {1925#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1978#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:14,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {1978#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1913#false} is VALID [2018-11-23 13:09:14,709 INFO L256 TraceCheckUtils]: 18: Hoare triple {1913#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1913#false} is VALID [2018-11-23 13:09:14,709 INFO L273 TraceCheckUtils]: 19: Hoare triple {1913#false} ~cond := #in~cond; {1913#false} is VALID [2018-11-23 13:09:14,709 INFO L273 TraceCheckUtils]: 20: Hoare triple {1913#false} assume 0 == ~cond; {1913#false} is VALID [2018-11-23 13:09:14,710 INFO L273 TraceCheckUtils]: 21: Hoare triple {1913#false} assume !false; {1913#false} is VALID [2018-11-23 13:09:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:14,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:14,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 13:09:14,732 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-23 13:09:14,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:14,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:09:14,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:14,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:09:14,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:09:14,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:09:14,752 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2018-11-23 13:09:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:15,366 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:09:15,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:09:15,367 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-23 13:09:15,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:09:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2018-11-23 13:09:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:09:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2018-11-23 13:09:15,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 29 transitions. [2018-11-23 13:09:15,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:15,403 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:09:15,404 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 13:09:15,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:09:15,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 13:09:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 13:09:15,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:15,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 13:09:15,428 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 13:09:15,428 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 13:09:15,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:15,429 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:09:15,429 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:09:15,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:15,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:15,430 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 13:09:15,430 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 13:09:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:15,431 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:09:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:09:15,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:15,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:15,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:15,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:15,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:09:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-23 13:09:15,433 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-11-23 13:09:15,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:15,433 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-23 13:09:15,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:09:15,433 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:09:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:09:15,434 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:15,434 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:15,434 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:15,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:15,435 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2018-11-23 13:09:15,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:15,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:15,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:15,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:15,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:15,918 INFO L256 TraceCheckUtils]: 0: Hoare triple {2136#true} call ULTIMATE.init(); {2136#true} is VALID [2018-11-23 13:09:15,919 INFO L273 TraceCheckUtils]: 1: Hoare triple {2136#true} assume true; {2136#true} is VALID [2018-11-23 13:09:15,919 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2136#true} {2136#true} #31#return; {2136#true} is VALID [2018-11-23 13:09:15,919 INFO L256 TraceCheckUtils]: 3: Hoare triple {2136#true} call #t~ret0 := main(); {2136#true} is VALID [2018-11-23 13:09:15,920 INFO L273 TraceCheckUtils]: 4: Hoare triple {2136#true} ~x~0 := 0; {2138#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:15,921 INFO L273 TraceCheckUtils]: 5: Hoare triple {2138#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:15,922 INFO L273 TraceCheckUtils]: 6: Hoare triple {2139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2140#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:15,924 INFO L273 TraceCheckUtils]: 7: Hoare triple {2140#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2141#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:15,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {2141#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2142#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:15,926 INFO L273 TraceCheckUtils]: 9: Hoare triple {2142#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2143#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:15,927 INFO L273 TraceCheckUtils]: 10: Hoare triple {2143#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2144#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:15,928 INFO L273 TraceCheckUtils]: 11: Hoare triple {2144#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2145#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:15,929 INFO L273 TraceCheckUtils]: 12: Hoare triple {2145#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2146#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:15,930 INFO L273 TraceCheckUtils]: 13: Hoare triple {2146#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2147#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:15,931 INFO L273 TraceCheckUtils]: 14: Hoare triple {2147#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2148#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:15,933 INFO L273 TraceCheckUtils]: 15: Hoare triple {2148#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2149#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:15,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {2149#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2150#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:15,935 INFO L273 TraceCheckUtils]: 17: Hoare triple {2150#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2151#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:09:15,936 INFO L273 TraceCheckUtils]: 18: Hoare triple {2151#(and (<= main_~x~0 26) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2137#false} is VALID [2018-11-23 13:09:15,936 INFO L256 TraceCheckUtils]: 19: Hoare triple {2137#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2137#false} is VALID [2018-11-23 13:09:15,936 INFO L273 TraceCheckUtils]: 20: Hoare triple {2137#false} ~cond := #in~cond; {2137#false} is VALID [2018-11-23 13:09:15,937 INFO L273 TraceCheckUtils]: 21: Hoare triple {2137#false} assume 0 == ~cond; {2137#false} is VALID [2018-11-23 13:09:15,937 INFO L273 TraceCheckUtils]: 22: Hoare triple {2137#false} assume !false; {2137#false} is VALID [2018-11-23 13:09:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:15,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:15,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:15,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:15,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:16,096 INFO L256 TraceCheckUtils]: 0: Hoare triple {2136#true} call ULTIMATE.init(); {2136#true} is VALID [2018-11-23 13:09:16,096 INFO L273 TraceCheckUtils]: 1: Hoare triple {2136#true} assume true; {2136#true} is VALID [2018-11-23 13:09:16,096 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2136#true} {2136#true} #31#return; {2136#true} is VALID [2018-11-23 13:09:16,097 INFO L256 TraceCheckUtils]: 3: Hoare triple {2136#true} call #t~ret0 := main(); {2136#true} is VALID [2018-11-23 13:09:16,098 INFO L273 TraceCheckUtils]: 4: Hoare triple {2136#true} ~x~0 := 0; {2138#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:16,099 INFO L273 TraceCheckUtils]: 5: Hoare triple {2138#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:16,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {2139#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2140#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:16,103 INFO L273 TraceCheckUtils]: 7: Hoare triple {2140#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2141#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:16,103 INFO L273 TraceCheckUtils]: 8: Hoare triple {2141#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2142#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:16,104 INFO L273 TraceCheckUtils]: 9: Hoare triple {2142#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2143#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:16,105 INFO L273 TraceCheckUtils]: 10: Hoare triple {2143#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2144#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:16,106 INFO L273 TraceCheckUtils]: 11: Hoare triple {2144#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2145#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:16,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {2145#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2146#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:16,108 INFO L273 TraceCheckUtils]: 13: Hoare triple {2146#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2147#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:16,109 INFO L273 TraceCheckUtils]: 14: Hoare triple {2147#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2148#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:16,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {2148#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2149#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:16,111 INFO L273 TraceCheckUtils]: 16: Hoare triple {2149#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2150#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:16,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {2150#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2206#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:16,113 INFO L273 TraceCheckUtils]: 18: Hoare triple {2206#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2137#false} is VALID [2018-11-23 13:09:16,114 INFO L256 TraceCheckUtils]: 19: Hoare triple {2137#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2137#false} is VALID [2018-11-23 13:09:16,114 INFO L273 TraceCheckUtils]: 20: Hoare triple {2137#false} ~cond := #in~cond; {2137#false} is VALID [2018-11-23 13:09:16,114 INFO L273 TraceCheckUtils]: 21: Hoare triple {2137#false} assume 0 == ~cond; {2137#false} is VALID [2018-11-23 13:09:16,114 INFO L273 TraceCheckUtils]: 22: Hoare triple {2137#false} assume !false; {2137#false} is VALID [2018-11-23 13:09:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:16,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:16,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 13:09:16,136 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-23 13:09:16,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:16,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:09:16,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:16,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:09:16,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:09:16,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:09:16,160 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2018-11-23 13:09:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:16,865 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:09:16,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:09:16,865 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-23 13:09:16,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:09:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2018-11-23 13:09:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:09:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2018-11-23 13:09:16,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2018-11-23 13:09:16,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:16,899 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:09:16,899 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:09:16,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:09:16,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:09:16,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 13:09:16,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:16,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 13:09:16,976 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:09:16,976 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:09:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:16,977 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 13:09:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:09:16,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:16,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:16,978 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:09:16,978 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:09:16,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:16,980 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 13:09:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:09:16,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:16,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:16,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:16,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:09:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-23 13:09:16,981 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-11-23 13:09:16,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:16,982 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-23 13:09:16,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:09:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:09:16,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:09:16,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:16,983 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:16,983 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:16,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:16,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2018-11-23 13:09:16,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:16,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:16,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:17,701 INFO L256 TraceCheckUtils]: 0: Hoare triple {2370#true} call ULTIMATE.init(); {2370#true} is VALID [2018-11-23 13:09:17,702 INFO L273 TraceCheckUtils]: 1: Hoare triple {2370#true} assume true; {2370#true} is VALID [2018-11-23 13:09:17,702 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2370#true} {2370#true} #31#return; {2370#true} is VALID [2018-11-23 13:09:17,702 INFO L256 TraceCheckUtils]: 3: Hoare triple {2370#true} call #t~ret0 := main(); {2370#true} is VALID [2018-11-23 13:09:17,716 INFO L273 TraceCheckUtils]: 4: Hoare triple {2370#true} ~x~0 := 0; {2372#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:17,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {2372#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2373#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:17,738 INFO L273 TraceCheckUtils]: 6: Hoare triple {2373#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2374#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:17,746 INFO L273 TraceCheckUtils]: 7: Hoare triple {2374#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2375#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:17,747 INFO L273 TraceCheckUtils]: 8: Hoare triple {2375#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2376#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:17,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {2376#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2377#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:17,748 INFO L273 TraceCheckUtils]: 10: Hoare triple {2377#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2378#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:17,750 INFO L273 TraceCheckUtils]: 11: Hoare triple {2378#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2379#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:17,750 INFO L273 TraceCheckUtils]: 12: Hoare triple {2379#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2380#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:17,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {2380#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2381#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:17,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {2381#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2382#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:17,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {2382#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2383#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:17,755 INFO L273 TraceCheckUtils]: 16: Hoare triple {2383#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2384#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:17,756 INFO L273 TraceCheckUtils]: 17: Hoare triple {2384#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2385#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:17,757 INFO L273 TraceCheckUtils]: 18: Hoare triple {2385#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2386#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:09:17,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {2386#(and (<= main_~x~0 28) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2371#false} is VALID [2018-11-23 13:09:17,758 INFO L256 TraceCheckUtils]: 20: Hoare triple {2371#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2371#false} is VALID [2018-11-23 13:09:17,758 INFO L273 TraceCheckUtils]: 21: Hoare triple {2371#false} ~cond := #in~cond; {2371#false} is VALID [2018-11-23 13:09:17,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {2371#false} assume 0 == ~cond; {2371#false} is VALID [2018-11-23 13:09:17,759 INFO L273 TraceCheckUtils]: 23: Hoare triple {2371#false} assume !false; {2371#false} is VALID [2018-11-23 13:09:17,761 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:17,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:17,761 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:17,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:09:17,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:09:17,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:17,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:17,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {2370#true} call ULTIMATE.init(); {2370#true} is VALID [2018-11-23 13:09:17,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {2370#true} assume true; {2370#true} is VALID [2018-11-23 13:09:17,934 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2370#true} {2370#true} #31#return; {2370#true} is VALID [2018-11-23 13:09:17,934 INFO L256 TraceCheckUtils]: 3: Hoare triple {2370#true} call #t~ret0 := main(); {2370#true} is VALID [2018-11-23 13:09:17,934 INFO L273 TraceCheckUtils]: 4: Hoare triple {2370#true} ~x~0 := 0; {2372#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:17,935 INFO L273 TraceCheckUtils]: 5: Hoare triple {2372#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2373#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:17,936 INFO L273 TraceCheckUtils]: 6: Hoare triple {2373#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2374#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:17,936 INFO L273 TraceCheckUtils]: 7: Hoare triple {2374#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2375#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:17,937 INFO L273 TraceCheckUtils]: 8: Hoare triple {2375#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2376#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:17,939 INFO L273 TraceCheckUtils]: 9: Hoare triple {2376#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2377#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:17,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {2377#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2378#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:17,941 INFO L273 TraceCheckUtils]: 11: Hoare triple {2378#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2379#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:17,942 INFO L273 TraceCheckUtils]: 12: Hoare triple {2379#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2380#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:17,943 INFO L273 TraceCheckUtils]: 13: Hoare triple {2380#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2381#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:17,944 INFO L273 TraceCheckUtils]: 14: Hoare triple {2381#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2382#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:17,945 INFO L273 TraceCheckUtils]: 15: Hoare triple {2382#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2383#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:17,946 INFO L273 TraceCheckUtils]: 16: Hoare triple {2383#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2384#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:17,947 INFO L273 TraceCheckUtils]: 17: Hoare triple {2384#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2385#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:17,948 INFO L273 TraceCheckUtils]: 18: Hoare triple {2385#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2444#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:17,949 INFO L273 TraceCheckUtils]: 19: Hoare triple {2444#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2371#false} is VALID [2018-11-23 13:09:17,949 INFO L256 TraceCheckUtils]: 20: Hoare triple {2371#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2371#false} is VALID [2018-11-23 13:09:17,949 INFO L273 TraceCheckUtils]: 21: Hoare triple {2371#false} ~cond := #in~cond; {2371#false} is VALID [2018-11-23 13:09:17,949 INFO L273 TraceCheckUtils]: 22: Hoare triple {2371#false} assume 0 == ~cond; {2371#false} is VALID [2018-11-23 13:09:17,950 INFO L273 TraceCheckUtils]: 23: Hoare triple {2371#false} assume !false; {2371#false} is VALID [2018-11-23 13:09:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:17,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:17,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 13:09:17,970 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-11-23 13:09:17,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:17,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 13:09:17,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:17,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 13:09:17,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:09:17,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:09:17,993 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2018-11-23 13:09:18,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:18,702 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:09:18,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:09:18,702 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-11-23 13:09:18,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:09:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-11-23 13:09:18,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:09:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-11-23 13:09:18,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2018-11-23 13:09:18,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:18,736 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:09:18,736 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:09:18,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:09:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:09:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 13:09:18,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:18,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 13:09:18,763 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 13:09:18,763 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 13:09:18,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:18,765 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:09:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:09:18,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:18,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:18,765 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 13:09:18,765 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 13:09:18,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:18,766 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:09:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:09:18,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:18,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:18,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:18,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:09:18,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-23 13:09:18,768 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-11-23 13:09:18,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:18,768 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-23 13:09:18,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 13:09:18,768 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:09:18,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:09:18,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:18,769 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:18,769 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:18,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:18,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2018-11-23 13:09:18,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:18,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:18,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:18,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:18,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:19,337 INFO L256 TraceCheckUtils]: 0: Hoare triple {2614#true} call ULTIMATE.init(); {2614#true} is VALID [2018-11-23 13:09:19,337 INFO L273 TraceCheckUtils]: 1: Hoare triple {2614#true} assume true; {2614#true} is VALID [2018-11-23 13:09:19,338 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2614#true} {2614#true} #31#return; {2614#true} is VALID [2018-11-23 13:09:19,338 INFO L256 TraceCheckUtils]: 3: Hoare triple {2614#true} call #t~ret0 := main(); {2614#true} is VALID [2018-11-23 13:09:19,349 INFO L273 TraceCheckUtils]: 4: Hoare triple {2614#true} ~x~0 := 0; {2616#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:19,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {2616#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2617#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:19,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {2617#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2618#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:19,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {2618#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2619#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:19,353 INFO L273 TraceCheckUtils]: 8: Hoare triple {2619#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2620#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:19,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {2620#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2621#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:19,354 INFO L273 TraceCheckUtils]: 10: Hoare triple {2621#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2622#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:19,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {2622#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2623#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:19,369 INFO L273 TraceCheckUtils]: 12: Hoare triple {2623#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2624#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:19,370 INFO L273 TraceCheckUtils]: 13: Hoare triple {2624#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2625#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:19,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {2625#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2626#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:19,371 INFO L273 TraceCheckUtils]: 15: Hoare triple {2626#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2627#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:19,372 INFO L273 TraceCheckUtils]: 16: Hoare triple {2627#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2628#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:19,373 INFO L273 TraceCheckUtils]: 17: Hoare triple {2628#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2629#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:19,374 INFO L273 TraceCheckUtils]: 18: Hoare triple {2629#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2630#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:19,375 INFO L273 TraceCheckUtils]: 19: Hoare triple {2630#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2631#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:09:19,376 INFO L273 TraceCheckUtils]: 20: Hoare triple {2631#(and (<= main_~x~0 30) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2615#false} is VALID [2018-11-23 13:09:19,376 INFO L256 TraceCheckUtils]: 21: Hoare triple {2615#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2615#false} is VALID [2018-11-23 13:09:19,376 INFO L273 TraceCheckUtils]: 22: Hoare triple {2615#false} ~cond := #in~cond; {2615#false} is VALID [2018-11-23 13:09:19,377 INFO L273 TraceCheckUtils]: 23: Hoare triple {2615#false} assume 0 == ~cond; {2615#false} is VALID [2018-11-23 13:09:19,377 INFO L273 TraceCheckUtils]: 24: Hoare triple {2615#false} assume !false; {2615#false} is VALID [2018-11-23 13:09:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:19,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:19,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:19,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:09:32,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 13:09:32,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:32,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:32,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {2614#true} call ULTIMATE.init(); {2614#true} is VALID [2018-11-23 13:09:32,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {2614#true} assume true; {2614#true} is VALID [2018-11-23 13:09:32,716 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2614#true} {2614#true} #31#return; {2614#true} is VALID [2018-11-23 13:09:32,716 INFO L256 TraceCheckUtils]: 3: Hoare triple {2614#true} call #t~ret0 := main(); {2614#true} is VALID [2018-11-23 13:09:32,717 INFO L273 TraceCheckUtils]: 4: Hoare triple {2614#true} ~x~0 := 0; {2616#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:32,718 INFO L273 TraceCheckUtils]: 5: Hoare triple {2616#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2617#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:32,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {2617#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2618#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:32,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {2618#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2619#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:32,720 INFO L273 TraceCheckUtils]: 8: Hoare triple {2619#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2620#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:32,721 INFO L273 TraceCheckUtils]: 9: Hoare triple {2620#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2621#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:32,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {2621#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2622#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:32,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {2622#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2623#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:32,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {2623#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2624#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:32,725 INFO L273 TraceCheckUtils]: 13: Hoare triple {2624#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2625#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:32,726 INFO L273 TraceCheckUtils]: 14: Hoare triple {2625#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2626#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:32,727 INFO L273 TraceCheckUtils]: 15: Hoare triple {2626#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2627#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:32,728 INFO L273 TraceCheckUtils]: 16: Hoare triple {2627#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2628#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:32,729 INFO L273 TraceCheckUtils]: 17: Hoare triple {2628#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2629#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:32,730 INFO L273 TraceCheckUtils]: 18: Hoare triple {2629#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2630#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:32,731 INFO L273 TraceCheckUtils]: 19: Hoare triple {2630#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2692#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:09:32,731 INFO L273 TraceCheckUtils]: 20: Hoare triple {2692#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(~x~0 % 4294967296 < 268435455); {2615#false} is VALID [2018-11-23 13:09:32,732 INFO L256 TraceCheckUtils]: 21: Hoare triple {2615#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2615#false} is VALID [2018-11-23 13:09:32,732 INFO L273 TraceCheckUtils]: 22: Hoare triple {2615#false} ~cond := #in~cond; {2615#false} is VALID [2018-11-23 13:09:32,732 INFO L273 TraceCheckUtils]: 23: Hoare triple {2615#false} assume 0 == ~cond; {2615#false} is VALID [2018-11-23 13:09:32,732 INFO L273 TraceCheckUtils]: 24: Hoare triple {2615#false} assume !false; {2615#false} is VALID [2018-11-23 13:09:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:32,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:32,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 13:09:32,754 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2018-11-23 13:09:32,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:32,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:09:32,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:32,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:09:32,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:09:32,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:09:32,778 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2018-11-23 13:09:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:33,535 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:09:33,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:09:33,535 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2018-11-23 13:09:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:09:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2018-11-23 13:09:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:09:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2018-11-23 13:09:33,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2018-11-23 13:09:33,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:33,567 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:09:33,568 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 13:09:33,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:09:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 13:09:33,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 13:09:33,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:33,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 13:09:33,591 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 13:09:33,591 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 13:09:33,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:33,592 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 13:09:33,592 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:09:33,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:33,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:33,593 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 13:09:33,593 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 13:09:33,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:33,594 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 13:09:33,594 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:09:33,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:33,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:33,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:33,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:33,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:09:33,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 13:09:33,595 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-11-23 13:09:33,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:33,595 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 13:09:33,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:09:33,595 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:09:33,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:09:33,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:33,596 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:33,596 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:33,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:33,596 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2018-11-23 13:09:33,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:33,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:33,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:33,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:33,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:34,037 INFO L256 TraceCheckUtils]: 0: Hoare triple {2868#true} call ULTIMATE.init(); {2868#true} is VALID [2018-11-23 13:09:34,038 INFO L273 TraceCheckUtils]: 1: Hoare triple {2868#true} assume true; {2868#true} is VALID [2018-11-23 13:09:34,038 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2868#true} {2868#true} #31#return; {2868#true} is VALID [2018-11-23 13:09:34,038 INFO L256 TraceCheckUtils]: 3: Hoare triple {2868#true} call #t~ret0 := main(); {2868#true} is VALID [2018-11-23 13:09:34,038 INFO L273 TraceCheckUtils]: 4: Hoare triple {2868#true} ~x~0 := 0; {2870#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:34,039 INFO L273 TraceCheckUtils]: 5: Hoare triple {2870#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:34,040 INFO L273 TraceCheckUtils]: 6: Hoare triple {2871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2872#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:34,040 INFO L273 TraceCheckUtils]: 7: Hoare triple {2872#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2873#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:34,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {2873#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2874#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:34,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {2874#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2875#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:34,043 INFO L273 TraceCheckUtils]: 10: Hoare triple {2875#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2876#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:34,044 INFO L273 TraceCheckUtils]: 11: Hoare triple {2876#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2877#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:34,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {2877#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2878#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:34,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {2878#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2879#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:34,047 INFO L273 TraceCheckUtils]: 14: Hoare triple {2879#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2880#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:34,048 INFO L273 TraceCheckUtils]: 15: Hoare triple {2880#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2881#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:34,049 INFO L273 TraceCheckUtils]: 16: Hoare triple {2881#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2882#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:34,050 INFO L273 TraceCheckUtils]: 17: Hoare triple {2882#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2883#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:34,051 INFO L273 TraceCheckUtils]: 18: Hoare triple {2883#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2884#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:34,052 INFO L273 TraceCheckUtils]: 19: Hoare triple {2884#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2885#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:09:34,053 INFO L273 TraceCheckUtils]: 20: Hoare triple {2885#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2886#(and (<= main_~x~0 32) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:09:34,054 INFO L273 TraceCheckUtils]: 21: Hoare triple {2886#(and (<= main_~x~0 32) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {2869#false} is VALID [2018-11-23 13:09:34,055 INFO L256 TraceCheckUtils]: 22: Hoare triple {2869#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2869#false} is VALID [2018-11-23 13:09:34,055 INFO L273 TraceCheckUtils]: 23: Hoare triple {2869#false} ~cond := #in~cond; {2869#false} is VALID [2018-11-23 13:09:34,055 INFO L273 TraceCheckUtils]: 24: Hoare triple {2869#false} assume 0 == ~cond; {2869#false} is VALID [2018-11-23 13:09:34,055 INFO L273 TraceCheckUtils]: 25: Hoare triple {2869#false} assume !false; {2869#false} is VALID [2018-11-23 13:09:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:34,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:34,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:34,067 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:09:34,077 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:09:34,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:34,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:34,257 INFO L256 TraceCheckUtils]: 0: Hoare triple {2868#true} call ULTIMATE.init(); {2868#true} is VALID [2018-11-23 13:09:34,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {2868#true} assume true; {2868#true} is VALID [2018-11-23 13:09:34,257 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2868#true} {2868#true} #31#return; {2868#true} is VALID [2018-11-23 13:09:34,257 INFO L256 TraceCheckUtils]: 3: Hoare triple {2868#true} call #t~ret0 := main(); {2868#true} is VALID [2018-11-23 13:09:34,258 INFO L273 TraceCheckUtils]: 4: Hoare triple {2868#true} ~x~0 := 0; {2870#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:34,259 INFO L273 TraceCheckUtils]: 5: Hoare triple {2870#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:34,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {2871#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2872#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:34,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {2872#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2873#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:34,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {2873#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2874#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:34,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {2874#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2875#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:34,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {2875#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2876#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:34,263 INFO L273 TraceCheckUtils]: 11: Hoare triple {2876#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2877#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:34,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {2877#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2878#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:34,265 INFO L273 TraceCheckUtils]: 13: Hoare triple {2878#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2879#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:34,266 INFO L273 TraceCheckUtils]: 14: Hoare triple {2879#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2880#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:34,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {2880#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2881#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:34,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {2881#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2882#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:34,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {2882#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2883#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:34,270 INFO L273 TraceCheckUtils]: 18: Hoare triple {2883#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2884#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:34,271 INFO L273 TraceCheckUtils]: 19: Hoare triple {2884#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2885#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:09:34,272 INFO L273 TraceCheckUtils]: 20: Hoare triple {2885#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2950#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:09:34,273 INFO L273 TraceCheckUtils]: 21: Hoare triple {2950#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2869#false} is VALID [2018-11-23 13:09:34,273 INFO L256 TraceCheckUtils]: 22: Hoare triple {2869#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2869#false} is VALID [2018-11-23 13:09:34,273 INFO L273 TraceCheckUtils]: 23: Hoare triple {2869#false} ~cond := #in~cond; {2869#false} is VALID [2018-11-23 13:09:34,273 INFO L273 TraceCheckUtils]: 24: Hoare triple {2869#false} assume 0 == ~cond; {2869#false} is VALID [2018-11-23 13:09:34,274 INFO L273 TraceCheckUtils]: 25: Hoare triple {2869#false} assume !false; {2869#false} is VALID [2018-11-23 13:09:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:34,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:34,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 13:09:34,296 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-11-23 13:09:34,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:34,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:09:34,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:34,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:09:34,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:09:34,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:09:34,321 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2018-11-23 13:09:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:35,122 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 13:09:35,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:09:35,122 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-11-23 13:09:35,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:09:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2018-11-23 13:09:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:09:35,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2018-11-23 13:09:35,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 33 transitions. [2018-11-23 13:09:35,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:35,157 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:09:35,157 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:09:35,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:09:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:09:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:09:35,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:35,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 13:09:35,191 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:09:35,191 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:09:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:35,193 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:09:35,193 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:09:35,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:35,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:35,194 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:09:35,194 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:09:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:35,195 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:09:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:09:35,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:35,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:35,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:35,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:09:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-23 13:09:35,196 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-11-23 13:09:35,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:35,197 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-23 13:09:35,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:09:35,197 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:09:35,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:09:35,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:35,198 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:35,198 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:35,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:35,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2018-11-23 13:09:35,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:35,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:35,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:35,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:35,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:35,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {3132#true} call ULTIMATE.init(); {3132#true} is VALID [2018-11-23 13:09:35,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {3132#true} assume true; {3132#true} is VALID [2018-11-23 13:09:35,712 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3132#true} {3132#true} #31#return; {3132#true} is VALID [2018-11-23 13:09:35,712 INFO L256 TraceCheckUtils]: 3: Hoare triple {3132#true} call #t~ret0 := main(); {3132#true} is VALID [2018-11-23 13:09:35,739 INFO L273 TraceCheckUtils]: 4: Hoare triple {3132#true} ~x~0 := 0; {3134#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:09:35,740 INFO L273 TraceCheckUtils]: 5: Hoare triple {3134#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3135#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:09:35,740 INFO L273 TraceCheckUtils]: 6: Hoare triple {3135#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3136#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:09:35,741 INFO L273 TraceCheckUtils]: 7: Hoare triple {3136#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3137#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:09:35,742 INFO L273 TraceCheckUtils]: 8: Hoare triple {3137#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:09:35,742 INFO L273 TraceCheckUtils]: 9: Hoare triple {3138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:09:35,743 INFO L273 TraceCheckUtils]: 10: Hoare triple {3139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3140#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:09:35,744 INFO L273 TraceCheckUtils]: 11: Hoare triple {3140#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3141#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:09:35,745 INFO L273 TraceCheckUtils]: 12: Hoare triple {3141#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3142#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:09:35,746 INFO L273 TraceCheckUtils]: 13: Hoare triple {3142#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3143#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:09:35,747 INFO L273 TraceCheckUtils]: 14: Hoare triple {3143#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3144#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:09:35,748 INFO L273 TraceCheckUtils]: 15: Hoare triple {3144#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3145#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:09:35,749 INFO L273 TraceCheckUtils]: 16: Hoare triple {3145#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3146#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:09:35,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {3146#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3147#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:09:35,751 INFO L273 TraceCheckUtils]: 18: Hoare triple {3147#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3148#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:09:35,752 INFO L273 TraceCheckUtils]: 19: Hoare triple {3148#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3149#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:09:35,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {3149#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3150#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:09:35,754 INFO L273 TraceCheckUtils]: 21: Hoare triple {3150#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3151#(and (<= main_~x~0 34) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:09:35,755 INFO L273 TraceCheckUtils]: 22: Hoare triple {3151#(and (<= main_~x~0 34) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {3133#false} is VALID [2018-11-23 13:09:35,755 INFO L256 TraceCheckUtils]: 23: Hoare triple {3133#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3133#false} is VALID [2018-11-23 13:09:35,755 INFO L273 TraceCheckUtils]: 24: Hoare triple {3133#false} ~cond := #in~cond; {3133#false} is VALID [2018-11-23 13:09:35,755 INFO L273 TraceCheckUtils]: 25: Hoare triple {3133#false} assume 0 == ~cond; {3133#false} is VALID [2018-11-23 13:09:35,755 INFO L273 TraceCheckUtils]: 26: Hoare triple {3133#false} assume !false; {3133#false} is VALID [2018-11-23 13:09:35,757 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:35,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:35,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:35,766 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:10:27,928 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 13:10:27,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:27,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:28,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {3132#true} call ULTIMATE.init(); {3132#true} is VALID [2018-11-23 13:10:28,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {3132#true} assume true; {3132#true} is VALID [2018-11-23 13:10:28,114 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3132#true} {3132#true} #31#return; {3132#true} is VALID [2018-11-23 13:10:28,114 INFO L256 TraceCheckUtils]: 3: Hoare triple {3132#true} call #t~ret0 := main(); {3132#true} is VALID [2018-11-23 13:10:28,114 INFO L273 TraceCheckUtils]: 4: Hoare triple {3132#true} ~x~0 := 0; {3134#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:10:28,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {3134#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3135#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:10:28,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {3135#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3136#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:10:28,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {3136#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3137#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:10:28,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {3137#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:10:28,118 INFO L273 TraceCheckUtils]: 9: Hoare triple {3138#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:10:28,119 INFO L273 TraceCheckUtils]: 10: Hoare triple {3139#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3140#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:10:28,120 INFO L273 TraceCheckUtils]: 11: Hoare triple {3140#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3141#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:10:28,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {3141#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3142#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:10:28,122 INFO L273 TraceCheckUtils]: 13: Hoare triple {3142#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3143#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:10:28,123 INFO L273 TraceCheckUtils]: 14: Hoare triple {3143#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3144#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:10:28,124 INFO L273 TraceCheckUtils]: 15: Hoare triple {3144#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3145#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:10:28,125 INFO L273 TraceCheckUtils]: 16: Hoare triple {3145#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3146#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:10:28,126 INFO L273 TraceCheckUtils]: 17: Hoare triple {3146#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3147#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:10:28,127 INFO L273 TraceCheckUtils]: 18: Hoare triple {3147#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3148#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:10:28,128 INFO L273 TraceCheckUtils]: 19: Hoare triple {3148#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3149#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:10:28,129 INFO L273 TraceCheckUtils]: 20: Hoare triple {3149#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3150#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:10:28,130 INFO L273 TraceCheckUtils]: 21: Hoare triple {3150#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3218#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:10:28,131 INFO L273 TraceCheckUtils]: 22: Hoare triple {3218#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !(~x~0 % 4294967296 < 268435455); {3133#false} is VALID [2018-11-23 13:10:28,131 INFO L256 TraceCheckUtils]: 23: Hoare triple {3133#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3133#false} is VALID [2018-11-23 13:10:28,131 INFO L273 TraceCheckUtils]: 24: Hoare triple {3133#false} ~cond := #in~cond; {3133#false} is VALID [2018-11-23 13:10:28,131 INFO L273 TraceCheckUtils]: 25: Hoare triple {3133#false} assume 0 == ~cond; {3133#false} is VALID [2018-11-23 13:10:28,132 INFO L273 TraceCheckUtils]: 26: Hoare triple {3133#false} assume !false; {3133#false} is VALID [2018-11-23 13:10:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:28,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:28,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 13:10:28,154 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-11-23 13:10:28,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:28,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 13:10:28,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:28,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:10:28,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:10:28,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:10:28,179 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2018-11-23 13:10:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:29,246 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:10:29,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:10:29,246 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-11-23 13:10:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:10:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2018-11-23 13:10:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:10:29,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2018-11-23 13:10:29,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2018-11-23 13:10:29,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:29,278 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:10:29,278 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:10:29,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:10:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:10:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 13:10:29,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:29,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 13:10:29,357 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:10:29,357 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:10:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:29,358 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:10:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:10:29,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:29,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:29,359 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:10:29,359 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:10:29,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:29,360 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:10:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:10:29,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:29,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:29,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:29,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:10:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-23 13:10:29,362 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-11-23 13:10:29,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:29,362 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-23 13:10:29,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:10:29,362 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:10:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:10:29,363 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:29,363 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:29,363 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:29,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:29,363 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2018-11-23 13:10:29,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:29,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:29,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:29,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:29,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:29,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {3406#true} call ULTIMATE.init(); {3406#true} is VALID [2018-11-23 13:10:29,855 INFO L273 TraceCheckUtils]: 1: Hoare triple {3406#true} assume true; {3406#true} is VALID [2018-11-23 13:10:29,856 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3406#true} {3406#true} #31#return; {3406#true} is VALID [2018-11-23 13:10:29,856 INFO L256 TraceCheckUtils]: 3: Hoare triple {3406#true} call #t~ret0 := main(); {3406#true} is VALID [2018-11-23 13:10:29,876 INFO L273 TraceCheckUtils]: 4: Hoare triple {3406#true} ~x~0 := 0; {3408#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:10:29,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {3408#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3409#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:10:29,881 INFO L273 TraceCheckUtils]: 6: Hoare triple {3409#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3410#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:10:29,881 INFO L273 TraceCheckUtils]: 7: Hoare triple {3410#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3411#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:10:29,882 INFO L273 TraceCheckUtils]: 8: Hoare triple {3411#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3412#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:10:29,882 INFO L273 TraceCheckUtils]: 9: Hoare triple {3412#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:10:29,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {3413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:10:29,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {3414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3415#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:10:29,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {3415#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3416#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:10:29,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {3416#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3417#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:10:29,887 INFO L273 TraceCheckUtils]: 14: Hoare triple {3417#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3418#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:10:29,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {3418#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3419#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:10:29,889 INFO L273 TraceCheckUtils]: 16: Hoare triple {3419#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3420#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:10:29,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {3420#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3421#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:10:29,891 INFO L273 TraceCheckUtils]: 18: Hoare triple {3421#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3422#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:10:29,892 INFO L273 TraceCheckUtils]: 19: Hoare triple {3422#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3423#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:10:29,893 INFO L273 TraceCheckUtils]: 20: Hoare triple {3423#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3424#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:10:29,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {3424#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3425#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:10:29,895 INFO L273 TraceCheckUtils]: 22: Hoare triple {3425#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3426#(and (<= main_~x~0 36) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:10:29,896 INFO L273 TraceCheckUtils]: 23: Hoare triple {3426#(and (<= main_~x~0 36) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {3407#false} is VALID [2018-11-23 13:10:29,896 INFO L256 TraceCheckUtils]: 24: Hoare triple {3407#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3407#false} is VALID [2018-11-23 13:10:29,896 INFO L273 TraceCheckUtils]: 25: Hoare triple {3407#false} ~cond := #in~cond; {3407#false} is VALID [2018-11-23 13:10:29,896 INFO L273 TraceCheckUtils]: 26: Hoare triple {3407#false} assume 0 == ~cond; {3407#false} is VALID [2018-11-23 13:10:29,897 INFO L273 TraceCheckUtils]: 27: Hoare triple {3407#false} assume !false; {3407#false} is VALID [2018-11-23 13:10:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:29,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:29,899 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:29,907 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:10:55,250 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 13:10:55,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:55,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:55,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {3406#true} call ULTIMATE.init(); {3406#true} is VALID [2018-11-23 13:10:55,895 INFO L273 TraceCheckUtils]: 1: Hoare triple {3406#true} assume true; {3406#true} is VALID [2018-11-23 13:10:55,895 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3406#true} {3406#true} #31#return; {3406#true} is VALID [2018-11-23 13:10:55,896 INFO L256 TraceCheckUtils]: 3: Hoare triple {3406#true} call #t~ret0 := main(); {3406#true} is VALID [2018-11-23 13:10:55,896 INFO L273 TraceCheckUtils]: 4: Hoare triple {3406#true} ~x~0 := 0; {3408#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:10:55,897 INFO L273 TraceCheckUtils]: 5: Hoare triple {3408#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3409#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:10:55,898 INFO L273 TraceCheckUtils]: 6: Hoare triple {3409#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3410#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:10:55,898 INFO L273 TraceCheckUtils]: 7: Hoare triple {3410#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3411#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:10:55,899 INFO L273 TraceCheckUtils]: 8: Hoare triple {3411#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3412#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:10:55,899 INFO L273 TraceCheckUtils]: 9: Hoare triple {3412#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:10:55,900 INFO L273 TraceCheckUtils]: 10: Hoare triple {3413#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:10:55,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {3414#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3415#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:10:55,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {3415#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3416#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:10:55,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {3416#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3417#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:10:55,904 INFO L273 TraceCheckUtils]: 14: Hoare triple {3417#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3418#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:10:55,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {3418#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3419#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:10:55,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {3419#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3420#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:10:55,907 INFO L273 TraceCheckUtils]: 17: Hoare triple {3420#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3421#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:10:55,908 INFO L273 TraceCheckUtils]: 18: Hoare triple {3421#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3422#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:10:55,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {3422#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3423#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:10:55,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {3423#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3424#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:10:55,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {3424#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3425#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:10:55,912 INFO L273 TraceCheckUtils]: 22: Hoare triple {3425#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3496#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:10:55,912 INFO L273 TraceCheckUtils]: 23: Hoare triple {3496#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3407#false} is VALID [2018-11-23 13:10:55,913 INFO L256 TraceCheckUtils]: 24: Hoare triple {3407#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3407#false} is VALID [2018-11-23 13:10:55,913 INFO L273 TraceCheckUtils]: 25: Hoare triple {3407#false} ~cond := #in~cond; {3407#false} is VALID [2018-11-23 13:10:55,913 INFO L273 TraceCheckUtils]: 26: Hoare triple {3407#false} assume 0 == ~cond; {3407#false} is VALID [2018-11-23 13:10:55,913 INFO L273 TraceCheckUtils]: 27: Hoare triple {3407#false} assume !false; {3407#false} is VALID [2018-11-23 13:10:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:55,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:55,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 13:10:55,920 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-11-23 13:10:55,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:55,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:10:55,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:55,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:10:55,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:10:55,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:10:55,947 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2018-11-23 13:10:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:56,890 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 13:10:56,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:10:56,891 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-11-23 13:10:56,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:10:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2018-11-23 13:10:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:10:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2018-11-23 13:10:56,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 35 transitions. [2018-11-23 13:10:57,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:57,335 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:10:57,335 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:10:57,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:10:57,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:10:57,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 13:10:57,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:57,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 13:10:57,439 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 13:10:57,440 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 13:10:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:57,441 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:10:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:10:57,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:57,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:57,441 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 13:10:57,441 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 13:10:57,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:57,442 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:10:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:10:57,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:57,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:57,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:57,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:10:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-23 13:10:57,444 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-11-23 13:10:57,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:57,444 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-23 13:10:57,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:10:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:10:57,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:10:57,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:57,445 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:57,445 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:57,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:57,445 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2018-11-23 13:10:57,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:57,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:57,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:57,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:57,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:57,930 INFO L256 TraceCheckUtils]: 0: Hoare triple {3690#true} call ULTIMATE.init(); {3690#true} is VALID [2018-11-23 13:10:57,930 INFO L273 TraceCheckUtils]: 1: Hoare triple {3690#true} assume true; {3690#true} is VALID [2018-11-23 13:10:57,931 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3690#true} {3690#true} #31#return; {3690#true} is VALID [2018-11-23 13:10:57,931 INFO L256 TraceCheckUtils]: 3: Hoare triple {3690#true} call #t~ret0 := main(); {3690#true} is VALID [2018-11-23 13:10:57,931 INFO L273 TraceCheckUtils]: 4: Hoare triple {3690#true} ~x~0 := 0; {3692#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:10:57,932 INFO L273 TraceCheckUtils]: 5: Hoare triple {3692#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3693#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:10:57,932 INFO L273 TraceCheckUtils]: 6: Hoare triple {3693#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:10:57,933 INFO L273 TraceCheckUtils]: 7: Hoare triple {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3695#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:10:57,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {3695#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3696#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:10:57,935 INFO L273 TraceCheckUtils]: 9: Hoare triple {3696#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3697#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:10:57,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {3697#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3698#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:10:57,937 INFO L273 TraceCheckUtils]: 11: Hoare triple {3698#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3699#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:10:57,938 INFO L273 TraceCheckUtils]: 12: Hoare triple {3699#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3700#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:10:57,939 INFO L273 TraceCheckUtils]: 13: Hoare triple {3700#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3701#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:10:57,940 INFO L273 TraceCheckUtils]: 14: Hoare triple {3701#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3702#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:10:57,941 INFO L273 TraceCheckUtils]: 15: Hoare triple {3702#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3703#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:10:57,942 INFO L273 TraceCheckUtils]: 16: Hoare triple {3703#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3704#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:10:57,942 INFO L273 TraceCheckUtils]: 17: Hoare triple {3704#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3705#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:10:57,943 INFO L273 TraceCheckUtils]: 18: Hoare triple {3705#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3706#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:10:57,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {3706#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3707#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:10:57,945 INFO L273 TraceCheckUtils]: 20: Hoare triple {3707#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3708#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:10:57,946 INFO L273 TraceCheckUtils]: 21: Hoare triple {3708#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3709#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:10:57,947 INFO L273 TraceCheckUtils]: 22: Hoare triple {3709#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3710#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:10:57,948 INFO L273 TraceCheckUtils]: 23: Hoare triple {3710#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3711#(and (<= main_~x~0 38) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:10:57,949 INFO L273 TraceCheckUtils]: 24: Hoare triple {3711#(and (<= main_~x~0 38) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {3691#false} is VALID [2018-11-23 13:10:57,949 INFO L256 TraceCheckUtils]: 25: Hoare triple {3691#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3691#false} is VALID [2018-11-23 13:10:57,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {3691#false} ~cond := #in~cond; {3691#false} is VALID [2018-11-23 13:10:57,950 INFO L273 TraceCheckUtils]: 27: Hoare triple {3691#false} assume 0 == ~cond; {3691#false} is VALID [2018-11-23 13:10:57,950 INFO L273 TraceCheckUtils]: 28: Hoare triple {3691#false} assume !false; {3691#false} is VALID [2018-11-23 13:10:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:57,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:57,952 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:57,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:57,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:58,112 INFO L256 TraceCheckUtils]: 0: Hoare triple {3690#true} call ULTIMATE.init(); {3690#true} is VALID [2018-11-23 13:10:58,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {3690#true} assume true; {3690#true} is VALID [2018-11-23 13:10:58,112 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3690#true} {3690#true} #31#return; {3690#true} is VALID [2018-11-23 13:10:58,112 INFO L256 TraceCheckUtils]: 3: Hoare triple {3690#true} call #t~ret0 := main(); {3690#true} is VALID [2018-11-23 13:10:58,113 INFO L273 TraceCheckUtils]: 4: Hoare triple {3690#true} ~x~0 := 0; {3692#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:10:58,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {3692#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3693#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:10:58,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {3693#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:10:58,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {3694#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3695#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:10:58,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {3695#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3696#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:10:58,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {3696#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3697#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:10:58,116 INFO L273 TraceCheckUtils]: 10: Hoare triple {3697#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3698#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:10:58,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {3698#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3699#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:10:58,118 INFO L273 TraceCheckUtils]: 12: Hoare triple {3699#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3700#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:10:58,119 INFO L273 TraceCheckUtils]: 13: Hoare triple {3700#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3701#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:10:58,120 INFO L273 TraceCheckUtils]: 14: Hoare triple {3701#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3702#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:10:58,121 INFO L273 TraceCheckUtils]: 15: Hoare triple {3702#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3703#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:10:58,122 INFO L273 TraceCheckUtils]: 16: Hoare triple {3703#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3704#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:10:58,123 INFO L273 TraceCheckUtils]: 17: Hoare triple {3704#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3705#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:10:58,124 INFO L273 TraceCheckUtils]: 18: Hoare triple {3705#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3706#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:10:58,125 INFO L273 TraceCheckUtils]: 19: Hoare triple {3706#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3707#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:10:58,126 INFO L273 TraceCheckUtils]: 20: Hoare triple {3707#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3708#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:10:58,127 INFO L273 TraceCheckUtils]: 21: Hoare triple {3708#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3709#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:10:58,128 INFO L273 TraceCheckUtils]: 22: Hoare triple {3709#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3710#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:10:58,129 INFO L273 TraceCheckUtils]: 23: Hoare triple {3710#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3784#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:10:58,130 INFO L273 TraceCheckUtils]: 24: Hoare triple {3784#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3691#false} is VALID [2018-11-23 13:10:58,130 INFO L256 TraceCheckUtils]: 25: Hoare triple {3691#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3691#false} is VALID [2018-11-23 13:10:58,130 INFO L273 TraceCheckUtils]: 26: Hoare triple {3691#false} ~cond := #in~cond; {3691#false} is VALID [2018-11-23 13:10:58,130 INFO L273 TraceCheckUtils]: 27: Hoare triple {3691#false} assume 0 == ~cond; {3691#false} is VALID [2018-11-23 13:10:58,131 INFO L273 TraceCheckUtils]: 28: Hoare triple {3691#false} assume !false; {3691#false} is VALID [2018-11-23 13:10:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:58,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:58,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 13:10:58,153 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-11-23 13:10:58,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:58,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:10:58,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:58,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:10:58,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:10:58,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:10:58,180 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2018-11-23 13:10:59,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:59,892 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:10:59,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:10:59,893 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-11-23 13:10:59,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:10:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2018-11-23 13:10:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:10:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2018-11-23 13:10:59,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2018-11-23 13:10:59,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:59,928 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:10:59,928 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:10:59,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:10:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:10:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 13:10:59,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:59,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 13:10:59,953 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 13:10:59,953 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 13:10:59,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:59,954 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:10:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:10:59,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:59,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:59,955 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 13:10:59,955 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 13:10:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:59,956 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:10:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:10:59,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:59,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:59,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:59,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:10:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-23 13:10:59,958 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-11-23 13:10:59,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:59,958 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-23 13:10:59,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:10:59,958 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:10:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:10:59,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:59,959 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:59,959 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:59,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:59,960 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2018-11-23 13:10:59,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:59,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:59,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:59,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:59,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:01,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {3984#true} call ULTIMATE.init(); {3984#true} is VALID [2018-11-23 13:11:01,071 INFO L273 TraceCheckUtils]: 1: Hoare triple {3984#true} assume true; {3984#true} is VALID [2018-11-23 13:11:01,085 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3984#true} {3984#true} #31#return; {3984#true} is VALID [2018-11-23 13:11:01,085 INFO L256 TraceCheckUtils]: 3: Hoare triple {3984#true} call #t~ret0 := main(); {3984#true} is VALID [2018-11-23 13:11:01,088 INFO L273 TraceCheckUtils]: 4: Hoare triple {3984#true} ~x~0 := 0; {3986#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:11:01,089 INFO L273 TraceCheckUtils]: 5: Hoare triple {3986#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3987#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:11:01,089 INFO L273 TraceCheckUtils]: 6: Hoare triple {3987#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3988#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:11:01,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {3988#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3989#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:11:01,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {3989#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3990#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:11:01,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {3990#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3991#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:11:01,139 INFO L273 TraceCheckUtils]: 10: Hoare triple {3991#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3992#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:11:01,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {3992#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3993#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:11:01,160 INFO L273 TraceCheckUtils]: 12: Hoare triple {3993#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3994#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:11:01,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {3994#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3995#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:11:01,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {3995#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3996#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:11:01,197 INFO L273 TraceCheckUtils]: 15: Hoare triple {3996#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3997#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:11:01,198 INFO L273 TraceCheckUtils]: 16: Hoare triple {3997#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3998#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:11:01,199 INFO L273 TraceCheckUtils]: 17: Hoare triple {3998#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3999#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:11:01,201 INFO L273 TraceCheckUtils]: 18: Hoare triple {3999#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4000#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:11:01,202 INFO L273 TraceCheckUtils]: 19: Hoare triple {4000#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4001#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:11:01,203 INFO L273 TraceCheckUtils]: 20: Hoare triple {4001#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4002#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:11:01,203 INFO L273 TraceCheckUtils]: 21: Hoare triple {4002#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4003#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:11:01,205 INFO L273 TraceCheckUtils]: 22: Hoare triple {4003#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4004#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:11:01,206 INFO L273 TraceCheckUtils]: 23: Hoare triple {4004#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4005#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:11:01,207 INFO L273 TraceCheckUtils]: 24: Hoare triple {4005#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4006#(and (<= main_~x~0 40) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:11:01,208 INFO L273 TraceCheckUtils]: 25: Hoare triple {4006#(and (<= main_~x~0 40) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {3985#false} is VALID [2018-11-23 13:11:01,208 INFO L256 TraceCheckUtils]: 26: Hoare triple {3985#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3985#false} is VALID [2018-11-23 13:11:01,208 INFO L273 TraceCheckUtils]: 27: Hoare triple {3985#false} ~cond := #in~cond; {3985#false} is VALID [2018-11-23 13:11:01,208 INFO L273 TraceCheckUtils]: 28: Hoare triple {3985#false} assume 0 == ~cond; {3985#false} is VALID [2018-11-23 13:11:01,208 INFO L273 TraceCheckUtils]: 29: Hoare triple {3985#false} assume !false; {3985#false} is VALID [2018-11-23 13:11:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:01,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:01,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:01,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:11:01,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:11:01,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:01,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:01,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {3984#true} call ULTIMATE.init(); {3984#true} is VALID [2018-11-23 13:11:01,370 INFO L273 TraceCheckUtils]: 1: Hoare triple {3984#true} assume true; {3984#true} is VALID [2018-11-23 13:11:01,370 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3984#true} {3984#true} #31#return; {3984#true} is VALID [2018-11-23 13:11:01,370 INFO L256 TraceCheckUtils]: 3: Hoare triple {3984#true} call #t~ret0 := main(); {3984#true} is VALID [2018-11-23 13:11:01,371 INFO L273 TraceCheckUtils]: 4: Hoare triple {3984#true} ~x~0 := 0; {3986#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:11:01,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {3986#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3987#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:11:01,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {3987#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3988#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:11:01,373 INFO L273 TraceCheckUtils]: 7: Hoare triple {3988#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3989#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:11:01,374 INFO L273 TraceCheckUtils]: 8: Hoare triple {3989#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3990#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:11:01,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {3990#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3991#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:11:01,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {3991#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3992#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:11:01,376 INFO L273 TraceCheckUtils]: 11: Hoare triple {3992#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3993#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:11:01,377 INFO L273 TraceCheckUtils]: 12: Hoare triple {3993#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3994#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:11:01,378 INFO L273 TraceCheckUtils]: 13: Hoare triple {3994#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3995#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:11:01,379 INFO L273 TraceCheckUtils]: 14: Hoare triple {3995#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3996#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:11:01,380 INFO L273 TraceCheckUtils]: 15: Hoare triple {3996#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3997#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:11:01,381 INFO L273 TraceCheckUtils]: 16: Hoare triple {3997#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3998#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:11:01,382 INFO L273 TraceCheckUtils]: 17: Hoare triple {3998#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3999#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:11:01,383 INFO L273 TraceCheckUtils]: 18: Hoare triple {3999#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4000#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:11:01,384 INFO L273 TraceCheckUtils]: 19: Hoare triple {4000#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4001#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:11:01,385 INFO L273 TraceCheckUtils]: 20: Hoare triple {4001#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4002#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:11:01,386 INFO L273 TraceCheckUtils]: 21: Hoare triple {4002#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4003#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:11:01,386 INFO L273 TraceCheckUtils]: 22: Hoare triple {4003#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4004#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:11:01,387 INFO L273 TraceCheckUtils]: 23: Hoare triple {4004#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4005#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:11:01,388 INFO L273 TraceCheckUtils]: 24: Hoare triple {4005#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4082#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:11:01,389 INFO L273 TraceCheckUtils]: 25: Hoare triple {4082#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3985#false} is VALID [2018-11-23 13:11:01,389 INFO L256 TraceCheckUtils]: 26: Hoare triple {3985#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3985#false} is VALID [2018-11-23 13:11:01,390 INFO L273 TraceCheckUtils]: 27: Hoare triple {3985#false} ~cond := #in~cond; {3985#false} is VALID [2018-11-23 13:11:01,390 INFO L273 TraceCheckUtils]: 28: Hoare triple {3985#false} assume 0 == ~cond; {3985#false} is VALID [2018-11-23 13:11:01,390 INFO L273 TraceCheckUtils]: 29: Hoare triple {3985#false} assume !false; {3985#false} is VALID [2018-11-23 13:11:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:01,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:01,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 13:11:01,411 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-11-23 13:11:01,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:01,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 13:11:01,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:01,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 13:11:01,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 13:11:01,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:11:01,438 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2018-11-23 13:11:02,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:02,705 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-23 13:11:02,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:11:02,705 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-11-23 13:11:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:11:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2018-11-23 13:11:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:11:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2018-11-23 13:11:02,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 37 transitions. [2018-11-23 13:11:03,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:03,170 INFO L225 Difference]: With dead ends: 37 [2018-11-23 13:11:03,170 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:11:03,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:11:03,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:11:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 13:11:03,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:03,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 13:11:03,257 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 13:11:03,257 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 13:11:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:03,259 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:11:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:11:03,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:03,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:03,259 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 13:11:03,259 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 13:11:03,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:03,260 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:11:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:11:03,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:03,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:03,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:03,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:11:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-23 13:11:03,262 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-11-23 13:11:03,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:03,263 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-23 13:11:03,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 13:11:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:11:03,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 13:11:03,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:03,263 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:03,264 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:03,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:03,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2018-11-23 13:11:03,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:03,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:03,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:03,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:03,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:04,469 INFO L256 TraceCheckUtils]: 0: Hoare triple {4288#true} call ULTIMATE.init(); {4288#true} is VALID [2018-11-23 13:11:04,469 INFO L273 TraceCheckUtils]: 1: Hoare triple {4288#true} assume true; {4288#true} is VALID [2018-11-23 13:11:04,469 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4288#true} {4288#true} #31#return; {4288#true} is VALID [2018-11-23 13:11:04,469 INFO L256 TraceCheckUtils]: 3: Hoare triple {4288#true} call #t~ret0 := main(); {4288#true} is VALID [2018-11-23 13:11:04,470 INFO L273 TraceCheckUtils]: 4: Hoare triple {4288#true} ~x~0 := 0; {4290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:11:04,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {4290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4291#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:11:04,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {4291#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4292#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:11:04,473 INFO L273 TraceCheckUtils]: 7: Hoare triple {4292#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4293#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:11:04,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {4293#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4294#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:11:04,475 INFO L273 TraceCheckUtils]: 9: Hoare triple {4294#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4295#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:11:04,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {4295#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4296#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:11:04,477 INFO L273 TraceCheckUtils]: 11: Hoare triple {4296#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4297#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:11:04,478 INFO L273 TraceCheckUtils]: 12: Hoare triple {4297#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4298#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:11:04,479 INFO L273 TraceCheckUtils]: 13: Hoare triple {4298#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4299#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:11:04,480 INFO L273 TraceCheckUtils]: 14: Hoare triple {4299#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4300#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:11:04,481 INFO L273 TraceCheckUtils]: 15: Hoare triple {4300#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4301#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:11:04,482 INFO L273 TraceCheckUtils]: 16: Hoare triple {4301#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4302#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:11:04,483 INFO L273 TraceCheckUtils]: 17: Hoare triple {4302#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4303#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:11:04,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {4303#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4304#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:11:04,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {4304#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4305#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:11:04,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {4305#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4306#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:11:04,487 INFO L273 TraceCheckUtils]: 21: Hoare triple {4306#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4307#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:11:04,488 INFO L273 TraceCheckUtils]: 22: Hoare triple {4307#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4308#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:11:04,488 INFO L273 TraceCheckUtils]: 23: Hoare triple {4308#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4309#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:11:04,489 INFO L273 TraceCheckUtils]: 24: Hoare triple {4309#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4310#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:11:04,490 INFO L273 TraceCheckUtils]: 25: Hoare triple {4310#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4311#(and (<= main_~x~0 42) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:11:04,491 INFO L273 TraceCheckUtils]: 26: Hoare triple {4311#(and (<= main_~x~0 42) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {4289#false} is VALID [2018-11-23 13:11:04,492 INFO L256 TraceCheckUtils]: 27: Hoare triple {4289#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4289#false} is VALID [2018-11-23 13:11:04,492 INFO L273 TraceCheckUtils]: 28: Hoare triple {4289#false} ~cond := #in~cond; {4289#false} is VALID [2018-11-23 13:11:04,492 INFO L273 TraceCheckUtils]: 29: Hoare triple {4289#false} assume 0 == ~cond; {4289#false} is VALID [2018-11-23 13:11:04,492 INFO L273 TraceCheckUtils]: 30: Hoare triple {4289#false} assume !false; {4289#false} is VALID [2018-11-23 13:11:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:04,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:04,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:04,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:11:42,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 13:11:42,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:42,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:42,836 INFO L256 TraceCheckUtils]: 0: Hoare triple {4288#true} call ULTIMATE.init(); {4288#true} is VALID [2018-11-23 13:11:42,836 INFO L273 TraceCheckUtils]: 1: Hoare triple {4288#true} assume true; {4288#true} is VALID [2018-11-23 13:11:42,836 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4288#true} {4288#true} #31#return; {4288#true} is VALID [2018-11-23 13:11:42,837 INFO L256 TraceCheckUtils]: 3: Hoare triple {4288#true} call #t~ret0 := main(); {4288#true} is VALID [2018-11-23 13:11:42,837 INFO L273 TraceCheckUtils]: 4: Hoare triple {4288#true} ~x~0 := 0; {4290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:11:42,838 INFO L273 TraceCheckUtils]: 5: Hoare triple {4290#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4291#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:11:42,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {4291#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4292#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:11:42,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {4292#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4293#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:11:42,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {4293#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4294#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:11:42,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {4294#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4295#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:11:42,843 INFO L273 TraceCheckUtils]: 10: Hoare triple {4295#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4296#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:11:42,844 INFO L273 TraceCheckUtils]: 11: Hoare triple {4296#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4297#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:11:42,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {4297#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4298#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:11:42,846 INFO L273 TraceCheckUtils]: 13: Hoare triple {4298#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4299#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:11:42,847 INFO L273 TraceCheckUtils]: 14: Hoare triple {4299#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4300#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:11:42,848 INFO L273 TraceCheckUtils]: 15: Hoare triple {4300#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4301#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:11:42,849 INFO L273 TraceCheckUtils]: 16: Hoare triple {4301#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4302#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:11:42,850 INFO L273 TraceCheckUtils]: 17: Hoare triple {4302#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4303#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:11:42,851 INFO L273 TraceCheckUtils]: 18: Hoare triple {4303#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4304#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:11:42,852 INFO L273 TraceCheckUtils]: 19: Hoare triple {4304#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4305#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:11:42,852 INFO L273 TraceCheckUtils]: 20: Hoare triple {4305#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4306#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:11:42,853 INFO L273 TraceCheckUtils]: 21: Hoare triple {4306#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4307#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:11:42,854 INFO L273 TraceCheckUtils]: 22: Hoare triple {4307#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4308#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:11:42,855 INFO L273 TraceCheckUtils]: 23: Hoare triple {4308#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4309#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:11:42,856 INFO L273 TraceCheckUtils]: 24: Hoare triple {4309#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4310#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:11:42,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {4310#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4390#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:11:42,858 INFO L273 TraceCheckUtils]: 26: Hoare triple {4390#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {4289#false} is VALID [2018-11-23 13:11:42,858 INFO L256 TraceCheckUtils]: 27: Hoare triple {4289#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4289#false} is VALID [2018-11-23 13:11:42,858 INFO L273 TraceCheckUtils]: 28: Hoare triple {4289#false} ~cond := #in~cond; {4289#false} is VALID [2018-11-23 13:11:42,859 INFO L273 TraceCheckUtils]: 29: Hoare triple {4289#false} assume 0 == ~cond; {4289#false} is VALID [2018-11-23 13:11:42,859 INFO L273 TraceCheckUtils]: 30: Hoare triple {4289#false} assume !false; {4289#false} is VALID [2018-11-23 13:11:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:42,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:42,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 13:11:42,884 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-11-23 13:11:42,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:42,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:11:42,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:42,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:11:42,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:11:42,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:11:42,910 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2018-11-23 13:11:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:44,717 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:11:44,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:11:44,717 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-11-23 13:11:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:44,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:11:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2018-11-23 13:11:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:11:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2018-11-23 13:11:44,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 38 transitions. [2018-11-23 13:11:45,152 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:45,152 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:11:45,153 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:11:45,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:11:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:11:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 13:11:45,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:45,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 13:11:45,271 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 13:11:45,271 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 13:11:45,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:45,272 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 13:11:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:11:45,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:45,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:45,273 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 13:11:45,273 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 13:11:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:45,274 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 13:11:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:11:45,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:45,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:45,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:45,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:11:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 13:11:45,276 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-11-23 13:11:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:45,276 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 13:11:45,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:11:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:11:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:11:45,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:45,277 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:45,277 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:45,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:45,278 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2018-11-23 13:11:45,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:45,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:45,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:45,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:45,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:46,263 INFO L256 TraceCheckUtils]: 0: Hoare triple {4602#true} call ULTIMATE.init(); {4602#true} is VALID [2018-11-23 13:11:46,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {4602#true} assume true; {4602#true} is VALID [2018-11-23 13:11:46,264 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4602#true} {4602#true} #31#return; {4602#true} is VALID [2018-11-23 13:11:46,264 INFO L256 TraceCheckUtils]: 3: Hoare triple {4602#true} call #t~ret0 := main(); {4602#true} is VALID [2018-11-23 13:11:46,264 INFO L273 TraceCheckUtils]: 4: Hoare triple {4602#true} ~x~0 := 0; {4604#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:11:46,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {4604#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4605#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:11:46,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {4605#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4606#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:11:46,266 INFO L273 TraceCheckUtils]: 7: Hoare triple {4606#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:11:46,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {4607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4608#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:11:46,268 INFO L273 TraceCheckUtils]: 9: Hoare triple {4608#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4609#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:11:46,269 INFO L273 TraceCheckUtils]: 10: Hoare triple {4609#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4610#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:11:46,270 INFO L273 TraceCheckUtils]: 11: Hoare triple {4610#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4611#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:11:46,272 INFO L273 TraceCheckUtils]: 12: Hoare triple {4611#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4612#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:11:46,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {4612#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4613#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:11:46,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {4613#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4614#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:11:46,275 INFO L273 TraceCheckUtils]: 15: Hoare triple {4614#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4615#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:11:46,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {4615#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4616#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:11:46,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {4616#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4617#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:11:46,277 INFO L273 TraceCheckUtils]: 18: Hoare triple {4617#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4618#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:11:46,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {4618#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4619#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:11:46,279 INFO L273 TraceCheckUtils]: 20: Hoare triple {4619#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4620#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:11:46,280 INFO L273 TraceCheckUtils]: 21: Hoare triple {4620#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4621#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:11:46,281 INFO L273 TraceCheckUtils]: 22: Hoare triple {4621#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4622#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:11:46,282 INFO L273 TraceCheckUtils]: 23: Hoare triple {4622#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4623#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:11:46,283 INFO L273 TraceCheckUtils]: 24: Hoare triple {4623#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4624#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:11:46,284 INFO L273 TraceCheckUtils]: 25: Hoare triple {4624#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4625#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:11:46,285 INFO L273 TraceCheckUtils]: 26: Hoare triple {4625#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4626#(and (<= main_~x~0 44) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:11:46,286 INFO L273 TraceCheckUtils]: 27: Hoare triple {4626#(and (<= main_~x~0 44) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {4603#false} is VALID [2018-11-23 13:11:46,286 INFO L256 TraceCheckUtils]: 28: Hoare triple {4603#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4603#false} is VALID [2018-11-23 13:11:46,286 INFO L273 TraceCheckUtils]: 29: Hoare triple {4603#false} ~cond := #in~cond; {4603#false} is VALID [2018-11-23 13:11:46,287 INFO L273 TraceCheckUtils]: 30: Hoare triple {4603#false} assume 0 == ~cond; {4603#false} is VALID [2018-11-23 13:11:46,287 INFO L273 TraceCheckUtils]: 31: Hoare triple {4603#false} assume !false; {4603#false} is VALID [2018-11-23 13:11:46,289 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:46,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:46,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:46,298 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:11:46,313 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:11:46,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:46,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:46,547 INFO L256 TraceCheckUtils]: 0: Hoare triple {4602#true} call ULTIMATE.init(); {4602#true} is VALID [2018-11-23 13:11:46,548 INFO L273 TraceCheckUtils]: 1: Hoare triple {4602#true} assume true; {4602#true} is VALID [2018-11-23 13:11:46,548 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4602#true} {4602#true} #31#return; {4602#true} is VALID [2018-11-23 13:11:46,548 INFO L256 TraceCheckUtils]: 3: Hoare triple {4602#true} call #t~ret0 := main(); {4602#true} is VALID [2018-11-23 13:11:46,549 INFO L273 TraceCheckUtils]: 4: Hoare triple {4602#true} ~x~0 := 0; {4604#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:11:46,550 INFO L273 TraceCheckUtils]: 5: Hoare triple {4604#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4605#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:11:46,551 INFO L273 TraceCheckUtils]: 6: Hoare triple {4605#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4606#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:11:46,552 INFO L273 TraceCheckUtils]: 7: Hoare triple {4606#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:11:46,553 INFO L273 TraceCheckUtils]: 8: Hoare triple {4607#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4608#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:11:46,554 INFO L273 TraceCheckUtils]: 9: Hoare triple {4608#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4609#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:11:46,555 INFO L273 TraceCheckUtils]: 10: Hoare triple {4609#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4610#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:11:46,556 INFO L273 TraceCheckUtils]: 11: Hoare triple {4610#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4611#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:11:46,556 INFO L273 TraceCheckUtils]: 12: Hoare triple {4611#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4612#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:11:46,557 INFO L273 TraceCheckUtils]: 13: Hoare triple {4612#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4613#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:11:46,558 INFO L273 TraceCheckUtils]: 14: Hoare triple {4613#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4614#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:11:46,559 INFO L273 TraceCheckUtils]: 15: Hoare triple {4614#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4615#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:11:46,560 INFO L273 TraceCheckUtils]: 16: Hoare triple {4615#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4616#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:11:46,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {4616#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4617#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:11:46,562 INFO L273 TraceCheckUtils]: 18: Hoare triple {4617#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4618#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:11:46,563 INFO L273 TraceCheckUtils]: 19: Hoare triple {4618#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4619#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:11:46,564 INFO L273 TraceCheckUtils]: 20: Hoare triple {4619#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4620#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:11:46,565 INFO L273 TraceCheckUtils]: 21: Hoare triple {4620#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4621#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:11:46,566 INFO L273 TraceCheckUtils]: 22: Hoare triple {4621#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4622#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:11:46,567 INFO L273 TraceCheckUtils]: 23: Hoare triple {4622#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4623#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:11:46,568 INFO L273 TraceCheckUtils]: 24: Hoare triple {4623#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4624#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:11:46,569 INFO L273 TraceCheckUtils]: 25: Hoare triple {4624#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4625#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:11:46,570 INFO L273 TraceCheckUtils]: 26: Hoare triple {4625#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4708#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:11:46,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {4708#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !(~x~0 % 4294967296 < 268435455); {4603#false} is VALID [2018-11-23 13:11:46,571 INFO L256 TraceCheckUtils]: 28: Hoare triple {4603#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4603#false} is VALID [2018-11-23 13:11:46,571 INFO L273 TraceCheckUtils]: 29: Hoare triple {4603#false} ~cond := #in~cond; {4603#false} is VALID [2018-11-23 13:11:46,571 INFO L273 TraceCheckUtils]: 30: Hoare triple {4603#false} assume 0 == ~cond; {4603#false} is VALID [2018-11-23 13:11:46,571 INFO L273 TraceCheckUtils]: 31: Hoare triple {4603#false} assume !false; {4603#false} is VALID [2018-11-23 13:11:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:46,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:46,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 13:11:46,593 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2018-11-23 13:11:46,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:46,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 13:11:46,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:46,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 13:11:46,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 13:11:46,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:11:46,832 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2018-11-23 13:11:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:50,214 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-23 13:11:50,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 13:11:50,214 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2018-11-23 13:11:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:11:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2018-11-23 13:11:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:11:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2018-11-23 13:11:50,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 39 transitions. [2018-11-23 13:11:50,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:50,706 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:11:50,706 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:11:50,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:11:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:11:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 13:11:50,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:50,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 13:11:50,742 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 13:11:50,742 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 13:11:50,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:50,744 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:11:50,744 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:11:50,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:50,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:50,744 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 13:11:50,744 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 13:11:50,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:50,746 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:11:50,746 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:11:50,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:50,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:50,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:50,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:11:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-23 13:11:50,748 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-11-23 13:11:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:50,748 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-23 13:11:50,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 13:11:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:11:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:11:50,749 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:50,749 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:50,749 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:50,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:50,750 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2018-11-23 13:11:50,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:50,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:50,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:50,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:50,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:52,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {4926#true} call ULTIMATE.init(); {4926#true} is VALID [2018-11-23 13:11:52,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {4926#true} assume true; {4926#true} is VALID [2018-11-23 13:11:52,324 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4926#true} {4926#true} #31#return; {4926#true} is VALID [2018-11-23 13:11:52,324 INFO L256 TraceCheckUtils]: 3: Hoare triple {4926#true} call #t~ret0 := main(); {4926#true} is VALID [2018-11-23 13:11:52,325 INFO L273 TraceCheckUtils]: 4: Hoare triple {4926#true} ~x~0 := 0; {4928#(and (<= main_~x~0 0) (<= 0 main_~x~0))} is VALID [2018-11-23 13:11:52,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {4928#(and (<= main_~x~0 0) (<= 0 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4929#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2018-11-23 13:11:52,327 INFO L273 TraceCheckUtils]: 6: Hoare triple {4929#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4930#(and (<= 4 main_~x~0) (<= main_~x~0 4))} is VALID [2018-11-23 13:11:52,328 INFO L273 TraceCheckUtils]: 7: Hoare triple {4930#(and (<= 4 main_~x~0) (<= main_~x~0 4))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4931#(and (<= main_~x~0 6) (<= 6 main_~x~0))} is VALID [2018-11-23 13:11:52,329 INFO L273 TraceCheckUtils]: 8: Hoare triple {4931#(and (<= main_~x~0 6) (<= 6 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4932#(and (<= 8 main_~x~0) (<= main_~x~0 8))} is VALID [2018-11-23 13:11:52,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {4932#(and (<= 8 main_~x~0) (<= main_~x~0 8))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4933#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:11:52,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {4933#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4934#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:11:52,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {4934#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4935#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:11:52,332 INFO L273 TraceCheckUtils]: 12: Hoare triple {4935#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4936#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:11:52,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {4936#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4937#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:11:52,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {4937#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4938#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:11:52,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {4938#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4939#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:11:52,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {4939#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4940#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:11:52,337 INFO L273 TraceCheckUtils]: 17: Hoare triple {4940#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4941#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:11:52,338 INFO L273 TraceCheckUtils]: 18: Hoare triple {4941#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4942#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:11:52,339 INFO L273 TraceCheckUtils]: 19: Hoare triple {4942#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4943#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:11:52,340 INFO L273 TraceCheckUtils]: 20: Hoare triple {4943#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4944#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:11:52,341 INFO L273 TraceCheckUtils]: 21: Hoare triple {4944#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4945#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:11:52,341 INFO L273 TraceCheckUtils]: 22: Hoare triple {4945#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4946#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:11:52,342 INFO L273 TraceCheckUtils]: 23: Hoare triple {4946#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4947#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:11:52,343 INFO L273 TraceCheckUtils]: 24: Hoare triple {4947#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4948#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:11:52,344 INFO L273 TraceCheckUtils]: 25: Hoare triple {4948#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4949#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:11:52,345 INFO L273 TraceCheckUtils]: 26: Hoare triple {4949#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4950#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:11:52,346 INFO L273 TraceCheckUtils]: 27: Hoare triple {4950#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4951#(and (<= main_~x~0 46) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:11:52,347 INFO L273 TraceCheckUtils]: 28: Hoare triple {4951#(and (<= main_~x~0 46) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < 268435455); {4927#false} is VALID [2018-11-23 13:11:52,347 INFO L256 TraceCheckUtils]: 29: Hoare triple {4927#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {4927#false} is VALID [2018-11-23 13:11:52,347 INFO L273 TraceCheckUtils]: 30: Hoare triple {4927#false} ~cond := #in~cond; {4927#false} is VALID [2018-11-23 13:11:52,348 INFO L273 TraceCheckUtils]: 31: Hoare triple {4927#false} assume 0 == ~cond; {4927#false} is VALID [2018-11-23 13:11:52,348 INFO L273 TraceCheckUtils]: 32: Hoare triple {4927#false} assume !false; {4927#false} is VALID [2018-11-23 13:11:52,350 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:52,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:52,351 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:52,361 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1