java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:05:05,211 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:05:05,213 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:05:05,227 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:05:05,228 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:05:05,229 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:05:05,230 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:05:05,232 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:05:05,234 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:05:05,235 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:05:05,236 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:05:05,236 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:05:05,237 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:05:05,240 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:05:05,243 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:05:05,244 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:05:05,245 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:05:05,249 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:05:05,251 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:05:05,256 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:05:05,258 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:05:05,260 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:05:05,264 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:05:05,264 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:05:05,264 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:05:05,266 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:05:05,267 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:05:05,270 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:05:05,273 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:05:05,275 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:05:05,275 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:05:05,276 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:05:05,276 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:05:05,276 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:05:05,279 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:05:05,281 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:05:05,281 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:05:05,310 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:05:05,310 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:05:05,311 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:05:05,311 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:05:05,313 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:05:05,313 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:05:05,313 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:05:05,313 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:05:05,314 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:05:05,314 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:05:05,314 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:05:05,314 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:05:05,314 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:05:05,314 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:05:05,316 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:05:05,316 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:05:05,316 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:05:05,316 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:05:05,316 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:05:05,317 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:05:05,317 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:05:05,317 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:05:05,317 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:05:05,317 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:05:05,319 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:05:05,319 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:05:05,319 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:05:05,319 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:05:05,320 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:05:05,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:05:05,320 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:05:05,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:05:05,401 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:05:05,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:05:05,407 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:05:05,408 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:05:05,409 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call1.i [2018-11-23 13:05:05,476 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59c3cba6c/64f27f30eb0d477c98be019c9cb4b321/FLAG89746a9ca [2018-11-23 13:05:05,884 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:05:05,884 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call1.i [2018-11-23 13:05:05,890 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59c3cba6c/64f27f30eb0d477c98be019c9cb4b321/FLAG89746a9ca [2018-11-23 13:05:06,280 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59c3cba6c/64f27f30eb0d477c98be019c9cb4b321 [2018-11-23 13:05:06,289 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:05:06,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:05:06,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:05:06,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:05:06,295 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:05:06,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:05:06" (1/1) ... [2018-11-23 13:05:06,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d81cc59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:06, skipping insertion in model container [2018-11-23 13:05:06,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:05:06" (1/1) ... [2018-11-23 13:05:06,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:05:06,339 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:05:06,601 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:05:06,607 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:05:06,625 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:05:06,641 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:05:06,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:06 WrapperNode [2018-11-23 13:05:06,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:05:06,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:05:06,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:05:06,643 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:05:06,653 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:05:06" (1/1) ... [2018-11-23 13:05:06,659 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:05:06" (1/1) ... [2018-11-23 13:05:06,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:05:06,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:05:06,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:05:06,667 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:05:06,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:06" (1/1) ... [2018-11-23 13:05:06,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:06" (1/1) ... [2018-11-23 13:05:06,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:06" (1/1) ... [2018-11-23 13:05:06,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:06" (1/1) ... [2018-11-23 13:05:06,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:06" (1/1) ... [2018-11-23 13:05:06,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:06" (1/1) ... [2018-11-23 13:05:06,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:06" (1/1) ... [2018-11-23 13:05:06,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:05:06,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:05:06,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:05:06,692 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:05:06,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:06" (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:05:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:05:06,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:05:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:05:06,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:05:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:05:06,814 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:05:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:05:06,814 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:05:07,214 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:05:07,214 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:05:07,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:05:07 BoogieIcfgContainer [2018-11-23 13:05:07,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:05:07,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:05:07,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:05:07,220 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:05:07,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:05:06" (1/3) ... [2018-11-23 13:05:07,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741a0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:05:07, skipping insertion in model container [2018-11-23 13:05:07,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:05:06" (2/3) ... [2018-11-23 13:05:07,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741a0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:05:07, skipping insertion in model container [2018-11-23 13:05:07,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:05:07" (3/3) ... [2018-11-23 13:05:07,223 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call1.i [2018-11-23 13:05:07,233 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:05:07,241 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:05:07,256 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:05:07,286 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:05:07,287 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:05:07,287 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:05:07,288 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:05:07,290 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:05:07,290 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:05:07,290 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:05:07,291 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:05:07,291 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:05:07,311 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 13:05:07,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:05:07,317 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:07,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:07,321 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:07,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:07,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 13:05:07,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:07,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:07,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:07,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:07,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:07,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 13:05:07,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 13:05:07,676 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 13:05:07,677 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret0 := main(); {20#true} is VALID [2018-11-23 13:05:07,679 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:05:07,681 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:05:07,682 INFO L256 TraceCheckUtils]: 6: Hoare triple {21#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {21#false} is VALID [2018-11-23 13:05:07,682 INFO L273 TraceCheckUtils]: 7: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2018-11-23 13:05:07,682 INFO L273 TraceCheckUtils]: 8: Hoare triple {21#false} assume 0 == ~cond; {21#false} is VALID [2018-11-23 13:05:07,683 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 13:05:07,685 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:05:07,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:05:07,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:05:07,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:05:07,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:07,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:05:07,734 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:05:07,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:05:07,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:05:07,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:05:07,745 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-11-23 13:05:08,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:08,166 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 13:05:08,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:05:08,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:05:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:08,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:05:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 13:05:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:05:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 13:05:08,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 13:05:08,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:08,357 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:05:08,358 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:05:08,361 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:05:08,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:05:08,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:05:08,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:08,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:05:08,528 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:05:08,528 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:05:08,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:08,531 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:05:08,531 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:05:08,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:08,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:08,532 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:05:08,532 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:05:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:08,535 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:05:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:05:08,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:08,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:08,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:08,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:08,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:05:08,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:05:08,541 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 13:05:08,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:08,541 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:05:08,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:05:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:05:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:05:08,542 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:08,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:08,543 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:08,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:08,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 13:05:08,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:08,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:08,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:08,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:08,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:08,843 INFO L256 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {108#true} is VALID [2018-11-23 13:05:08,844 INFO L273 TraceCheckUtils]: 1: Hoare triple {108#true} assume true; {108#true} is VALID [2018-11-23 13:05:08,844 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {108#true} {108#true} #31#return; {108#true} is VALID [2018-11-23 13:05:08,845 INFO L256 TraceCheckUtils]: 3: Hoare triple {108#true} call #t~ret0 := main(); {108#true} is VALID [2018-11-23 13:05:08,846 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:05:08,847 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:05:08,849 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:05:08,849 INFO L256 TraceCheckUtils]: 7: Hoare triple {109#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {109#false} is VALID [2018-11-23 13:05:08,849 INFO L273 TraceCheckUtils]: 8: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2018-11-23 13:05:08,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2018-11-23 13:05:08,850 INFO L273 TraceCheckUtils]: 10: Hoare triple {109#false} assume !false; {109#false} is VALID [2018-11-23 13:05:08,851 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:05:08,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:08,852 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:05:08,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:08,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:09,057 INFO L256 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {108#true} is VALID [2018-11-23 13:05:09,058 INFO L273 TraceCheckUtils]: 1: Hoare triple {108#true} assume true; {108#true} is VALID [2018-11-23 13:05:09,059 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {108#true} {108#true} #31#return; {108#true} is VALID [2018-11-23 13:05:09,060 INFO L256 TraceCheckUtils]: 3: Hoare triple {108#true} call #t~ret0 := main(); {108#true} is VALID [2018-11-23 13:05:09,061 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:05:09,062 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:05:09,064 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:05:09,064 INFO L256 TraceCheckUtils]: 7: Hoare triple {109#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {109#false} is VALID [2018-11-23 13:05:09,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2018-11-23 13:05:09,065 INFO L273 TraceCheckUtils]: 9: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2018-11-23 13:05:09,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {109#false} assume !false; {109#false} is VALID [2018-11-23 13:05:09,067 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:05:09,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:09,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:05:09,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:05:09,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:09,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:05:09,133 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:05:09,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:05:09,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:05:09,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:05:09,134 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2018-11-23 13:05:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:09,438 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:05:09,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:05:09,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:05:09,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:09,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:05:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:05:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:05:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-23 13:05:09,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2018-11-23 13:05:09,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:09,681 INFO L225 Difference]: With dead ends: 18 [2018-11-23 13:05:09,681 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:05:09,682 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:05:09,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:05:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:05:09,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:09,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:05:09,848 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:05:09,848 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:05:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:09,850 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:05:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:05:09,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:09,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:09,851 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:05:09,852 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:05:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:09,853 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:05:09,854 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:05:09,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:09,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:09,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:09,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:05:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:05:09,857 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 13:05:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:09,857 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:05:09,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:05:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:05:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:05:09,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:09,858 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:09,859 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:09,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:09,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2018-11-23 13:05:09,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:09,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:09,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:09,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:09,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:10,185 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 13:05:10,185 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 13:05:10,185 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #31#return; {222#true} is VALID [2018-11-23 13:05:10,186 INFO L256 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret0 := main(); {222#true} is VALID [2018-11-23 13:05:10,200 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:05:10,201 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:05:10,202 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:05:10,204 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:05:10,205 INFO L256 TraceCheckUtils]: 8: Hoare triple {223#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {223#false} is VALID [2018-11-23 13:05:10,205 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 13:05:10,206 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 13:05:10,206 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 13:05:10,207 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:05:10,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:10,208 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:05:10,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:10,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:10,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:10,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:10,332 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 13:05:10,332 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 13:05:10,333 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #31#return; {222#true} is VALID [2018-11-23 13:05:10,333 INFO L256 TraceCheckUtils]: 3: Hoare triple {222#true} call #t~ret0 := main(); {222#true} is VALID [2018-11-23 13:05:10,334 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:05:10,335 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:05:10,336 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:05:10,341 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:05:10,342 INFO L256 TraceCheckUtils]: 8: Hoare triple {223#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {223#false} is VALID [2018-11-23 13:05:10,342 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 13:05:10,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 13:05:10,343 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 13:05:10,344 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:05:10,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:10,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:05:10,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:05:10,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:10,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:05:10,378 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:05:10,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:05:10,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:05:10,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:05:10,380 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2018-11-23 13:05:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:10,551 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:05:10,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:05:10,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-11-23 13:05:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:05:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:05:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:05:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:05:10,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2018-11-23 13:05:10,597 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:05:10,598 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:05:10,598 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:05:10,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:05:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:05:10,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:05:10,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:10,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:05:10,623 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:05:10,623 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:05:10,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:10,625 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:05:10,626 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:05:10,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:10,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:10,626 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:05:10,626 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:05:10,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:10,628 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:05:10,628 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:05:10,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:10,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:10,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:10,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:05:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:05:10,630 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-11-23 13:05:10,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:10,631 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:05:10,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:05:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:05:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:05:10,632 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:10,632 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:10,632 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:10,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:10,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2018-11-23 13:05:10,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:10,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:10,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:10,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:10,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:11,122 INFO L256 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2018-11-23 13:05:11,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2018-11-23 13:05:11,123 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #31#return; {346#true} is VALID [2018-11-23 13:05:11,123 INFO L256 TraceCheckUtils]: 3: Hoare triple {346#true} call #t~ret0 := main(); {346#true} is VALID [2018-11-23 13:05:11,123 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:05:11,125 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:05:11,135 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:05:11,136 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:05:11,142 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:05:11,142 INFO L256 TraceCheckUtils]: 9: Hoare triple {347#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {347#false} is VALID [2018-11-23 13:05:11,143 INFO L273 TraceCheckUtils]: 10: Hoare triple {347#false} ~cond := #in~cond; {347#false} is VALID [2018-11-23 13:05:11,143 INFO L273 TraceCheckUtils]: 11: Hoare triple {347#false} assume 0 == ~cond; {347#false} is VALID [2018-11-23 13:05:11,143 INFO L273 TraceCheckUtils]: 12: Hoare triple {347#false} assume !false; {347#false} is VALID [2018-11-23 13:05:11,144 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:05:11,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:11,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:05:11,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:11,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:05:11,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:11,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:11,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2018-11-23 13:05:11,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2018-11-23 13:05:11,275 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #31#return; {346#true} is VALID [2018-11-23 13:05:11,275 INFO L256 TraceCheckUtils]: 3: Hoare triple {346#true} call #t~ret0 := main(); {346#true} is VALID [2018-11-23 13:05:11,276 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:05:11,276 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:05:11,277 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:05:11,278 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:05:11,279 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:05:11,279 INFO L256 TraceCheckUtils]: 9: Hoare triple {347#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {347#false} is VALID [2018-11-23 13:05:11,280 INFO L273 TraceCheckUtils]: 10: Hoare triple {347#false} ~cond := #in~cond; {347#false} is VALID [2018-11-23 13:05:11,280 INFO L273 TraceCheckUtils]: 11: Hoare triple {347#false} assume 0 == ~cond; {347#false} is VALID [2018-11-23 13:05:11,280 INFO L273 TraceCheckUtils]: 12: Hoare triple {347#false} assume !false; {347#false} is VALID [2018-11-23 13:05:11,281 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:05:11,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:11,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:05:11,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 13:05:11,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:11,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:05:11,319 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:05:11,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:05:11,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:05:11,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:05:11,320 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2018-11-23 13:05:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:11,484 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:05:11,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:05:11,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 13:05:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:11,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:05:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-23 13:05:11,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:05:11,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2018-11-23 13:05:11,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2018-11-23 13:05:11,518 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:11,519 INFO L225 Difference]: With dead ends: 20 [2018-11-23 13:05:11,520 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:05:11,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:05:11,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:05:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:05:11,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:11,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 13:05:11,538 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:05:11,538 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:05:11,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:11,539 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:05:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:05:11,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:11,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:11,540 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 13:05:11,540 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 13:05:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:11,542 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 13:05:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:05:11,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:11,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:11,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:11,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:05:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 13:05:11,544 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-11-23 13:05:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:11,545 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 13:05:11,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:05:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 13:05:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:05:11,546 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:11,546 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:11,546 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:11,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:11,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2018-11-23 13:05:11,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:11,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:11,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:11,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:11,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:12,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2018-11-23 13:05:12,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {480#true} assume true; {480#true} is VALID [2018-11-23 13:05:12,130 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {480#true} {480#true} #31#return; {480#true} is VALID [2018-11-23 13:05:12,131 INFO L256 TraceCheckUtils]: 3: Hoare triple {480#true} call #t~ret0 := main(); {480#true} is VALID [2018-11-23 13:05:12,132 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:05:12,133 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:05:12,134 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:05:12,135 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:05:12,141 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:05:12,142 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:05:12,142 INFO L256 TraceCheckUtils]: 10: Hoare triple {481#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {481#false} is VALID [2018-11-23 13:05:12,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {481#false} ~cond := #in~cond; {481#false} is VALID [2018-11-23 13:05:12,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {481#false} assume 0 == ~cond; {481#false} is VALID [2018-11-23 13:05:12,143 INFO L273 TraceCheckUtils]: 13: Hoare triple {481#false} assume !false; {481#false} is VALID [2018-11-23 13:05:12,143 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:05:12,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:12,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:12,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:12,163 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:12,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:12,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:12,353 INFO L256 TraceCheckUtils]: 0: Hoare triple {480#true} call ULTIMATE.init(); {480#true} is VALID [2018-11-23 13:05:12,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {480#true} assume true; {480#true} is VALID [2018-11-23 13:05:12,354 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {480#true} {480#true} #31#return; {480#true} is VALID [2018-11-23 13:05:12,354 INFO L256 TraceCheckUtils]: 3: Hoare triple {480#true} call #t~ret0 := main(); {480#true} is VALID [2018-11-23 13:05:12,356 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:05:12,357 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:05:12,358 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:05:12,358 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:05:12,359 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:05:12,364 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:05:12,364 INFO L256 TraceCheckUtils]: 10: Hoare triple {481#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {481#false} is VALID [2018-11-23 13:05:12,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {481#false} ~cond := #in~cond; {481#false} is VALID [2018-11-23 13:05:12,365 INFO L273 TraceCheckUtils]: 12: Hoare triple {481#false} assume 0 == ~cond; {481#false} is VALID [2018-11-23 13:05:12,365 INFO L273 TraceCheckUtils]: 13: Hoare triple {481#false} assume !false; {481#false} is VALID [2018-11-23 13:05:12,366 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:05:12,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:12,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:05:12,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 13:05:12,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:12,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:05:12,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:12,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:05:12,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:05:12,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:05:12,455 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-11-23 13:05:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:12,651 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:05:12,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:05:12,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 13:05:12,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:05:12,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-11-23 13:05:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:05:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2018-11-23 13:05:12,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2018-11-23 13:05:12,676 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:05:12,677 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:05:12,678 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:05:12,679 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:05:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:05:12,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:05:12,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:12,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:05:12,781 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:05:12,781 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:05:12,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:12,782 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:05:12,782 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:05:12,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:12,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:12,784 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:05:12,784 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:05:12,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:12,786 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:05:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:05:12,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:12,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:12,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:12,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:05:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 13:05:12,788 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-23 13:05:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:12,789 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 13:05:12,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:05:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:05:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:05:12,790 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:12,790 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:12,790 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:12,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:12,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2018-11-23 13:05:12,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:12,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:12,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:12,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:12,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:13,202 INFO L256 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {624#true} is VALID [2018-11-23 13:05:13,202 INFO L273 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2018-11-23 13:05:13,202 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #31#return; {624#true} is VALID [2018-11-23 13:05:13,203 INFO L256 TraceCheckUtils]: 3: Hoare triple {624#true} call #t~ret0 := main(); {624#true} is VALID [2018-11-23 13:05:13,203 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:05:13,213 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:05:13,226 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:05:13,235 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:05:13,236 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:05:13,240 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:05:13,242 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:05:13,243 INFO L256 TraceCheckUtils]: 11: Hoare triple {625#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {625#false} is VALID [2018-11-23 13:05:13,243 INFO L273 TraceCheckUtils]: 12: Hoare triple {625#false} ~cond := #in~cond; {625#false} is VALID [2018-11-23 13:05:13,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {625#false} assume 0 == ~cond; {625#false} is VALID [2018-11-23 13:05:13,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {625#false} assume !false; {625#false} is VALID [2018-11-23 13:05:13,245 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:05:13,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:13,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:13,262 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:05:13,273 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 13:05:13,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:13,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:13,373 INFO L256 TraceCheckUtils]: 0: Hoare triple {624#true} call ULTIMATE.init(); {624#true} is VALID [2018-11-23 13:05:13,374 INFO L273 TraceCheckUtils]: 1: Hoare triple {624#true} assume true; {624#true} is VALID [2018-11-23 13:05:13,374 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {624#true} {624#true} #31#return; {624#true} is VALID [2018-11-23 13:05:13,374 INFO L256 TraceCheckUtils]: 3: Hoare triple {624#true} call #t~ret0 := main(); {624#true} is VALID [2018-11-23 13:05:13,377 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:05:13,379 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:05:13,382 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:05:13,383 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:05:13,384 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:05:13,385 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:05:13,385 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:05:13,385 INFO L256 TraceCheckUtils]: 11: Hoare triple {625#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {625#false} is VALID [2018-11-23 13:05:13,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {625#false} ~cond := #in~cond; {625#false} is VALID [2018-11-23 13:05:13,386 INFO L273 TraceCheckUtils]: 13: Hoare triple {625#false} assume 0 == ~cond; {625#false} is VALID [2018-11-23 13:05:13,386 INFO L273 TraceCheckUtils]: 14: Hoare triple {625#false} assume !false; {625#false} is VALID [2018-11-23 13:05:13,387 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:05:13,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:13,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:05:13,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-11-23 13:05:13,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:13,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:05:13,425 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:05:13,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:05:13,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:05:13,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:05:13,426 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2018-11-23 13:05:13,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,647 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:05:13,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:05:13,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-11-23 13:05:13,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:05:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-11-23 13:05:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:05:13,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-11-23 13:05:13,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2018-11-23 13:05:13,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:13,685 INFO L225 Difference]: With dead ends: 22 [2018-11-23 13:05:13,685 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 13:05:13,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:05:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 13:05:13,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 13:05:13,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:13,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 13:05:13,701 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:05:13,701 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:05:13,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,703 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 13:05:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:05:13,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:13,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:13,704 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 13:05:13,705 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 13:05:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,706 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 13:05:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:05:13,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:13,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:13,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:13,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:13,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:05:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 13:05:13,709 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-11-23 13:05:13,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:13,709 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 13:05:13,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:05:13,709 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 13:05:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:05:13,710 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:13,710 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:13,711 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:13,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:13,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2018-11-23 13:05:13,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:13,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:13,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:13,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:13,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:13,973 INFO L256 TraceCheckUtils]: 0: Hoare triple {778#true} call ULTIMATE.init(); {778#true} is VALID [2018-11-23 13:05:13,974 INFO L273 TraceCheckUtils]: 1: Hoare triple {778#true} assume true; {778#true} is VALID [2018-11-23 13:05:13,974 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {778#true} {778#true} #31#return; {778#true} is VALID [2018-11-23 13:05:13,974 INFO L256 TraceCheckUtils]: 3: Hoare triple {778#true} call #t~ret0 := main(); {778#true} is VALID [2018-11-23 13:05:13,975 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:05:13,976 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:05:13,977 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:05:13,978 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:05:13,979 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:05:13,980 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:05:13,981 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:05:13,983 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:05:13,983 INFO L256 TraceCheckUtils]: 12: Hoare triple {779#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {779#false} is VALID [2018-11-23 13:05:13,983 INFO L273 TraceCheckUtils]: 13: Hoare triple {779#false} ~cond := #in~cond; {779#false} is VALID [2018-11-23 13:05:13,984 INFO L273 TraceCheckUtils]: 14: Hoare triple {779#false} assume 0 == ~cond; {779#false} is VALID [2018-11-23 13:05:13,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {779#false} assume !false; {779#false} is VALID [2018-11-23 13:05:13,986 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:05:13,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:13,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:14,003 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:05:14,021 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 13:05:14,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:14,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:14,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {778#true} call ULTIMATE.init(); {778#true} is VALID [2018-11-23 13:05:14,313 INFO L273 TraceCheckUtils]: 1: Hoare triple {778#true} assume true; {778#true} is VALID [2018-11-23 13:05:14,313 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {778#true} {778#true} #31#return; {778#true} is VALID [2018-11-23 13:05:14,313 INFO L256 TraceCheckUtils]: 3: Hoare triple {778#true} call #t~ret0 := main(); {778#true} is VALID [2018-11-23 13:05:14,314 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:05:14,315 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:05:14,316 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:05:14,317 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:05:14,318 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:05:14,318 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:05:14,320 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:05:14,321 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:05:14,321 INFO L256 TraceCheckUtils]: 12: Hoare triple {779#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {779#false} is VALID [2018-11-23 13:05:14,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {779#false} ~cond := #in~cond; {779#false} is VALID [2018-11-23 13:05:14,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {779#false} assume 0 == ~cond; {779#false} is VALID [2018-11-23 13:05:14,322 INFO L273 TraceCheckUtils]: 15: Hoare triple {779#false} assume !false; {779#false} is VALID [2018-11-23 13:05:14,324 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:05:14,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:14,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 13:05:14,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 13:05:14,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:14,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:05:14,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:14,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:05:14,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:05:14,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:05:14,379 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-11-23 13:05:14,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:14,598 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:05:14,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:05:14,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 13:05:14,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:05:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-11-23 13:05:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:05:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2018-11-23 13:05:14,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2018-11-23 13:05:14,631 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:05:14,632 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:05:14,632 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:05:14,633 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:05:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:05:14,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:05:14,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:14,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 13:05:14,664 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:05:14,664 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:05:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:14,666 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:05:14,666 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:05:14,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:14,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:14,667 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:05:14,667 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:05:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:14,669 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:05:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:05:14,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:14,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:14,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:14,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:05:14,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 13:05:14,671 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-11-23 13:05:14,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:14,671 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 13:05:14,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:05:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:05:14,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:05:14,672 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:14,672 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:14,673 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:14,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:14,673 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 7 times [2018-11-23 13:05:14,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:14,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:14,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:14,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:14,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:14,958 INFO L256 TraceCheckUtils]: 0: Hoare triple {942#true} call ULTIMATE.init(); {942#true} is VALID [2018-11-23 13:05:14,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {942#true} assume true; {942#true} is VALID [2018-11-23 13:05:14,959 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {942#true} {942#true} #31#return; {942#true} is VALID [2018-11-23 13:05:14,959 INFO L256 TraceCheckUtils]: 3: Hoare triple {942#true} call #t~ret0 := main(); {942#true} is VALID [2018-11-23 13:05:14,960 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:05:14,962 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:05:14,963 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:05:14,963 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:05:14,964 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:05:14,965 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:05:14,966 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:05:14,967 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:05:14,968 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:05:14,969 INFO L256 TraceCheckUtils]: 13: Hoare triple {943#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {943#false} is VALID [2018-11-23 13:05:14,969 INFO L273 TraceCheckUtils]: 14: Hoare triple {943#false} ~cond := #in~cond; {943#false} is VALID [2018-11-23 13:05:14,969 INFO L273 TraceCheckUtils]: 15: Hoare triple {943#false} assume 0 == ~cond; {943#false} is VALID [2018-11-23 13:05:14,970 INFO L273 TraceCheckUtils]: 16: Hoare triple {943#false} assume !false; {943#false} is VALID [2018-11-23 13:05:14,971 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:05:14,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:14,972 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:14,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:14,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:15,100 INFO L256 TraceCheckUtils]: 0: Hoare triple {942#true} call ULTIMATE.init(); {942#true} is VALID [2018-11-23 13:05:15,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {942#true} assume true; {942#true} is VALID [2018-11-23 13:05:15,101 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {942#true} {942#true} #31#return; {942#true} is VALID [2018-11-23 13:05:15,101 INFO L256 TraceCheckUtils]: 3: Hoare triple {942#true} call #t~ret0 := main(); {942#true} is VALID [2018-11-23 13:05:15,103 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:05:15,103 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:05:15,104 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:05:15,106 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:05:15,107 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:05:15,108 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:05:15,109 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:05:15,110 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:05:15,112 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:05:15,112 INFO L256 TraceCheckUtils]: 13: Hoare triple {943#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {943#false} is VALID [2018-11-23 13:05:15,113 INFO L273 TraceCheckUtils]: 14: Hoare triple {943#false} ~cond := #in~cond; {943#false} is VALID [2018-11-23 13:05:15,113 INFO L273 TraceCheckUtils]: 15: Hoare triple {943#false} assume 0 == ~cond; {943#false} is VALID [2018-11-23 13:05:15,114 INFO L273 TraceCheckUtils]: 16: Hoare triple {943#false} assume !false; {943#false} is VALID [2018-11-23 13:05:15,115 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:05:15,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:15,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:05:15,135 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-23 13:05:15,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:15,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:05:15,157 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:05:15,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:05:15,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:05:15,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:05:15,159 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2018-11-23 13:05:15,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:15,489 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:05:15,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:05:15,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-23 13:05:15,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:15,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:05:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2018-11-23 13:05:15,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:05:15,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2018-11-23 13:05:15,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2018-11-23 13:05:15,530 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:15,532 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:05:15,532 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 13:05:15,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:05:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 13:05:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 13:05:15,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:15,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 13:05:15,586 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 13:05:15,587 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 13:05:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:15,590 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:05:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:05:15,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:15,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:15,591 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 13:05:15,591 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 13:05:15,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:15,592 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:05:15,592 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:05:15,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:15,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:15,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:15,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:05:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 13:05:15,594 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-11-23 13:05:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:15,594 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-23 13:05:15,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:05:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 13:05:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:05:15,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:15,595 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:15,596 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:15,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:15,596 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 8 times [2018-11-23 13:05:15,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:15,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:15,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:15,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:15,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2018-11-23 13:05:15,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {1116#true} assume true; {1116#true} is VALID [2018-11-23 13:05:15,992 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1116#true} {1116#true} #31#return; {1116#true} is VALID [2018-11-23 13:05:15,993 INFO L256 TraceCheckUtils]: 3: Hoare triple {1116#true} call #t~ret0 := main(); {1116#true} is VALID [2018-11-23 13:05:15,993 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:05:15,999 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:05:16,001 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:05:16,002 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:05:16,003 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:05:16,003 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:05:16,005 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:05:16,009 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:05:16,010 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:05:16,012 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:05:16,012 INFO L256 TraceCheckUtils]: 14: Hoare triple {1117#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1117#false} is VALID [2018-11-23 13:05:16,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {1117#false} ~cond := #in~cond; {1117#false} is VALID [2018-11-23 13:05:16,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {1117#false} assume 0 == ~cond; {1117#false} is VALID [2018-11-23 13:05:16,012 INFO L273 TraceCheckUtils]: 17: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2018-11-23 13:05:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:16,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:16,014 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:16,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:16,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:16,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:16,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:16,280 INFO L256 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2018-11-23 13:05:16,280 INFO L273 TraceCheckUtils]: 1: Hoare triple {1116#true} assume true; {1116#true} is VALID [2018-11-23 13:05:16,280 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1116#true} {1116#true} #31#return; {1116#true} is VALID [2018-11-23 13:05:16,280 INFO L256 TraceCheckUtils]: 3: Hoare triple {1116#true} call #t~ret0 := main(); {1116#true} is VALID [2018-11-23 13:05:16,281 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:05:16,287 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:05:16,290 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:05:16,291 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:05:16,293 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:05:16,293 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:05:16,295 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:05:16,296 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:05:16,301 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:05:16,309 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:05:16,309 INFO L256 TraceCheckUtils]: 14: Hoare triple {1117#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1117#false} is VALID [2018-11-23 13:05:16,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {1117#false} ~cond := #in~cond; {1117#false} is VALID [2018-11-23 13:05:16,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {1117#false} assume 0 == ~cond; {1117#false} is VALID [2018-11-23 13:05:16,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2018-11-23 13:05:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:05:16,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:16,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 13:05:16,331 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-23 13:05:16,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:16,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:05:16,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:16,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:05:16,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:05:16,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:05:16,354 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2018-11-23 13:05:16,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:16,924 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 13:05:16,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:05:16,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-11-23 13:05:16,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:16,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:05:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2018-11-23 13:05:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:05:16,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2018-11-23 13:05:16,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 25 transitions. [2018-11-23 13:05:16,953 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:05:16,954 INFO L225 Difference]: With dead ends: 25 [2018-11-23 13:05:16,954 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:05:16,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:05:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:05:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:05:16,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:16,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 13:05:16,973 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:05:16,973 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:05:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:16,975 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:05:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:05:16,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:16,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:16,975 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:05:16,975 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:05:16,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:16,977 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:05:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:05:16,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:16,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:16,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:16,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:05:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-23 13:05:16,978 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-11-23 13:05:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:16,979 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-23 13:05:16,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:05:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:05:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:05:16,979 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:16,980 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:16,980 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:16,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:16,980 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 9 times [2018-11-23 13:05:16,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:16,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:16,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:16,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:16,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:17,303 INFO L256 TraceCheckUtils]: 0: Hoare triple {1300#true} call ULTIMATE.init(); {1300#true} is VALID [2018-11-23 13:05:17,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {1300#true} assume true; {1300#true} is VALID [2018-11-23 13:05:17,304 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1300#true} {1300#true} #31#return; {1300#true} is VALID [2018-11-23 13:05:17,305 INFO L256 TraceCheckUtils]: 3: Hoare triple {1300#true} call #t~ret0 := main(); {1300#true} is VALID [2018-11-23 13:05:17,307 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:05:17,308 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:05:17,308 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:05:17,309 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:05:17,310 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:05:17,310 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:05:17,312 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:05:17,315 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:05:17,317 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:05:17,321 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:05:17,323 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:05:17,323 INFO L256 TraceCheckUtils]: 15: Hoare triple {1301#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1301#false} is VALID [2018-11-23 13:05:17,323 INFO L273 TraceCheckUtils]: 16: Hoare triple {1301#false} ~cond := #in~cond; {1301#false} is VALID [2018-11-23 13:05:17,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {1301#false} assume 0 == ~cond; {1301#false} is VALID [2018-11-23 13:05:17,323 INFO L273 TraceCheckUtils]: 18: Hoare triple {1301#false} assume !false; {1301#false} is VALID [2018-11-23 13:05:17,324 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:05:17,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:17,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:17,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:17,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 13:05:17,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:17,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:17,455 INFO L256 TraceCheckUtils]: 0: Hoare triple {1300#true} call ULTIMATE.init(); {1300#true} is VALID [2018-11-23 13:05:17,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {1300#true} assume true; {1300#true} is VALID [2018-11-23 13:05:17,456 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1300#true} {1300#true} #31#return; {1300#true} is VALID [2018-11-23 13:05:17,456 INFO L256 TraceCheckUtils]: 3: Hoare triple {1300#true} call #t~ret0 := main(); {1300#true} is VALID [2018-11-23 13:05:17,457 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:05:17,458 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:05:17,459 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:05:17,459 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:05:17,460 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:05:17,461 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:05:17,480 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:05:17,494 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:05:17,509 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:05:17,518 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:05:17,529 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:05:17,529 INFO L256 TraceCheckUtils]: 15: Hoare triple {1301#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1301#false} is VALID [2018-11-23 13:05:17,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {1301#false} ~cond := #in~cond; {1301#false} is VALID [2018-11-23 13:05:17,530 INFO L273 TraceCheckUtils]: 17: Hoare triple {1301#false} assume 0 == ~cond; {1301#false} is VALID [2018-11-23 13:05:17,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {1301#false} assume !false; {1301#false} is VALID [2018-11-23 13:05:17,531 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:05:17,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:17,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 13:05:17,550 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-11-23 13:05:17,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:17,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:05:17,569 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:05:17,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:05:17,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:05:17,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:05:17,571 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2018-11-23 13:05:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:18,002 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:05:18,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:05:18,002 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-11-23 13:05:18,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:05:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2018-11-23 13:05:18,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:05:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2018-11-23 13:05:18,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2018-11-23 13:05:18,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:18,062 INFO L225 Difference]: With dead ends: 26 [2018-11-23 13:05:18,063 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 13:05:18,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:05:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 13:05:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 13:05:18,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:18,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 13:05:18,091 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:05:18,091 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:05:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:18,093 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:05:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:05:18,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:18,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:18,093 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 13:05:18,094 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 13:05:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:18,095 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 13:05:18,095 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:05:18,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:18,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:18,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:18,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:05:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 13:05:18,097 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-11-23 13:05:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:18,098 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 13:05:18,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:05:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 13:05:18,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:05:18,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:18,099 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:18,099 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:18,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:18,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 10 times [2018-11-23 13:05:18,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:18,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:18,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:18,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:18,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:18,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {1494#true} call ULTIMATE.init(); {1494#true} is VALID [2018-11-23 13:05:18,710 INFO L273 TraceCheckUtils]: 1: Hoare triple {1494#true} assume true; {1494#true} is VALID [2018-11-23 13:05:18,710 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1494#true} {1494#true} #31#return; {1494#true} is VALID [2018-11-23 13:05:18,710 INFO L256 TraceCheckUtils]: 3: Hoare triple {1494#true} call #t~ret0 := main(); {1494#true} is VALID [2018-11-23 13:05:18,710 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:05:18,711 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:05:18,712 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:05:18,713 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:05:18,714 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:05:18,715 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:05:18,716 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:05:18,720 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:05:18,720 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:05:18,721 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:05:18,722 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:05:18,722 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:05:18,723 INFO L256 TraceCheckUtils]: 16: Hoare triple {1495#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1495#false} is VALID [2018-11-23 13:05:18,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {1495#false} ~cond := #in~cond; {1495#false} is VALID [2018-11-23 13:05:18,723 INFO L273 TraceCheckUtils]: 18: Hoare triple {1495#false} assume 0 == ~cond; {1495#false} is VALID [2018-11-23 13:05:18,723 INFO L273 TraceCheckUtils]: 19: Hoare triple {1495#false} assume !false; {1495#false} is VALID [2018-11-23 13:05:18,724 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:05:18,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:18,724 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:18,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:18,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:18,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:18,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:19,031 INFO L256 TraceCheckUtils]: 0: Hoare triple {1494#true} call ULTIMATE.init(); {1494#true} is VALID [2018-11-23 13:05:19,031 INFO L273 TraceCheckUtils]: 1: Hoare triple {1494#true} assume true; {1494#true} is VALID [2018-11-23 13:05:19,031 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1494#true} {1494#true} #31#return; {1494#true} is VALID [2018-11-23 13:05:19,031 INFO L256 TraceCheckUtils]: 3: Hoare triple {1494#true} call #t~ret0 := main(); {1494#true} is VALID [2018-11-23 13:05:19,032 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:05:19,033 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:05:19,033 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:05:19,035 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:05:19,036 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:05:19,037 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:05:19,039 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:05:19,040 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:05:19,041 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:05:19,042 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:05:19,043 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:05:19,044 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:05:19,045 INFO L256 TraceCheckUtils]: 16: Hoare triple {1495#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1495#false} is VALID [2018-11-23 13:05:19,045 INFO L273 TraceCheckUtils]: 17: Hoare triple {1495#false} ~cond := #in~cond; {1495#false} is VALID [2018-11-23 13:05:19,045 INFO L273 TraceCheckUtils]: 18: Hoare triple {1495#false} assume 0 == ~cond; {1495#false} is VALID [2018-11-23 13:05:19,046 INFO L273 TraceCheckUtils]: 19: Hoare triple {1495#false} assume !false; {1495#false} is VALID [2018-11-23 13:05:19,047 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:05:19,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:19,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 13:05:19,067 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-11-23 13:05:19,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:19,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:05:19,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:19,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:05:19,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:05:19,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:05:19,091 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 14 states. [2018-11-23 13:05:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:19,640 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 13:05:19,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:05:19,641 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-11-23 13:05:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:19,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:05:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2018-11-23 13:05:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:05:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2018-11-23 13:05:19,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 27 transitions. [2018-11-23 13:05:19,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:19,668 INFO L225 Difference]: With dead ends: 27 [2018-11-23 13:05:19,668 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:05:19,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:05:19,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:05:19,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 13:05:19,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:19,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 13:05:19,686 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:05:19,686 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:05:19,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:19,687 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:05:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:05:19,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:19,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:19,688 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:05:19,688 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:05:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:19,689 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:05:19,689 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:05:19,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:19,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:19,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:19,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:19,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:05:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-23 13:05:19,690 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-11-23 13:05:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:19,691 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-23 13:05:19,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:05:19,691 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:05:19,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:05:19,691 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:19,691 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:19,692 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:19,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:19,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 11 times [2018-11-23 13:05:19,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:19,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:19,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:19,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:19,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:20,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {1698#true} call ULTIMATE.init(); {1698#true} is VALID [2018-11-23 13:05:20,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {1698#true} assume true; {1698#true} is VALID [2018-11-23 13:05:20,025 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1698#true} {1698#true} #31#return; {1698#true} is VALID [2018-11-23 13:05:20,025 INFO L256 TraceCheckUtils]: 3: Hoare triple {1698#true} call #t~ret0 := main(); {1698#true} is VALID [2018-11-23 13:05:20,026 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:05:20,027 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:05:20,028 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:05:20,028 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:05:20,029 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:05:20,030 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:05:20,031 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:05:20,032 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:05:20,033 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:05:20,041 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:05:20,042 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:05:20,043 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:05:20,043 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:05:20,044 INFO L256 TraceCheckUtils]: 17: Hoare triple {1699#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1699#false} is VALID [2018-11-23 13:05:20,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {1699#false} ~cond := #in~cond; {1699#false} is VALID [2018-11-23 13:05:20,044 INFO L273 TraceCheckUtils]: 19: Hoare triple {1699#false} assume 0 == ~cond; {1699#false} is VALID [2018-11-23 13:05:20,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {1699#false} assume !false; {1699#false} is VALID [2018-11-23 13:05:20,045 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:05:20,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:20,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:20,055 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:05:46,261 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 13:05:46,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:46,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:46,492 INFO L256 TraceCheckUtils]: 0: Hoare triple {1698#true} call ULTIMATE.init(); {1698#true} is VALID [2018-11-23 13:05:46,492 INFO L273 TraceCheckUtils]: 1: Hoare triple {1698#true} assume true; {1698#true} is VALID [2018-11-23 13:05:46,492 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1698#true} {1698#true} #31#return; {1698#true} is VALID [2018-11-23 13:05:46,492 INFO L256 TraceCheckUtils]: 3: Hoare triple {1698#true} call #t~ret0 := main(); {1698#true} is VALID [2018-11-23 13:05:46,493 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:05:46,494 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:05:46,496 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:05:46,497 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:05:46,497 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:05:46,498 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:05:46,500 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:05:46,501 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:05:46,502 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:05:46,503 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:05:46,504 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:05:46,505 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:05:46,506 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:05:46,506 INFO L256 TraceCheckUtils]: 17: Hoare triple {1699#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1699#false} is VALID [2018-11-23 13:05:46,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {1699#false} ~cond := #in~cond; {1699#false} is VALID [2018-11-23 13:05:46,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {1699#false} assume 0 == ~cond; {1699#false} is VALID [2018-11-23 13:05:46,507 INFO L273 TraceCheckUtils]: 20: Hoare triple {1699#false} assume !false; {1699#false} is VALID [2018-11-23 13:05:46,507 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:05:46,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:46,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 13:05:46,527 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 13:05:46,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:46,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:05:46,546 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:05:46,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:05:46,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:05:46,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:05:46,547 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2018-11-23 13:05:47,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:47,209 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:05:47,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:05:47,209 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 13:05:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:05:47,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-11-23 13:05:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:05:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2018-11-23 13:05:47,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2018-11-23 13:05:47,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:47,245 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:05:47,245 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 13:05:47,246 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:05:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 13:05:47,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 13:05:47,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:47,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 13:05:47,272 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 13:05:47,272 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 13:05:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:47,273 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:05:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:05:47,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:47,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:47,274 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 13:05:47,274 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 13:05:47,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:47,275 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 13:05:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:05:47,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:47,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:47,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:47,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:05:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-11-23 13:05:47,276 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-11-23 13:05:47,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:47,276 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-11-23 13:05:47,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:05:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-11-23 13:05:47,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:05:47,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:47,277 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:47,277 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:47,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:47,277 INFO L82 PathProgramCache]: Analyzing trace with hash -2081254018, now seen corresponding path program 12 times [2018-11-23 13:05:47,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:47,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:47,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:47,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:47,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:47,690 INFO L256 TraceCheckUtils]: 0: Hoare triple {1912#true} call ULTIMATE.init(); {1912#true} is VALID [2018-11-23 13:05:47,691 INFO L273 TraceCheckUtils]: 1: Hoare triple {1912#true} assume true; {1912#true} is VALID [2018-11-23 13:05:47,691 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1912#true} {1912#true} #31#return; {1912#true} is VALID [2018-11-23 13:05:47,691 INFO L256 TraceCheckUtils]: 3: Hoare triple {1912#true} call #t~ret0 := main(); {1912#true} is VALID [2018-11-23 13:05:47,692 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:05:47,693 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:05:47,693 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:05:47,694 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:05:47,694 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:05:47,695 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:05:47,696 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:05:47,697 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:05:47,698 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:05:47,699 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:05:47,700 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:05:47,701 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:05:47,702 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:05:47,703 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:05:47,704 INFO L256 TraceCheckUtils]: 18: Hoare triple {1913#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1913#false} is VALID [2018-11-23 13:05:47,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {1913#false} ~cond := #in~cond; {1913#false} is VALID [2018-11-23 13:05:47,704 INFO L273 TraceCheckUtils]: 20: Hoare triple {1913#false} assume 0 == ~cond; {1913#false} is VALID [2018-11-23 13:05:47,705 INFO L273 TraceCheckUtils]: 21: Hoare triple {1913#false} assume !false; {1913#false} is VALID [2018-11-23 13:05:47,706 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:05:47,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:47,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:47,721 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:05:47,935 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:05:47,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:47,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:48,120 INFO L256 TraceCheckUtils]: 0: Hoare triple {1912#true} call ULTIMATE.init(); {1912#true} is VALID [2018-11-23 13:05:48,121 INFO L273 TraceCheckUtils]: 1: Hoare triple {1912#true} assume true; {1912#true} is VALID [2018-11-23 13:05:48,121 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1912#true} {1912#true} #31#return; {1912#true} is VALID [2018-11-23 13:05:48,121 INFO L256 TraceCheckUtils]: 3: Hoare triple {1912#true} call #t~ret0 := main(); {1912#true} is VALID [2018-11-23 13:05:48,122 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:05:48,123 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:05:48,123 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:05:48,124 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:05:48,125 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:05:48,125 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:05:48,126 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:05:48,127 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:05:48,128 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:05:48,129 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:05:48,130 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:05:48,131 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:05:48,132 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:05:48,133 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:05:48,134 INFO L256 TraceCheckUtils]: 18: Hoare triple {1913#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1913#false} is VALID [2018-11-23 13:05:48,134 INFO L273 TraceCheckUtils]: 19: Hoare triple {1913#false} ~cond := #in~cond; {1913#false} is VALID [2018-11-23 13:05:48,134 INFO L273 TraceCheckUtils]: 20: Hoare triple {1913#false} assume 0 == ~cond; {1913#false} is VALID [2018-11-23 13:05:48,134 INFO L273 TraceCheckUtils]: 21: Hoare triple {1913#false} assume !false; {1913#false} is VALID [2018-11-23 13:05:48,136 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:05:48,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:48,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 13:05:48,157 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-23 13:05:48,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:48,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:05:48,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:48,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:05:48,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:05:48,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:05:48,180 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 16 states. [2018-11-23 13:05:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:48,806 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:05:48,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:05:48,807 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-23 13:05:48,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:05:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2018-11-23 13:05:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:05:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2018-11-23 13:05:48,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 29 transitions. [2018-11-23 13:05:48,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:48,848 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:05:48,848 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 13:05:48,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:05:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 13:05:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 13:05:48,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:48,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 13:05:48,960 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 13:05:48,961 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 13:05:48,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:48,962 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:05:48,962 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:05:48,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:48,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:48,963 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 13:05:48,963 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 13:05:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:48,964 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:05:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:05:48,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:48,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:48,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:48,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:05:48,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-23 13:05:48,965 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-11-23 13:05:48,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:48,966 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-23 13:05:48,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:05:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:05:48,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:05:48,967 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:48,967 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:48,967 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:48,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:48,967 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 13 times [2018-11-23 13:05:48,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:48,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:48,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:48,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:48,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:49,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {2136#true} call ULTIMATE.init(); {2136#true} is VALID [2018-11-23 13:05:49,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {2136#true} assume true; {2136#true} is VALID [2018-11-23 13:05:49,770 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2136#true} {2136#true} #31#return; {2136#true} is VALID [2018-11-23 13:05:49,770 INFO L256 TraceCheckUtils]: 3: Hoare triple {2136#true} call #t~ret0 := main(); {2136#true} is VALID [2018-11-23 13:05:49,771 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:05:49,772 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:05:49,773 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:05:49,774 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:05:49,775 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:05:49,777 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:05:49,778 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:05:49,779 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:05:49,780 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:05:49,781 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:05:49,782 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:05:49,783 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:05:49,785 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:05:49,786 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:05:49,787 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:05:49,787 INFO L256 TraceCheckUtils]: 19: Hoare triple {2137#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2137#false} is VALID [2018-11-23 13:05:49,788 INFO L273 TraceCheckUtils]: 20: Hoare triple {2137#false} ~cond := #in~cond; {2137#false} is VALID [2018-11-23 13:05:49,788 INFO L273 TraceCheckUtils]: 21: Hoare triple {2137#false} assume 0 == ~cond; {2137#false} is VALID [2018-11-23 13:05:49,788 INFO L273 TraceCheckUtils]: 22: Hoare triple {2137#false} assume !false; {2137#false} is VALID [2018-11-23 13:05:49,790 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:05:49,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:49,790 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:49,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:49,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:49,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {2136#true} call ULTIMATE.init(); {2136#true} is VALID [2018-11-23 13:05:49,972 INFO L273 TraceCheckUtils]: 1: Hoare triple {2136#true} assume true; {2136#true} is VALID [2018-11-23 13:05:49,973 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2136#true} {2136#true} #31#return; {2136#true} is VALID [2018-11-23 13:05:49,973 INFO L256 TraceCheckUtils]: 3: Hoare triple {2136#true} call #t~ret0 := main(); {2136#true} is VALID [2018-11-23 13:05:49,974 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:05:49,975 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:05:49,975 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:05:49,976 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:05:49,977 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:05:49,978 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:05:49,979 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:05:49,980 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:05:49,981 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:05:49,983 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:05:49,984 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:05:49,985 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:05:49,986 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:05:49,987 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:05:49,988 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:05:49,989 INFO L256 TraceCheckUtils]: 19: Hoare triple {2137#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2137#false} is VALID [2018-11-23 13:05:49,989 INFO L273 TraceCheckUtils]: 20: Hoare triple {2137#false} ~cond := #in~cond; {2137#false} is VALID [2018-11-23 13:05:49,989 INFO L273 TraceCheckUtils]: 21: Hoare triple {2137#false} assume 0 == ~cond; {2137#false} is VALID [2018-11-23 13:05:49,990 INFO L273 TraceCheckUtils]: 22: Hoare triple {2137#false} assume !false; {2137#false} is VALID [2018-11-23 13:05:49,991 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:05:50,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:50,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 13:05:50,025 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-23 13:05:50,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:50,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:05:50,048 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:05:50,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:05:50,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:05:50,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:05:50,050 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2018-11-23 13:05:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:50,660 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:05:50,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:05:50,660 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-23 13:05:50,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:50,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:05:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2018-11-23 13:05:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:05:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2018-11-23 13:05:50,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2018-11-23 13:05:50,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:50,691 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:05:50,691 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:05:50,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:05:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:05:50,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 13:05:50,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:50,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 13:05:50,717 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:05:50,717 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:05:50,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:50,718 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 13:05:50,718 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:05:50,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:50,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:50,719 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 13:05:50,720 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 13:05:50,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:50,721 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-11-23 13:05:50,721 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:05:50,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:50,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:50,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:50,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:05:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-11-23 13:05:50,723 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-11-23 13:05:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:50,723 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-11-23 13:05:50,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:05:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-11-23 13:05:50,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:05:50,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:50,724 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:50,724 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:50,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:50,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1758558242, now seen corresponding path program 14 times [2018-11-23 13:05:50,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:50,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:50,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:50,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:51,266 INFO L256 TraceCheckUtils]: 0: Hoare triple {2370#true} call ULTIMATE.init(); {2370#true} is VALID [2018-11-23 13:05:51,266 INFO L273 TraceCheckUtils]: 1: Hoare triple {2370#true} assume true; {2370#true} is VALID [2018-11-23 13:05:51,266 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2370#true} {2370#true} #31#return; {2370#true} is VALID [2018-11-23 13:05:51,267 INFO L256 TraceCheckUtils]: 3: Hoare triple {2370#true} call #t~ret0 := main(); {2370#true} is VALID [2018-11-23 13:05:51,267 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:05:51,268 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:05:51,269 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:05:51,270 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:05:51,272 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:05:51,273 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:05:51,274 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:05:51,275 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:05:51,276 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:05:51,277 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:05:51,278 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:05:51,279 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:05:51,280 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:05:51,281 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:05:51,282 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:05:51,283 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:05:51,283 INFO L256 TraceCheckUtils]: 20: Hoare triple {2371#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2371#false} is VALID [2018-11-23 13:05:51,284 INFO L273 TraceCheckUtils]: 21: Hoare triple {2371#false} ~cond := #in~cond; {2371#false} is VALID [2018-11-23 13:05:51,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {2371#false} assume 0 == ~cond; {2371#false} is VALID [2018-11-23 13:05:51,284 INFO L273 TraceCheckUtils]: 23: Hoare triple {2371#false} assume !false; {2371#false} is VALID [2018-11-23 13:05:51,286 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:05:51,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:51,286 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:51,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:51,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:51,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:51,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:51,431 INFO L256 TraceCheckUtils]: 0: Hoare triple {2370#true} call ULTIMATE.init(); {2370#true} is VALID [2018-11-23 13:05:51,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {2370#true} assume true; {2370#true} is VALID [2018-11-23 13:05:51,432 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2370#true} {2370#true} #31#return; {2370#true} is VALID [2018-11-23 13:05:51,432 INFO L256 TraceCheckUtils]: 3: Hoare triple {2370#true} call #t~ret0 := main(); {2370#true} is VALID [2018-11-23 13:05:51,433 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:05:51,434 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:05:51,435 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:05:51,436 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:05:51,437 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:05:51,439 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:05:51,440 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:05:51,441 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:05:51,442 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:05:51,443 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:05:51,444 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:05:51,445 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:05:51,446 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:05:51,447 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:05:51,448 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:05:51,449 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:05:51,449 INFO L256 TraceCheckUtils]: 20: Hoare triple {2371#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2371#false} is VALID [2018-11-23 13:05:51,449 INFO L273 TraceCheckUtils]: 21: Hoare triple {2371#false} ~cond := #in~cond; {2371#false} is VALID [2018-11-23 13:05:51,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {2371#false} assume 0 == ~cond; {2371#false} is VALID [2018-11-23 13:05:51,450 INFO L273 TraceCheckUtils]: 23: Hoare triple {2371#false} assume !false; {2371#false} is VALID [2018-11-23 13:05:51,451 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:05:51,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:51,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 13:05:51,471 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-11-23 13:05:51,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:51,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 13:05:51,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:51,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 13:05:51,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:05:51,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:05:51,505 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2018-11-23 13:05:52,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:52,343 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:05:52,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:05:52,343 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-11-23 13:05:52,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:52,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:05:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-11-23 13:05:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:05:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-11-23 13:05:52,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2018-11-23 13:05:52,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:52,373 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:05:52,373 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:05:52,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:05:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:05:52,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 13:05:52,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:52,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 13:05:52,402 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 13:05:52,402 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 13:05:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:52,403 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:05:52,404 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:05:52,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:52,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:52,404 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 13:05:52,404 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 13:05:52,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:52,405 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:05:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:05:52,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:52,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:52,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:52,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:05:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-23 13:05:52,406 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-11-23 13:05:52,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:52,406 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-23 13:05:52,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 13:05:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:05:52,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:05:52,407 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:52,407 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:52,407 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:52,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:52,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 15 times [2018-11-23 13:05:52,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:52,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:52,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:52,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:52,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:52,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {2614#true} call ULTIMATE.init(); {2614#true} is VALID [2018-11-23 13:05:52,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {2614#true} assume true; {2614#true} is VALID [2018-11-23 13:05:52,896 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2614#true} {2614#true} #31#return; {2614#true} is VALID [2018-11-23 13:05:52,896 INFO L256 TraceCheckUtils]: 3: Hoare triple {2614#true} call #t~ret0 := main(); {2614#true} is VALID [2018-11-23 13:05:52,897 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:05:52,898 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:05:52,899 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:05:52,899 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:05:52,900 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:05:52,901 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:05:52,902 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:05:52,903 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:05:52,921 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:05:52,922 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:05:52,922 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:05:52,923 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:05:52,924 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:05:52,924 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:05:52,925 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:05:52,926 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:05:52,927 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:05:52,927 INFO L256 TraceCheckUtils]: 21: Hoare triple {2615#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2615#false} is VALID [2018-11-23 13:05:52,928 INFO L273 TraceCheckUtils]: 22: Hoare triple {2615#false} ~cond := #in~cond; {2615#false} is VALID [2018-11-23 13:05:52,928 INFO L273 TraceCheckUtils]: 23: Hoare triple {2615#false} assume 0 == ~cond; {2615#false} is VALID [2018-11-23 13:05:52,928 INFO L273 TraceCheckUtils]: 24: Hoare triple {2615#false} assume !false; {2615#false} is VALID [2018-11-23 13:05:52,929 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:05:52,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:52,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:52,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:54,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 13:05:54,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:54,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:54,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {2614#true} call ULTIMATE.init(); {2614#true} is VALID [2018-11-23 13:05:54,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {2614#true} assume true; {2614#true} is VALID [2018-11-23 13:05:54,273 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2614#true} {2614#true} #31#return; {2614#true} is VALID [2018-11-23 13:05:54,273 INFO L256 TraceCheckUtils]: 3: Hoare triple {2614#true} call #t~ret0 := main(); {2614#true} is VALID [2018-11-23 13:05:54,274 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:05:54,274 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:05:54,275 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:05:54,275 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:05:54,276 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:05:54,277 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:05:54,278 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:05:54,279 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:05:54,280 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:05:54,281 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:05:54,282 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:05:54,283 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:05:54,284 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:05:54,285 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:05:54,286 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:05:54,287 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:05:54,288 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:05:54,288 INFO L256 TraceCheckUtils]: 21: Hoare triple {2615#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2615#false} is VALID [2018-11-23 13:05:54,288 INFO L273 TraceCheckUtils]: 22: Hoare triple {2615#false} ~cond := #in~cond; {2615#false} is VALID [2018-11-23 13:05:54,288 INFO L273 TraceCheckUtils]: 23: Hoare triple {2615#false} assume 0 == ~cond; {2615#false} is VALID [2018-11-23 13:05:54,289 INFO L273 TraceCheckUtils]: 24: Hoare triple {2615#false} assume !false; {2615#false} is VALID [2018-11-23 13:05:54,291 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:05:54,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:54,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 13:05:54,311 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2018-11-23 13:05:54,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:54,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:05:54,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:54,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:05:54,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:05:54,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:05:54,337 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2018-11-23 13:05:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:55,110 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:05:55,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:05:55,110 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2018-11-23 13:05:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:05:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2018-11-23 13:05:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:05:55,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2018-11-23 13:05:55,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2018-11-23 13:05:55,140 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:55,141 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:05:55,141 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 13:05:55,142 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:05:55,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 13:05:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 13:05:55,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:55,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 13:05:55,163 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 13:05:55,163 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 13:05:55,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:55,164 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 13:05:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:05:55,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:55,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:55,165 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 13:05:55,165 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 13:05:55,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:55,166 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-23 13:05:55,166 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:05:55,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:55,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:55,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:55,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:05:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 13:05:55,168 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-11-23 13:05:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:55,168 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 13:05:55,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:05:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 13:05:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:05:55,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:55,169 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:55,169 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:55,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:55,169 INFO L82 PathProgramCache]: Analyzing trace with hash -885562818, now seen corresponding path program 16 times [2018-11-23 13:05:55,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:55,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:55,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:55,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:55,572 INFO L256 TraceCheckUtils]: 0: Hoare triple {2868#true} call ULTIMATE.init(); {2868#true} is VALID [2018-11-23 13:05:55,572 INFO L273 TraceCheckUtils]: 1: Hoare triple {2868#true} assume true; {2868#true} is VALID [2018-11-23 13:05:55,573 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2868#true} {2868#true} #31#return; {2868#true} is VALID [2018-11-23 13:05:55,573 INFO L256 TraceCheckUtils]: 3: Hoare triple {2868#true} call #t~ret0 := main(); {2868#true} is VALID [2018-11-23 13:05:55,573 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:05:55,574 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:05:55,574 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:05:55,575 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:05:55,576 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:05:55,577 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:05:55,578 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:05:55,580 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:05:55,581 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:05:55,582 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:05:55,583 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:05:55,583 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:05:55,584 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:05:55,585 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:05:55,586 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:05:55,588 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:05:55,589 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:05:55,590 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:05:55,590 INFO L256 TraceCheckUtils]: 22: Hoare triple {2869#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2869#false} is VALID [2018-11-23 13:05:55,590 INFO L273 TraceCheckUtils]: 23: Hoare triple {2869#false} ~cond := #in~cond; {2869#false} is VALID [2018-11-23 13:05:55,590 INFO L273 TraceCheckUtils]: 24: Hoare triple {2869#false} assume 0 == ~cond; {2869#false} is VALID [2018-11-23 13:05:55,591 INFO L273 TraceCheckUtils]: 25: Hoare triple {2869#false} assume !false; {2869#false} is VALID [2018-11-23 13:05:55,592 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:05:55,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:55,593 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:55,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:55,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:55,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:55,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:55,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {2868#true} call ULTIMATE.init(); {2868#true} is VALID [2018-11-23 13:05:55,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {2868#true} assume true; {2868#true} is VALID [2018-11-23 13:05:55,801 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2868#true} {2868#true} #31#return; {2868#true} is VALID [2018-11-23 13:05:55,801 INFO L256 TraceCheckUtils]: 3: Hoare triple {2868#true} call #t~ret0 := main(); {2868#true} is VALID [2018-11-23 13:05:55,801 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:05:55,802 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:05:55,802 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:05:55,803 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:05:55,804 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:05:55,804 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:05:55,805 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:05:55,806 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:05:55,807 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:05:55,808 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:05:55,809 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:05:55,810 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:05:55,811 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:05:55,812 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:05:55,813 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:05:55,814 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:05:55,815 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:05:55,816 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:05:55,816 INFO L256 TraceCheckUtils]: 22: Hoare triple {2869#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2869#false} is VALID [2018-11-23 13:05:55,816 INFO L273 TraceCheckUtils]: 23: Hoare triple {2869#false} ~cond := #in~cond; {2869#false} is VALID [2018-11-23 13:05:55,817 INFO L273 TraceCheckUtils]: 24: Hoare triple {2869#false} assume 0 == ~cond; {2869#false} is VALID [2018-11-23 13:05:55,817 INFO L273 TraceCheckUtils]: 25: Hoare triple {2869#false} assume !false; {2869#false} is VALID [2018-11-23 13:05:55,818 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:05:55,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:55,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 13:05:55,839 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-11-23 13:05:55,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:55,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:05:55,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:55,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:05:55,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:05:55,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:05:55,864 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 20 states. [2018-11-23 13:05:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:56,692 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 13:05:56,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:05:56,692 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2018-11-23 13:05:56,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:05:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2018-11-23 13:05:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:05:56,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2018-11-23 13:05:56,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 33 transitions. [2018-11-23 13:05:56,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:56,724 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:05:56,724 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:05:56,725 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:05:56,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:05:56,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:05:56,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:56,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 13:05:56,752 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:05:56,753 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:05:56,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:56,754 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:05:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:05:56,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:56,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:56,754 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:05:56,754 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:05:56,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:56,756 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:05:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:05:56,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:56,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:56,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:56,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:05:56,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-23 13:05:56,758 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-11-23 13:05:56,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:56,758 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-23 13:05:56,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:05:56,758 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:05:56,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:05:56,759 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:56,759 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:56,759 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:56,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:56,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 17 times [2018-11-23 13:05:56,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:56,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:56,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:56,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:56,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:57,425 INFO L256 TraceCheckUtils]: 0: Hoare triple {3132#true} call ULTIMATE.init(); {3132#true} is VALID [2018-11-23 13:05:57,425 INFO L273 TraceCheckUtils]: 1: Hoare triple {3132#true} assume true; {3132#true} is VALID [2018-11-23 13:05:57,426 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3132#true} {3132#true} #31#return; {3132#true} is VALID [2018-11-23 13:05:57,426 INFO L256 TraceCheckUtils]: 3: Hoare triple {3132#true} call #t~ret0 := main(); {3132#true} is VALID [2018-11-23 13:05:57,427 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:05:57,428 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:05:57,429 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:05:57,429 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:05:57,430 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:05:57,430 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:05:57,431 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:05:57,433 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:05:57,434 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:05:57,435 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:05:57,436 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:05:57,437 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:05:57,438 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:05:57,440 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:05:57,441 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:05:57,442 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:05:57,443 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:05:57,444 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:05:57,445 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:05:57,446 INFO L256 TraceCheckUtils]: 23: Hoare triple {3133#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3133#false} is VALID [2018-11-23 13:05:57,446 INFO L273 TraceCheckUtils]: 24: Hoare triple {3133#false} ~cond := #in~cond; {3133#false} is VALID [2018-11-23 13:05:57,446 INFO L273 TraceCheckUtils]: 25: Hoare triple {3133#false} assume 0 == ~cond; {3133#false} is VALID [2018-11-23 13:05:57,446 INFO L273 TraceCheckUtils]: 26: Hoare triple {3133#false} assume !false; {3133#false} is VALID [2018-11-23 13:05:57,449 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:05:57,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:57,449 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:57,457 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:06:58,143 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 13:06:58,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:06:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:59,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:59,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {3132#true} call ULTIMATE.init(); {3132#true} is VALID [2018-11-23 13:06:59,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {3132#true} assume true; {3132#true} is VALID [2018-11-23 13:06:59,507 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3132#true} {3132#true} #31#return; {3132#true} is VALID [2018-11-23 13:06:59,508 INFO L256 TraceCheckUtils]: 3: Hoare triple {3132#true} call #t~ret0 := main(); {3132#true} is VALID [2018-11-23 13:06:59,508 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:06:59,509 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:06:59,510 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:06:59,510 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:06:59,511 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:06:59,512 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:06:59,513 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:06:59,515 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:06:59,516 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:06:59,518 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:06:59,519 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:06:59,520 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:06:59,521 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:06:59,522 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:06:59,523 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:06:59,524 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:06:59,526 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:06:59,527 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:06:59,528 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:06:59,528 INFO L256 TraceCheckUtils]: 23: Hoare triple {3133#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3133#false} is VALID [2018-11-23 13:06:59,528 INFO L273 TraceCheckUtils]: 24: Hoare triple {3133#false} ~cond := #in~cond; {3133#false} is VALID [2018-11-23 13:06:59,529 INFO L273 TraceCheckUtils]: 25: Hoare triple {3133#false} assume 0 == ~cond; {3133#false} is VALID [2018-11-23 13:06:59,529 INFO L273 TraceCheckUtils]: 26: Hoare triple {3133#false} assume !false; {3133#false} is VALID [2018-11-23 13:06:59,532 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:06:59,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:59,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 13:06:59,552 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-11-23 13:06:59,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:59,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 13:06:59,578 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:06:59,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:06:59,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:06:59,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:06:59,580 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2018-11-23 13:07:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:00,727 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:07:00,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:07:00,727 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-11-23 13:07:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:07:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2018-11-23 13:07:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:07:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2018-11-23 13:07:00,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2018-11-23 13:07:00,769 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:07:00,770 INFO L225 Difference]: With dead ends: 34 [2018-11-23 13:07:00,770 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:07:00,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:07:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:07:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 13:07:00,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:00,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 13:07:00,799 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:07:00,799 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:07:00,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:00,800 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:07:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:07:00,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:00,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:00,801 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:07:00,801 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:07:00,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:00,802 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-11-23 13:07:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:07:00,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:00,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:00,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:00,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:00,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:07:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-23 13:07:00,803 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-11-23 13:07:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:00,803 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-23 13:07:00,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:07:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 13:07:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:07:00,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:00,804 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:00,804 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:00,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:00,804 INFO L82 PathProgramCache]: Analyzing trace with hash 544416926, now seen corresponding path program 18 times [2018-11-23 13:07:00,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:00,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:00,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:00,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:00,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:01,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {3406#true} call ULTIMATE.init(); {3406#true} is VALID [2018-11-23 13:07:01,242 INFO L273 TraceCheckUtils]: 1: Hoare triple {3406#true} assume true; {3406#true} is VALID [2018-11-23 13:07:01,243 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3406#true} {3406#true} #31#return; {3406#true} is VALID [2018-11-23 13:07:01,243 INFO L256 TraceCheckUtils]: 3: Hoare triple {3406#true} call #t~ret0 := main(); {3406#true} is VALID [2018-11-23 13:07:01,261 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:07:01,267 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:07:01,268 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:07:01,269 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:07:01,269 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:07:01,270 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:07:01,271 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:07:01,271 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:07:01,272 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:07:01,273 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:07:01,274 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:07:01,275 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:07:01,276 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:07:01,277 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:07:01,278 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:07:01,279 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:07:01,280 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:07:01,281 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:07:01,282 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:07:01,283 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:07:01,283 INFO L256 TraceCheckUtils]: 24: Hoare triple {3407#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3407#false} is VALID [2018-11-23 13:07:01,284 INFO L273 TraceCheckUtils]: 25: Hoare triple {3407#false} ~cond := #in~cond; {3407#false} is VALID [2018-11-23 13:07:01,284 INFO L273 TraceCheckUtils]: 26: Hoare triple {3407#false} assume 0 == ~cond; {3407#false} is VALID [2018-11-23 13:07:01,284 INFO L273 TraceCheckUtils]: 27: Hoare triple {3407#false} assume !false; {3407#false} is VALID [2018-11-23 13:07:01,286 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:07:01,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:01,286 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:07:01,294 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:07:13,500 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 13:07:13,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:13,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:14,081 INFO L256 TraceCheckUtils]: 0: Hoare triple {3406#true} call ULTIMATE.init(); {3406#true} is VALID [2018-11-23 13:07:14,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {3406#true} assume true; {3406#true} is VALID [2018-11-23 13:07:14,082 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3406#true} {3406#true} #31#return; {3406#true} is VALID [2018-11-23 13:07:14,082 INFO L256 TraceCheckUtils]: 3: Hoare triple {3406#true} call #t~ret0 := main(); {3406#true} is VALID [2018-11-23 13:07:14,083 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:07:14,083 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:07:14,084 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:07:14,085 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:07:14,086 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:07:14,087 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:07:14,088 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:07:14,089 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:07:14,090 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:07:14,091 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:07:14,092 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:07:14,093 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:07:14,094 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:07:14,095 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:07:14,096 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:07:14,096 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:07:14,097 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:07:14,098 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:07:14,099 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:07:14,100 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:07:14,100 INFO L256 TraceCheckUtils]: 24: Hoare triple {3407#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3407#false} is VALID [2018-11-23 13:07:14,101 INFO L273 TraceCheckUtils]: 25: Hoare triple {3407#false} ~cond := #in~cond; {3407#false} is VALID [2018-11-23 13:07:14,101 INFO L273 TraceCheckUtils]: 26: Hoare triple {3407#false} assume 0 == ~cond; {3407#false} is VALID [2018-11-23 13:07:14,101 INFO L273 TraceCheckUtils]: 27: Hoare triple {3407#false} assume !false; {3407#false} is VALID [2018-11-23 13:07:14,103 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:07:14,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:14,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 13:07:14,123 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-11-23 13:07:14,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:14,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:07:14,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:14,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:07:14,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:07:14,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:07:14,149 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 22 states. [2018-11-23 13:07:15,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:15,068 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-11-23 13:07:15,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:07:15,068 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-11-23 13:07:15,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:07:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2018-11-23 13:07:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:07:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2018-11-23 13:07:15,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 35 transitions. [2018-11-23 13:07:15,506 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:07:15,507 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:07:15,507 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:07:15,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:07:15,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:07:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 13:07:15,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:15,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 13:07:15,585 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 13:07:15,585 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 13:07:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:15,586 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:07:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:07:15,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:15,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:15,586 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 13:07:15,586 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 13:07:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:15,587 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:07:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:07:15,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:15,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:15,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:15,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:07:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-23 13:07:15,589 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-11-23 13:07:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:15,589 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-23 13:07:15,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:07:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:07:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:07:15,590 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:15,590 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:15,590 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:15,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:15,591 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 19 times [2018-11-23 13:07:15,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:15,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:15,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:15,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:15,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:16,176 INFO L256 TraceCheckUtils]: 0: Hoare triple {3690#true} call ULTIMATE.init(); {3690#true} is VALID [2018-11-23 13:07:16,176 INFO L273 TraceCheckUtils]: 1: Hoare triple {3690#true} assume true; {3690#true} is VALID [2018-11-23 13:07:16,177 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3690#true} {3690#true} #31#return; {3690#true} is VALID [2018-11-23 13:07:16,177 INFO L256 TraceCheckUtils]: 3: Hoare triple {3690#true} call #t~ret0 := main(); {3690#true} is VALID [2018-11-23 13:07:16,177 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:07:16,178 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:07:16,179 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:07:16,180 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:07:16,180 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:07:16,181 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:07:16,181 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:07:16,182 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:07:16,183 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:07:16,184 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:07:16,185 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:07:16,186 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:07:16,187 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:07:16,188 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:07:16,189 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:07:16,190 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:07:16,191 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:07:16,192 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:07:16,193 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:07:16,194 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:07:16,194 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:07:16,195 INFO L256 TraceCheckUtils]: 25: Hoare triple {3691#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3691#false} is VALID [2018-11-23 13:07:16,195 INFO L273 TraceCheckUtils]: 26: Hoare triple {3691#false} ~cond := #in~cond; {3691#false} is VALID [2018-11-23 13:07:16,195 INFO L273 TraceCheckUtils]: 27: Hoare triple {3691#false} assume 0 == ~cond; {3691#false} is VALID [2018-11-23 13:07:16,195 INFO L273 TraceCheckUtils]: 28: Hoare triple {3691#false} assume !false; {3691#false} is VALID [2018-11-23 13:07:16,197 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:07:16,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:16,197 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:07:16,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:16,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:16,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {3690#true} call ULTIMATE.init(); {3690#true} is VALID [2018-11-23 13:07:16,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {3690#true} assume true; {3690#true} is VALID [2018-11-23 13:07:16,364 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3690#true} {3690#true} #31#return; {3690#true} is VALID [2018-11-23 13:07:16,364 INFO L256 TraceCheckUtils]: 3: Hoare triple {3690#true} call #t~ret0 := main(); {3690#true} is VALID [2018-11-23 13:07:16,365 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:07:16,365 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:07:16,366 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:07:16,367 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:07:16,367 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:07:16,368 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:07:16,369 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:07:16,370 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:07:16,371 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:07:16,372 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:07:16,373 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:07:16,374 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:07:16,375 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:07:16,376 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:07:16,377 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:07:16,378 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:07:16,379 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:07:16,380 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:07:16,381 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:07:16,382 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:07:16,382 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:07:16,383 INFO L256 TraceCheckUtils]: 25: Hoare triple {3691#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3691#false} is VALID [2018-11-23 13:07:16,383 INFO L273 TraceCheckUtils]: 26: Hoare triple {3691#false} ~cond := #in~cond; {3691#false} is VALID [2018-11-23 13:07:16,383 INFO L273 TraceCheckUtils]: 27: Hoare triple {3691#false} assume 0 == ~cond; {3691#false} is VALID [2018-11-23 13:07:16,383 INFO L273 TraceCheckUtils]: 28: Hoare triple {3691#false} assume !false; {3691#false} is VALID [2018-11-23 13:07:16,385 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:07:16,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:16,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 13:07:16,405 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-11-23 13:07:16,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:16,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:07:16,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:16,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:07:16,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:07:16,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:07:16,433 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2018-11-23 13:07:17,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:17,969 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:07:17,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:07:17,969 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-11-23 13:07:17,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:07:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2018-11-23 13:07:17,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:07:17,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2018-11-23 13:07:17,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2018-11-23 13:07:18,001 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:07:18,002 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:07:18,002 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:07:18,003 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:07:18,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:07:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 13:07:18,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:18,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 13:07:18,044 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 13:07:18,045 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 13:07:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:18,046 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:07:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:07:18,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:18,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:18,046 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 13:07:18,046 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 13:07:18,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:18,047 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 13:07:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:07:18,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:18,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:18,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:18,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:07:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-23 13:07:18,049 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-11-23 13:07:18,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:18,049 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-23 13:07:18,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:07:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 13:07:18,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:07:18,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:18,050 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:18,051 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:18,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:18,051 INFO L82 PathProgramCache]: Analyzing trace with hash 365416190, now seen corresponding path program 20 times [2018-11-23 13:07:18,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:18,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:18,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:18,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:07:18,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:19,068 INFO L256 TraceCheckUtils]: 0: Hoare triple {3984#true} call ULTIMATE.init(); {3984#true} is VALID [2018-11-23 13:07:19,068 INFO L273 TraceCheckUtils]: 1: Hoare triple {3984#true} assume true; {3984#true} is VALID [2018-11-23 13:07:19,068 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3984#true} {3984#true} #31#return; {3984#true} is VALID [2018-11-23 13:07:19,068 INFO L256 TraceCheckUtils]: 3: Hoare triple {3984#true} call #t~ret0 := main(); {3984#true} is VALID [2018-11-23 13:07:19,069 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:07:19,070 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:07:19,070 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:07:19,090 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:07:19,110 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:07:19,123 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:07:19,136 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:07:19,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:07:19,166 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:07:19,175 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:07:19,177 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:07:19,177 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:07:19,178 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:07:19,179 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:07:19,179 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:07:19,180 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:07:19,180 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:07:19,181 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:07:19,182 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:07:19,183 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:07:19,184 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:07:19,185 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:07:19,185 INFO L256 TraceCheckUtils]: 26: Hoare triple {3985#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3985#false} is VALID [2018-11-23 13:07:19,186 INFO L273 TraceCheckUtils]: 27: Hoare triple {3985#false} ~cond := #in~cond; {3985#false} is VALID [2018-11-23 13:07:19,186 INFO L273 TraceCheckUtils]: 28: Hoare triple {3985#false} assume 0 == ~cond; {3985#false} is VALID [2018-11-23 13:07:19,186 INFO L273 TraceCheckUtils]: 29: Hoare triple {3985#false} assume !false; {3985#false} is VALID [2018-11-23 13:07:19,188 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:07:19,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:19,189 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:07:19,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:07:19,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:07:19,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:07:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:19,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:07:19,386 INFO L256 TraceCheckUtils]: 0: Hoare triple {3984#true} call ULTIMATE.init(); {3984#true} is VALID [2018-11-23 13:07:19,387 INFO L273 TraceCheckUtils]: 1: Hoare triple {3984#true} assume true; {3984#true} is VALID [2018-11-23 13:07:19,387 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3984#true} {3984#true} #31#return; {3984#true} is VALID [2018-11-23 13:07:19,387 INFO L256 TraceCheckUtils]: 3: Hoare triple {3984#true} call #t~ret0 := main(); {3984#true} is VALID [2018-11-23 13:07:19,388 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:07:19,389 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:07:19,389 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:07:19,390 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:07:19,390 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:07:19,391 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:07:19,391 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:07:19,392 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:07:19,393 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:07:19,394 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:07:19,395 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:07:19,396 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:07:19,397 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:07:19,398 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:07:19,399 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:07:19,400 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:07:19,401 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:07:19,402 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:07:19,403 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:07:19,404 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:07:19,405 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:07:19,405 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:07:19,406 INFO L256 TraceCheckUtils]: 26: Hoare triple {3985#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3985#false} is VALID [2018-11-23 13:07:19,406 INFO L273 TraceCheckUtils]: 27: Hoare triple {3985#false} ~cond := #in~cond; {3985#false} is VALID [2018-11-23 13:07:19,406 INFO L273 TraceCheckUtils]: 28: Hoare triple {3985#false} assume 0 == ~cond; {3985#false} is VALID [2018-11-23 13:07:19,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {3985#false} assume !false; {3985#false} is VALID [2018-11-23 13:07:19,408 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:07:19,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:07:19,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 13:07:19,429 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-11-23 13:07:19,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:07:19,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 13:07:19,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:07:19,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 13:07:19,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 13:07:19,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:07:19,457 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 24 states. [2018-11-23 13:07:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:20,725 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-11-23 13:07:20,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:07:20,725 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-11-23 13:07:20,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:07:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:07:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2018-11-23 13:07:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:07:20,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2018-11-23 13:07:20,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 37 transitions. [2018-11-23 13:07:21,151 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:07:21,152 INFO L225 Difference]: With dead ends: 37 [2018-11-23 13:07:21,152 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:07:21,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:07:21,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:07:21,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 13:07:21,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:07:21,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 13:07:21,223 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 13:07:21,223 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 13:07:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:21,224 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:07:21,224 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:07:21,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:21,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:21,224 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 13:07:21,225 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 13:07:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:07:21,226 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:07:21,226 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:07:21,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:07:21,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:07:21,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:07:21,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:07:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:07:21,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-23 13:07:21,228 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-11-23 13:07:21,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:07:21,228 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-23 13:07:21,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 13:07:21,228 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:07:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 13:07:21,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:07:21,229 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:07:21,229 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:07:21,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:07:21,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 21 times [2018-11-23 13:07:21,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:07:21,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:07:21,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:21,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:07:21,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:07:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:07:22,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {4288#true} call ULTIMATE.init(); {4288#true} is VALID [2018-11-23 13:07:22,125 INFO L273 TraceCheckUtils]: 1: Hoare triple {4288#true} assume true; {4288#true} is VALID [2018-11-23 13:07:22,125 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4288#true} {4288#true} #31#return; {4288#true} is VALID [2018-11-23 13:07:22,125 INFO L256 TraceCheckUtils]: 3: Hoare triple {4288#true} call #t~ret0 := main(); {4288#true} is VALID [2018-11-23 13:07:22,126 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:07:22,126 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:07:22,127 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:07:22,127 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:07:22,128 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:07:22,129 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:07:22,129 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:07:22,130 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:07:22,131 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:07:22,132 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:07:22,133 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:07:22,134 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:07:22,135 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:07:22,136 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:07:22,137 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:07:22,138 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:07:22,139 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:07:22,140 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:07:22,141 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:07:22,142 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:07:22,143 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:07:22,144 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:07:22,145 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:07:22,145 INFO L256 TraceCheckUtils]: 27: Hoare triple {4289#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4289#false} is VALID [2018-11-23 13:07:22,146 INFO L273 TraceCheckUtils]: 28: Hoare triple {4289#false} ~cond := #in~cond; {4289#false} is VALID [2018-11-23 13:07:22,146 INFO L273 TraceCheckUtils]: 29: Hoare triple {4289#false} assume 0 == ~cond; {4289#false} is VALID [2018-11-23 13:07:22,146 INFO L273 TraceCheckUtils]: 30: Hoare triple {4289#false} assume !false; {4289#false} is VALID [2018-11-23 13:07:22,148 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:07:22,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:07:22,148 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:07:22,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:08:13,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 13:08:13,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:13,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:13,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {4288#true} call ULTIMATE.init(); {4288#true} is VALID [2018-11-23 13:08:13,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {4288#true} assume true; {4288#true} is VALID [2018-11-23 13:08:13,830 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4288#true} {4288#true} #31#return; {4288#true} is VALID [2018-11-23 13:08:13,831 INFO L256 TraceCheckUtils]: 3: Hoare triple {4288#true} call #t~ret0 := main(); {4288#true} is VALID [2018-11-23 13:08:13,831 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:08:13,832 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:08:13,832 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:08:13,833 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:08:13,833 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:08:13,834 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:08:13,835 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:08:13,836 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:08:13,837 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:08:13,838 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:08:13,839 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:08:13,840 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:08:13,841 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:08:13,842 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:08:13,843 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:08:13,844 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:08:13,845 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:08:13,846 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:08:13,847 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:08:13,848 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:08:13,849 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:08:13,850 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:08:13,850 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:08:13,851 INFO L256 TraceCheckUtils]: 27: Hoare triple {4289#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4289#false} is VALID [2018-11-23 13:08:13,851 INFO L273 TraceCheckUtils]: 28: Hoare triple {4289#false} ~cond := #in~cond; {4289#false} is VALID [2018-11-23 13:08:13,851 INFO L273 TraceCheckUtils]: 29: Hoare triple {4289#false} assume 0 == ~cond; {4289#false} is VALID [2018-11-23 13:08:13,851 INFO L273 TraceCheckUtils]: 30: Hoare triple {4289#false} assume !false; {4289#false} is VALID [2018-11-23 13:08:13,854 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:08:13,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:13,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 13:08:13,876 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-11-23 13:08:13,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:13,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:08:13,901 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:08:13,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:08:13,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:08:13,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:08:13,903 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2018-11-23 13:08:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:15,722 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:08:15,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 13:08:15,723 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-11-23 13:08:15,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:15,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:08:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2018-11-23 13:08:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:08:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2018-11-23 13:08:15,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 38 transitions. [2018-11-23 13:08:16,120 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:08:16,120 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:08:16,120 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:08:16,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:08:16,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:08:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 13:08:16,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:16,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 13:08:16,155 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 13:08:16,155 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 13:08:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:16,157 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 13:08:16,157 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:08:16,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:16,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:16,157 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 13:08:16,157 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 13:08:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:16,158 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 13:08:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:08:16,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:16,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:16,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:16,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:08:16,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 13:08:16,160 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-11-23 13:08:16,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:16,161 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 13:08:16,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:08:16,161 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 13:08:16,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:08:16,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:16,161 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:16,162 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:16,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:16,162 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 22 times [2018-11-23 13:08:16,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:16,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:16,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:16,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:16,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:17,945 INFO L256 TraceCheckUtils]: 0: Hoare triple {4602#true} call ULTIMATE.init(); {4602#true} is VALID [2018-11-23 13:08:17,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {4602#true} assume true; {4602#true} is VALID [2018-11-23 13:08:17,946 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4602#true} {4602#true} #31#return; {4602#true} is VALID [2018-11-23 13:08:17,946 INFO L256 TraceCheckUtils]: 3: Hoare triple {4602#true} call #t~ret0 := main(); {4602#true} is VALID [2018-11-23 13:08:17,947 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:08:17,948 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:08:17,948 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:08:17,949 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:08:17,949 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:08:17,950 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:08:17,951 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:08:17,952 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:08:17,953 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:08:17,954 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:08:17,955 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:08:17,955 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:08:17,956 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:08:17,956 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:08:17,957 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:08:17,958 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:08:17,959 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:08:17,960 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:08:17,961 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:08:17,962 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:08:17,963 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:08:17,964 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:08:17,965 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:08:17,966 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:08:17,966 INFO L256 TraceCheckUtils]: 28: Hoare triple {4603#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4603#false} is VALID [2018-11-23 13:08:17,966 INFO L273 TraceCheckUtils]: 29: Hoare triple {4603#false} ~cond := #in~cond; {4603#false} is VALID [2018-11-23 13:08:17,966 INFO L273 TraceCheckUtils]: 30: Hoare triple {4603#false} assume 0 == ~cond; {4603#false} is VALID [2018-11-23 13:08:17,966 INFO L273 TraceCheckUtils]: 31: Hoare triple {4603#false} assume !false; {4603#false} is VALID [2018-11-23 13:08:17,969 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:08:17,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:17,969 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:08:17,983 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:08:18,000 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:08:18,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:18,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:18,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {4602#true} call ULTIMATE.init(); {4602#true} is VALID [2018-11-23 13:08:18,210 INFO L273 TraceCheckUtils]: 1: Hoare triple {4602#true} assume true; {4602#true} is VALID [2018-11-23 13:08:18,210 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4602#true} {4602#true} #31#return; {4602#true} is VALID [2018-11-23 13:08:18,210 INFO L256 TraceCheckUtils]: 3: Hoare triple {4602#true} call #t~ret0 := main(); {4602#true} is VALID [2018-11-23 13:08:18,211 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:08:18,211 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:08:18,212 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:08:18,212 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:08:18,213 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:08:18,213 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:08:18,214 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:08:18,215 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:08:18,216 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:08:18,217 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:08:18,218 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:08:18,219 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:08:18,220 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:08:18,221 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:08:18,222 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:08:18,223 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:08:18,224 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:08:18,225 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:08:18,226 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:08:18,227 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:08:18,228 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:08:18,229 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:08:18,230 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:08:18,231 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:08:18,231 INFO L256 TraceCheckUtils]: 28: Hoare triple {4603#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4603#false} is VALID [2018-11-23 13:08:18,231 INFO L273 TraceCheckUtils]: 29: Hoare triple {4603#false} ~cond := #in~cond; {4603#false} is VALID [2018-11-23 13:08:18,231 INFO L273 TraceCheckUtils]: 30: Hoare triple {4603#false} assume 0 == ~cond; {4603#false} is VALID [2018-11-23 13:08:18,231 INFO L273 TraceCheckUtils]: 31: Hoare triple {4603#false} assume !false; {4603#false} is VALID [2018-11-23 13:08:18,234 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:08:18,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:18,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 13:08:18,253 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2018-11-23 13:08:18,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:18,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 13:08:18,484 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:18,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 13:08:18,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 13:08:18,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:08:18,485 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 26 states. [2018-11-23 13:08:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:21,756 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-11-23 13:08:21,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 13:08:21,756 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2018-11-23 13:08:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:08:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2018-11-23 13:08:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:08:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2018-11-23 13:08:21,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 39 transitions. [2018-11-23 13:08:22,193 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:08:22,193 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:08:22,193 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:08:22,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:08:22,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:08:22,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 13:08:22,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:22,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 13:08:22,234 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 13:08:22,235 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 13:08:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:22,236 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:08:22,237 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:08:22,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:22,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:22,237 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 13:08:22,237 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 13:08:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:22,238 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:08:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:08:22,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:22,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:22,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:22,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:08:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-23 13:08:22,240 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-11-23 13:08:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:22,241 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-23 13:08:22,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 13:08:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:08:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:08:22,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:22,242 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:22,242 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:22,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:22,242 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 23 times [2018-11-23 13:08:22,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:22,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:22,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:22,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:22,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:24,157 INFO L256 TraceCheckUtils]: 0: Hoare triple {4926#true} call ULTIMATE.init(); {4926#true} is VALID [2018-11-23 13:08:24,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {4926#true} assume true; {4926#true} is VALID [2018-11-23 13:08:24,157 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4926#true} {4926#true} #31#return; {4926#true} is VALID [2018-11-23 13:08:24,158 INFO L256 TraceCheckUtils]: 3: Hoare triple {4926#true} call #t~ret0 := main(); {4926#true} is VALID [2018-11-23 13:08:24,158 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:08:24,159 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:08:24,160 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:08:24,160 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:08:24,161 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:08:24,161 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:08:24,162 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:08:24,163 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:08:24,164 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:08:24,165 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:08:24,166 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:08:24,167 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:08:24,168 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:08:24,169 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:08:24,170 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:08:24,171 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:08:24,172 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:08:24,173 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:08:24,174 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:08:24,175 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:08:24,176 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:08:24,177 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:08:24,178 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:08:24,179 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:08:24,180 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:08:24,180 INFO L256 TraceCheckUtils]: 29: Hoare triple {4927#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4927#false} is VALID [2018-11-23 13:08:24,180 INFO L273 TraceCheckUtils]: 30: Hoare triple {4927#false} ~cond := #in~cond; {4927#false} is VALID [2018-11-23 13:08:24,180 INFO L273 TraceCheckUtils]: 31: Hoare triple {4927#false} assume 0 == ~cond; {4927#false} is VALID [2018-11-23 13:08:24,180 INFO L273 TraceCheckUtils]: 32: Hoare triple {4927#false} assume !false; {4927#false} is VALID [2018-11-23 13:08:24,183 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:08:24,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:24,183 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:08:24,193 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1