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/overflow_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:08:05,764 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:08:05,766 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:08:05,778 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:08:05,778 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:08:05,779 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:08:05,784 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:08:05,786 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:08:05,789 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:08:05,789 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:08:05,796 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:08:05,796 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:08:05,800 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:08:05,801 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:08:05,802 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:08:05,803 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:08:05,804 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:08:05,809 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:08:05,811 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:08:05,814 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:08:05,815 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:08:05,820 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:08:05,822 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:08:05,822 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:08:05,823 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:08:05,823 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:08:05,824 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:08:05,825 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:08:05,826 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:08:05,828 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:08:05,828 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:08:05,829 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:08:05,829 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:08:05,829 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:08:05,830 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:08:05,831 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:08:05,831 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:08:05,845 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:08:05,846 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:08:05,846 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:08:05,847 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:08:05,847 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:08:05,847 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:08:05,848 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:08:05,848 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:08:05,848 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:08:05,848 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:08:05,848 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:08:05,849 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:08:05,849 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:08:05,849 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:08:05,849 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:08:05,849 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:08:05,850 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:08:05,850 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:08:05,850 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:08:05,850 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:08:05,850 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:08:05,851 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:08:05,851 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:08:05,851 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:08:05,851 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:08:05,851 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:08:05,852 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:08:05,852 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:08:05,852 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:08:05,852 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:08:05,852 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:08:05,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:08:05,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:08:05,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:08:05,952 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:08:05,953 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:08:05,953 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/overflow_true-unreach-call1.i [2018-11-23 13:08:06,013 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73bb3331/fa900e2c95984ad38ff00fc741097c5b/FLAG865457ca0 [2018-11-23 13:08:06,466 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:08:06,466 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/overflow_true-unreach-call1.i [2018-11-23 13:08:06,472 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73bb3331/fa900e2c95984ad38ff00fc741097c5b/FLAG865457ca0 [2018-11-23 13:08:06,836 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a73bb3331/fa900e2c95984ad38ff00fc741097c5b [2018-11-23 13:08:06,848 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:08:06,849 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:08:06,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:08:06,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:08:06,855 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:08:06,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:06" (1/1) ... [2018-11-23 13:08:06,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@680fc3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:06, skipping insertion in model container [2018-11-23 13:08:06,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:06" (1/1) ... [2018-11-23 13:08:06,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:08:06,897 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:08:07,121 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:08:07,130 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:08:07,149 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:08:07,167 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:08:07,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:07 WrapperNode [2018-11-23 13:08:07,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:08:07,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:08:07,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:08:07,169 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:08:07,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:07" (1/1) ... [2018-11-23 13:08:07,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:07" (1/1) ... [2018-11-23 13:08:07,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:08:07,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:08:07,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:08:07,195 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:08:07,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:07" (1/1) ... [2018-11-23 13:08:07,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:07" (1/1) ... [2018-11-23 13:08:07,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:07" (1/1) ... [2018-11-23 13:08:07,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:07" (1/1) ... [2018-11-23 13:08:07,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:07" (1/1) ... [2018-11-23 13:08:07,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:07" (1/1) ... [2018-11-23 13:08:07,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:07" (1/1) ... [2018-11-23 13:08:07,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:08:07,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:08:07,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:08:07,224 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:08:07,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:08:07,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:08:07,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:08:07,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:08:07,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:08:07,370 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:08:07,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:08:07,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:08:07,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:08:07,761 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:08:07,762 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:08:07,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:07 BoogieIcfgContainer [2018-11-23 13:08:07,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:08:07,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:08:07,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:08:07,775 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:08:07,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:08:06" (1/3) ... [2018-11-23 13:08:07,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d98e402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:08:07, skipping insertion in model container [2018-11-23 13:08:07,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:07" (2/3) ... [2018-11-23 13:08:07,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d98e402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:08:07, skipping insertion in model container [2018-11-23 13:08:07,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:07" (3/3) ... [2018-11-23 13:08:07,785 INFO L112 eAbstractionObserver]: Analyzing ICFG overflow_true-unreach-call1.i [2018-11-23 13:08:07,793 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:08:07,801 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:08:07,819 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:08:07,853 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:08:07,854 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:08:07,855 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:08:07,855 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:08:07,855 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:08:07,855 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:08:07,855 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:08:07,856 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:08:07,856 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:08:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 13:08:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:08:07,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:07,882 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:07,884 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:07,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:07,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 13:08:07,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:07,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:07,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:07,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:07,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:08,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 13:08:08,258 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 13:08:08,258 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 13:08:08,259 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret0 := main(); {20#true} is VALID [2018-11-23 13:08:08,268 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~x~0 := 10; {22#(and (<= (div main_~x~0 4294967296) 0) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:08,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#(and (<= (div main_~x~0 4294967296) 0) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {21#false} is VALID [2018-11-23 13:08:08,272 INFO L256 TraceCheckUtils]: 6: Hoare triple {21#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {21#false} is VALID [2018-11-23 13:08:08,273 INFO L273 TraceCheckUtils]: 7: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2018-11-23 13:08:08,273 INFO L273 TraceCheckUtils]: 8: Hoare triple {21#false} assume 0 == ~cond; {21#false} is VALID [2018-11-23 13:08:08,274 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 13:08:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:08,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:08:08,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:08:08,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:08:08,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:08,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:08:08,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:08,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:08:08,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:08:08,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:08:08,336 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-11-23 13:08:08,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:08,555 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 13:08:08,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:08:08,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:08:08,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:08:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 13:08:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:08:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 13:08:08,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 13:08:08,850 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:08,860 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:08:08,861 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:08:08,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:08:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:08:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:08:08,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:08,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:08,921 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:08,921 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:08,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:08,924 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:08:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:08:08,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:08,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:08,925 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:08,926 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:08:08,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:08,928 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:08:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:08:08,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:08,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:08,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:08,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:08:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:08:08,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 13:08:08,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:08,934 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:08:08,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:08:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:08:08,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:08:08,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:08,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:08,935 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:08,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:08,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 13:08:08,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:08,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:08,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:08,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:08,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:09,228 INFO L256 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {108#true} is VALID [2018-11-23 13:08:09,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {108#true} assume true; {108#true} is VALID [2018-11-23 13:08:09,229 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {108#true} {108#true} #31#return; {108#true} is VALID [2018-11-23 13:08:09,229 INFO L256 TraceCheckUtils]: 3: Hoare triple {108#true} call #t~ret0 := main(); {108#true} is VALID [2018-11-23 13:08:09,230 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#true} ~x~0 := 10; {110#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:09,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {111#(and (<= 12 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:08:09,232 INFO L273 TraceCheckUtils]: 6: Hoare triple {111#(and (<= 12 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {109#false} is VALID [2018-11-23 13:08:09,232 INFO L256 TraceCheckUtils]: 7: Hoare triple {109#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {109#false} is VALID [2018-11-23 13:08:09,232 INFO L273 TraceCheckUtils]: 8: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2018-11-23 13:08:09,233 INFO L273 TraceCheckUtils]: 9: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2018-11-23 13:08:09,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {109#false} assume !false; {109#false} is VALID [2018-11-23 13:08:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:09,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:09,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:09,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:09,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:09,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {108#true} call ULTIMATE.init(); {108#true} is VALID [2018-11-23 13:08:09,423 INFO L273 TraceCheckUtils]: 1: Hoare triple {108#true} assume true; {108#true} is VALID [2018-11-23 13:08:09,423 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {108#true} {108#true} #31#return; {108#true} is VALID [2018-11-23 13:08:09,424 INFO L256 TraceCheckUtils]: 3: Hoare triple {108#true} call #t~ret0 := main(); {108#true} is VALID [2018-11-23 13:08:09,426 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#true} ~x~0 := 10; {110#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:09,428 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {130#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:09,431 INFO L273 TraceCheckUtils]: 6: Hoare triple {130#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {109#false} is VALID [2018-11-23 13:08:09,431 INFO L256 TraceCheckUtils]: 7: Hoare triple {109#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {109#false} is VALID [2018-11-23 13:08:09,431 INFO L273 TraceCheckUtils]: 8: Hoare triple {109#false} ~cond := #in~cond; {109#false} is VALID [2018-11-23 13:08:09,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {109#false} assume 0 == ~cond; {109#false} is VALID [2018-11-23 13:08:09,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {109#false} assume !false; {109#false} is VALID [2018-11-23 13:08:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:09,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:09,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:08:09,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:08:09,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:09,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:08:09,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:09,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:08:09,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:08:09,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:08:09,497 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2018-11-23 13:08:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:09,841 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 13:08:09,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:08:09,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:08:09,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:09,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:08:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-23 13:08:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:08:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-23 13:08:09,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2018-11-23 13:08:10,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:10,056 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:08:10,056 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:08:10,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:08:10,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:08:10,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:08:10,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:10,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:10,138 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:10,138 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:10,140 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:08:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:08:10,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:10,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:10,141 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:10,141 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:08:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:10,143 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:08:10,143 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:08:10,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:10,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:10,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:10,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:10,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:08:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:08:10,146 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-23 13:08:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:10,147 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:08:10,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:08:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:08:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:08:10,148 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:10,148 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:10,148 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:10,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:10,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 2 times [2018-11-23 13:08:10,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:10,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:10,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:10,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:10,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:10,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {228#true} is VALID [2018-11-23 13:08:10,400 INFO L273 TraceCheckUtils]: 1: Hoare triple {228#true} assume true; {228#true} is VALID [2018-11-23 13:08:10,400 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} #31#return; {228#true} is VALID [2018-11-23 13:08:10,401 INFO L256 TraceCheckUtils]: 3: Hoare triple {228#true} call #t~ret0 := main(); {228#true} is VALID [2018-11-23 13:08:10,409 INFO L273 TraceCheckUtils]: 4: Hoare triple {228#true} ~x~0 := 10; {230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:10,410 INFO L273 TraceCheckUtils]: 5: Hoare triple {230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {231#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:10,411 INFO L273 TraceCheckUtils]: 6: Hoare triple {231#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {232#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:10,413 INFO L273 TraceCheckUtils]: 7: Hoare triple {232#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {233#(and (<= 16 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:08:10,415 INFO L273 TraceCheckUtils]: 8: Hoare triple {233#(and (<= 16 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {229#false} is VALID [2018-11-23 13:08:10,416 INFO L256 TraceCheckUtils]: 9: Hoare triple {229#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {229#false} is VALID [2018-11-23 13:08:10,416 INFO L273 TraceCheckUtils]: 10: Hoare triple {229#false} ~cond := #in~cond; {229#false} is VALID [2018-11-23 13:08:10,417 INFO L273 TraceCheckUtils]: 11: Hoare triple {229#false} assume 0 == ~cond; {229#false} is VALID [2018-11-23 13:08:10,417 INFO L273 TraceCheckUtils]: 12: Hoare triple {229#false} assume !false; {229#false} is VALID [2018-11-23 13:08:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:10,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:10,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:10,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:08:10,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:08:10,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:10,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:10,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {228#true} is VALID [2018-11-23 13:08:10,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {228#true} assume true; {228#true} is VALID [2018-11-23 13:08:10,606 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} #31#return; {228#true} is VALID [2018-11-23 13:08:10,606 INFO L256 TraceCheckUtils]: 3: Hoare triple {228#true} call #t~ret0 := main(); {228#true} is VALID [2018-11-23 13:08:10,607 INFO L273 TraceCheckUtils]: 4: Hoare triple {228#true} ~x~0 := 10; {230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:10,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {231#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:10,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {231#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {232#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:10,615 INFO L273 TraceCheckUtils]: 7: Hoare triple {232#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {258#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:10,618 INFO L273 TraceCheckUtils]: 8: Hoare triple {258#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {229#false} is VALID [2018-11-23 13:08:10,618 INFO L256 TraceCheckUtils]: 9: Hoare triple {229#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {229#false} is VALID [2018-11-23 13:08:10,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {229#false} ~cond := #in~cond; {229#false} is VALID [2018-11-23 13:08:10,619 INFO L273 TraceCheckUtils]: 11: Hoare triple {229#false} assume 0 == ~cond; {229#false} is VALID [2018-11-23 13:08:10,619 INFO L273 TraceCheckUtils]: 12: Hoare triple {229#false} assume !false; {229#false} is VALID [2018-11-23 13:08:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:10,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:10,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 13:08:10,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 13:08:10,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:10,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:08:10,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:10,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:08:10,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:08:10,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:08:10,662 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2018-11-23 13:08:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:10,904 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 13:08:10,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:08:10,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-11-23 13:08:10,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:08:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-23 13:08:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:08:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-23 13:08:10,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 22 transitions. [2018-11-23 13:08:10,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:10,966 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:08:10,966 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:08:10,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:08:10,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:08:10,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 13:08:10,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:10,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-23 13:08:10,994 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:08:10,994 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:08:10,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:10,997 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:08:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:08:10,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:10,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:10,998 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-23 13:08:10,998 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-23 13:08:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:11,000 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 13:08:11,000 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:08:11,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:11,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:11,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:11,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:08:11,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 13:08:11,003 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-11-23 13:08:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:11,004 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 13:08:11,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:08:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 13:08:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:08:11,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:11,005 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:11,005 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:11,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:11,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 3 times [2018-11-23 13:08:11,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:11,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:11,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:11,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:11,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:11,521 INFO L256 TraceCheckUtils]: 0: Hoare triple {368#true} call ULTIMATE.init(); {368#true} is VALID [2018-11-23 13:08:11,522 INFO L273 TraceCheckUtils]: 1: Hoare triple {368#true} assume true; {368#true} is VALID [2018-11-23 13:08:11,522 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {368#true} {368#true} #31#return; {368#true} is VALID [2018-11-23 13:08:11,522 INFO L256 TraceCheckUtils]: 3: Hoare triple {368#true} call #t~ret0 := main(); {368#true} is VALID [2018-11-23 13:08:11,530 INFO L273 TraceCheckUtils]: 4: Hoare triple {368#true} ~x~0 := 10; {370#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:11,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {370#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {371#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:11,536 INFO L273 TraceCheckUtils]: 6: Hoare triple {371#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {372#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:11,537 INFO L273 TraceCheckUtils]: 7: Hoare triple {372#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {373#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:11,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {373#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {374#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:11,539 INFO L273 TraceCheckUtils]: 9: Hoare triple {374#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {375#(and (<= 20 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:08:11,539 INFO L273 TraceCheckUtils]: 10: Hoare triple {375#(and (<= 20 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {369#false} is VALID [2018-11-23 13:08:11,540 INFO L256 TraceCheckUtils]: 11: Hoare triple {369#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {369#false} is VALID [2018-11-23 13:08:11,540 INFO L273 TraceCheckUtils]: 12: Hoare triple {369#false} ~cond := #in~cond; {369#false} is VALID [2018-11-23 13:08:11,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {369#false} assume 0 == ~cond; {369#false} is VALID [2018-11-23 13:08:11,541 INFO L273 TraceCheckUtils]: 14: Hoare triple {369#false} assume !false; {369#false} is VALID [2018-11-23 13:08:11,542 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:11,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:11,543 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:11,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:08:11,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:08:11,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:11,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:11,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {368#true} call ULTIMATE.init(); {368#true} is VALID [2018-11-23 13:08:11,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {368#true} assume true; {368#true} is VALID [2018-11-23 13:08:11,713 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {368#true} {368#true} #31#return; {368#true} is VALID [2018-11-23 13:08:11,713 INFO L256 TraceCheckUtils]: 3: Hoare triple {368#true} call #t~ret0 := main(); {368#true} is VALID [2018-11-23 13:08:11,714 INFO L273 TraceCheckUtils]: 4: Hoare triple {368#true} ~x~0 := 10; {370#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:11,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {370#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {371#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:11,716 INFO L273 TraceCheckUtils]: 6: Hoare triple {371#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {372#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:11,716 INFO L273 TraceCheckUtils]: 7: Hoare triple {372#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {373#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:11,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {373#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {374#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:11,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {374#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {406#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:11,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {406#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 >= 10); {369#false} is VALID [2018-11-23 13:08:11,721 INFO L256 TraceCheckUtils]: 11: Hoare triple {369#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {369#false} is VALID [2018-11-23 13:08:11,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {369#false} ~cond := #in~cond; {369#false} is VALID [2018-11-23 13:08:11,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {369#false} assume 0 == ~cond; {369#false} is VALID [2018-11-23 13:08:11,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {369#false} assume !false; {369#false} is VALID [2018-11-23 13:08:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:11,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:11,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:08:11,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-11-23 13:08:11,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:11,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:08:11,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:11,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:08:11,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:08:11,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:08:11,765 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2018-11-23 13:08:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:12,050 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 13:08:12,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:08:12,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-11-23 13:08:12,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:08:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-11-23 13:08:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:08:12,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-11-23 13:08:12,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 24 transitions. [2018-11-23 13:08:12,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:12,097 INFO L225 Difference]: With dead ends: 23 [2018-11-23 13:08:12,097 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:08:12,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:08:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:08:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:08:12,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:12,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 13:08:12,132 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:08:12,132 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:08:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:12,135 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:08:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:08:12,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:12,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:12,136 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:08:12,136 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:08:12,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:12,138 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:08:12,138 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:08:12,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:12,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:12,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:12,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:12,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:08:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 13:08:12,141 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-11-23 13:08:12,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:12,141 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 13:08:12,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:08:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:08:12,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:08:12,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:12,142 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:12,143 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:12,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:12,143 INFO L82 PathProgramCache]: Analyzing trace with hash -6162383, now seen corresponding path program 4 times [2018-11-23 13:08:12,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:12,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:12,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:12,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:12,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:12,629 INFO L256 TraceCheckUtils]: 0: Hoare triple {528#true} call ULTIMATE.init(); {528#true} is VALID [2018-11-23 13:08:12,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {528#true} assume true; {528#true} is VALID [2018-11-23 13:08:12,630 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {528#true} {528#true} #31#return; {528#true} is VALID [2018-11-23 13:08:12,631 INFO L256 TraceCheckUtils]: 3: Hoare triple {528#true} call #t~ret0 := main(); {528#true} is VALID [2018-11-23 13:08:12,631 INFO L273 TraceCheckUtils]: 4: Hoare triple {528#true} ~x~0 := 10; {530#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:12,632 INFO L273 TraceCheckUtils]: 5: Hoare triple {530#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {531#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:12,633 INFO L273 TraceCheckUtils]: 6: Hoare triple {531#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {532#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:12,634 INFO L273 TraceCheckUtils]: 7: Hoare triple {532#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {533#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:12,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {533#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {534#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:12,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {534#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {535#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:12,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {535#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {536#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:12,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {536#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {537#(and (<= (div main_~x~0 4294967296) 0) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:12,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {537#(and (<= (div main_~x~0 4294967296) 0) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {529#false} is VALID [2018-11-23 13:08:12,640 INFO L256 TraceCheckUtils]: 13: Hoare triple {529#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {529#false} is VALID [2018-11-23 13:08:12,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {529#false} ~cond := #in~cond; {529#false} is VALID [2018-11-23 13:08:12,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {529#false} assume 0 == ~cond; {529#false} is VALID [2018-11-23 13:08:12,641 INFO L273 TraceCheckUtils]: 16: Hoare triple {529#false} assume !false; {529#false} is VALID [2018-11-23 13:08:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:12,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:12,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:12,655 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:08:12,683 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:08:12,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:12,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:13,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {528#true} call ULTIMATE.init(); {528#true} is VALID [2018-11-23 13:08:13,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {528#true} assume true; {528#true} is VALID [2018-11-23 13:08:13,137 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {528#true} {528#true} #31#return; {528#true} is VALID [2018-11-23 13:08:13,137 INFO L256 TraceCheckUtils]: 3: Hoare triple {528#true} call #t~ret0 := main(); {528#true} is VALID [2018-11-23 13:08:13,138 INFO L273 TraceCheckUtils]: 4: Hoare triple {528#true} ~x~0 := 10; {530#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:13,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {530#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {531#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:13,141 INFO L273 TraceCheckUtils]: 6: Hoare triple {531#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {532#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:13,142 INFO L273 TraceCheckUtils]: 7: Hoare triple {532#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {533#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:13,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {533#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {534#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:13,144 INFO L273 TraceCheckUtils]: 9: Hoare triple {534#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {535#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:13,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {535#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {536#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:13,147 INFO L273 TraceCheckUtils]: 11: Hoare triple {536#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {574#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:13,148 INFO L273 TraceCheckUtils]: 12: Hoare triple {574#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {529#false} is VALID [2018-11-23 13:08:13,148 INFO L256 TraceCheckUtils]: 13: Hoare triple {529#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {529#false} is VALID [2018-11-23 13:08:13,149 INFO L273 TraceCheckUtils]: 14: Hoare triple {529#false} ~cond := #in~cond; {529#false} is VALID [2018-11-23 13:08:13,149 INFO L273 TraceCheckUtils]: 15: Hoare triple {529#false} assume 0 == ~cond; {529#false} is VALID [2018-11-23 13:08:13,150 INFO L273 TraceCheckUtils]: 16: Hoare triple {529#false} assume !false; {529#false} is VALID [2018-11-23 13:08:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:13,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:13,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 13:08:13,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-23 13:08:13,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:13,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:08:13,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:13,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:08:13,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:08:13,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:08:13,210 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 11 states. [2018-11-23 13:08:13,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:13,662 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 13:08:13,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:08:13,662 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-23 13:08:13,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:08:13,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2018-11-23 13:08:13,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:08:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 26 transitions. [2018-11-23 13:08:13,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 26 transitions. [2018-11-23 13:08:13,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:13,698 INFO L225 Difference]: With dead ends: 25 [2018-11-23 13:08:13,698 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:08:13,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:08:13,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:08:13,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:08:13,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:13,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 13:08:13,725 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:08:13,725 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:08:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:13,727 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:08:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:08:13,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:13,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:13,728 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:08:13,729 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:08:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:13,731 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-23 13:08:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:08:13,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:13,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:13,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:13,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:08:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-23 13:08:13,733 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-11-23 13:08:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:13,734 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-23 13:08:13,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:08:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-23 13:08:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:08:13,735 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:13,735 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:13,735 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:13,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:13,736 INFO L82 PathProgramCache]: Analyzing trace with hash -460322351, now seen corresponding path program 5 times [2018-11-23 13:08:13,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:13,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:13,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:13,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:13,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:14,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {708#true} call ULTIMATE.init(); {708#true} is VALID [2018-11-23 13:08:14,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {708#true} assume true; {708#true} is VALID [2018-11-23 13:08:14,672 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {708#true} {708#true} #31#return; {708#true} is VALID [2018-11-23 13:08:14,672 INFO L256 TraceCheckUtils]: 3: Hoare triple {708#true} call #t~ret0 := main(); {708#true} is VALID [2018-11-23 13:08:14,674 INFO L273 TraceCheckUtils]: 4: Hoare triple {708#true} ~x~0 := 10; {710#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:14,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {710#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {711#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:14,677 INFO L273 TraceCheckUtils]: 6: Hoare triple {711#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {712#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:14,679 INFO L273 TraceCheckUtils]: 7: Hoare triple {712#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {713#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:14,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {713#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {714#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:14,680 INFO L273 TraceCheckUtils]: 9: Hoare triple {714#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {715#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:14,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {715#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {716#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:14,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {716#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {717#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:14,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {717#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {718#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:14,685 INFO L273 TraceCheckUtils]: 13: Hoare triple {718#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {719#(and (<= 28 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:08:14,686 INFO L273 TraceCheckUtils]: 14: Hoare triple {719#(and (<= 28 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {709#false} is VALID [2018-11-23 13:08:14,686 INFO L256 TraceCheckUtils]: 15: Hoare triple {709#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {709#false} is VALID [2018-11-23 13:08:14,686 INFO L273 TraceCheckUtils]: 16: Hoare triple {709#false} ~cond := #in~cond; {709#false} is VALID [2018-11-23 13:08:14,687 INFO L273 TraceCheckUtils]: 17: Hoare triple {709#false} assume 0 == ~cond; {709#false} is VALID [2018-11-23 13:08:14,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {709#false} assume !false; {709#false} is VALID [2018-11-23 13:08:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:14,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:14,690 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:14,706 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:08:14,881 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:08:14,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:14,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:15,053 INFO L256 TraceCheckUtils]: 0: Hoare triple {708#true} call ULTIMATE.init(); {708#true} is VALID [2018-11-23 13:08:15,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {708#true} assume true; {708#true} is VALID [2018-11-23 13:08:15,054 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {708#true} {708#true} #31#return; {708#true} is VALID [2018-11-23 13:08:15,054 INFO L256 TraceCheckUtils]: 3: Hoare triple {708#true} call #t~ret0 := main(); {708#true} is VALID [2018-11-23 13:08:15,055 INFO L273 TraceCheckUtils]: 4: Hoare triple {708#true} ~x~0 := 10; {710#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:15,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {710#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {711#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:15,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {711#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {712#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:15,057 INFO L273 TraceCheckUtils]: 7: Hoare triple {712#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {713#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:15,058 INFO L273 TraceCheckUtils]: 8: Hoare triple {713#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {714#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:15,059 INFO L273 TraceCheckUtils]: 9: Hoare triple {714#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {715#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:15,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {715#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {716#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:15,061 INFO L273 TraceCheckUtils]: 11: Hoare triple {716#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {717#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:15,062 INFO L273 TraceCheckUtils]: 12: Hoare triple {717#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {718#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:15,063 INFO L273 TraceCheckUtils]: 13: Hoare triple {718#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {762#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:15,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {762#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {709#false} is VALID [2018-11-23 13:08:15,065 INFO L256 TraceCheckUtils]: 15: Hoare triple {709#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {709#false} is VALID [2018-11-23 13:08:15,065 INFO L273 TraceCheckUtils]: 16: Hoare triple {709#false} ~cond := #in~cond; {709#false} is VALID [2018-11-23 13:08:15,066 INFO L273 TraceCheckUtils]: 17: Hoare triple {709#false} assume 0 == ~cond; {709#false} is VALID [2018-11-23 13:08:15,066 INFO L273 TraceCheckUtils]: 18: Hoare triple {709#false} assume !false; {709#false} is VALID [2018-11-23 13:08:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:15,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:15,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 13:08:15,091 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-11-23 13:08:15,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:15,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:08:15,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:15,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:08:15,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:08:15,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:08:15,135 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 13 states. [2018-11-23 13:08:15,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:15,680 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 13:08:15,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:08:15,681 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-11-23 13:08:15,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:08:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2018-11-23 13:08:15,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:08:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 28 transitions. [2018-11-23 13:08:15,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 28 transitions. [2018-11-23 13:08:15,722 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:08:15,724 INFO L225 Difference]: With dead ends: 27 [2018-11-23 13:08:15,724 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 13:08:15,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:08:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 13:08:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 13:08:15,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:15,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 13:08:15,773 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:08:15,773 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:08:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:15,775 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:08:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:08:15,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:15,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:15,776 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 13:08:15,776 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 13:08:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:15,778 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-23 13:08:15,778 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:08:15,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:15,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:15,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:15,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:08:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-23 13:08:15,781 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-23 13:08:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:15,781 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-23 13:08:15,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:08:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-23 13:08:15,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:08:15,782 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:15,783 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:15,783 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:15,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:15,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1178612593, now seen corresponding path program 6 times [2018-11-23 13:08:15,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:15,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:15,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:15,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:15,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:16,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {908#true} call ULTIMATE.init(); {908#true} is VALID [2018-11-23 13:08:16,232 INFO L273 TraceCheckUtils]: 1: Hoare triple {908#true} assume true; {908#true} is VALID [2018-11-23 13:08:16,232 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {908#true} {908#true} #31#return; {908#true} is VALID [2018-11-23 13:08:16,232 INFO L256 TraceCheckUtils]: 3: Hoare triple {908#true} call #t~ret0 := main(); {908#true} is VALID [2018-11-23 13:08:16,233 INFO L273 TraceCheckUtils]: 4: Hoare triple {908#true} ~x~0 := 10; {910#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:16,234 INFO L273 TraceCheckUtils]: 5: Hoare triple {910#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {911#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:16,235 INFO L273 TraceCheckUtils]: 6: Hoare triple {911#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {912#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:16,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {912#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {913#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:16,238 INFO L273 TraceCheckUtils]: 8: Hoare triple {913#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {914#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:16,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {914#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {915#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:16,240 INFO L273 TraceCheckUtils]: 10: Hoare triple {915#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {916#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:16,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {916#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {917#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:16,243 INFO L273 TraceCheckUtils]: 12: Hoare triple {917#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {918#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:16,244 INFO L273 TraceCheckUtils]: 13: Hoare triple {918#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {919#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:16,245 INFO L273 TraceCheckUtils]: 14: Hoare triple {919#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {920#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:16,246 INFO L273 TraceCheckUtils]: 15: Hoare triple {920#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {921#(and (<= (div main_~x~0 4294967296) 0) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:16,248 INFO L273 TraceCheckUtils]: 16: Hoare triple {921#(and (<= (div main_~x~0 4294967296) 0) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {909#false} is VALID [2018-11-23 13:08:16,248 INFO L256 TraceCheckUtils]: 17: Hoare triple {909#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {909#false} is VALID [2018-11-23 13:08:16,248 INFO L273 TraceCheckUtils]: 18: Hoare triple {909#false} ~cond := #in~cond; {909#false} is VALID [2018-11-23 13:08:16,249 INFO L273 TraceCheckUtils]: 19: Hoare triple {909#false} assume 0 == ~cond; {909#false} is VALID [2018-11-23 13:08:16,249 INFO L273 TraceCheckUtils]: 20: Hoare triple {909#false} assume !false; {909#false} is VALID [2018-11-23 13:08:16,251 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:16,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:16,252 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:16,261 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:08:16,335 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:08:16,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:16,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:16,488 INFO L256 TraceCheckUtils]: 0: Hoare triple {908#true} call ULTIMATE.init(); {908#true} is VALID [2018-11-23 13:08:16,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {908#true} assume true; {908#true} is VALID [2018-11-23 13:08:16,489 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {908#true} {908#true} #31#return; {908#true} is VALID [2018-11-23 13:08:16,489 INFO L256 TraceCheckUtils]: 3: Hoare triple {908#true} call #t~ret0 := main(); {908#true} is VALID [2018-11-23 13:08:16,490 INFO L273 TraceCheckUtils]: 4: Hoare triple {908#true} ~x~0 := 10; {910#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:16,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {910#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {911#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:16,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {911#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {912#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:16,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {912#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {913#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:16,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {913#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {914#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:16,495 INFO L273 TraceCheckUtils]: 9: Hoare triple {914#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {915#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:16,497 INFO L273 TraceCheckUtils]: 10: Hoare triple {915#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {916#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:16,502 INFO L273 TraceCheckUtils]: 11: Hoare triple {916#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {917#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:16,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {917#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {918#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:16,503 INFO L273 TraceCheckUtils]: 13: Hoare triple {918#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {919#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:16,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {919#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {920#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:16,505 INFO L273 TraceCheckUtils]: 15: Hoare triple {920#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {970#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:16,506 INFO L273 TraceCheckUtils]: 16: Hoare triple {970#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {909#false} is VALID [2018-11-23 13:08:16,506 INFO L256 TraceCheckUtils]: 17: Hoare triple {909#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {909#false} is VALID [2018-11-23 13:08:16,507 INFO L273 TraceCheckUtils]: 18: Hoare triple {909#false} ~cond := #in~cond; {909#false} is VALID [2018-11-23 13:08:16,507 INFO L273 TraceCheckUtils]: 19: Hoare triple {909#false} assume 0 == ~cond; {909#false} is VALID [2018-11-23 13:08:16,508 INFO L273 TraceCheckUtils]: 20: Hoare triple {909#false} assume !false; {909#false} is VALID [2018-11-23 13:08:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:16,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:16,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 13:08:16,531 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 13:08:16,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:16,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:08:16,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:16,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:08:16,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:08:16,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:08:16,555 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 15 states. [2018-11-23 13:08:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:17,489 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 13:08:17,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:08:17,489 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-11-23 13:08:17,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:08:17,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 30 transitions. [2018-11-23 13:08:17,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:08:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 30 transitions. [2018-11-23 13:08:17,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 30 transitions. [2018-11-23 13:08:17,521 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:08:17,522 INFO L225 Difference]: With dead ends: 29 [2018-11-23 13:08:17,522 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 13:08:17,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:08:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 13:08:17,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 13:08:17,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:17,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 13:08:17,551 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 13:08:17,551 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 13:08:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:17,553 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:08:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:08:17,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:17,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:17,554 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 13:08:17,554 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 13:08:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:17,555 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:08:17,556 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:08:17,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:17,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:17,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:17,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:08:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-23 13:08:17,558 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-11-23 13:08:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:17,558 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-23 13:08:17,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:08:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 13:08:17,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:08:17,559 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:17,559 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:17,560 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:17,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:17,560 INFO L82 PathProgramCache]: Analyzing trace with hash -57903855, now seen corresponding path program 7 times [2018-11-23 13:08:17,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:17,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:17,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:17,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:17,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:18,602 INFO L256 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1128#true} is VALID [2018-11-23 13:08:18,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {1128#true} assume true; {1128#true} is VALID [2018-11-23 13:08:18,603 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1128#true} {1128#true} #31#return; {1128#true} is VALID [2018-11-23 13:08:18,603 INFO L256 TraceCheckUtils]: 3: Hoare triple {1128#true} call #t~ret0 := main(); {1128#true} is VALID [2018-11-23 13:08:18,609 INFO L273 TraceCheckUtils]: 4: Hoare triple {1128#true} ~x~0 := 10; {1130#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:18,610 INFO L273 TraceCheckUtils]: 5: Hoare triple {1130#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1131#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:18,611 INFO L273 TraceCheckUtils]: 6: Hoare triple {1131#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1132#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:18,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {1132#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1133#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:18,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {1133#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1134#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:18,613 INFO L273 TraceCheckUtils]: 9: Hoare triple {1134#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1135#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:18,614 INFO L273 TraceCheckUtils]: 10: Hoare triple {1135#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1136#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:18,616 INFO L273 TraceCheckUtils]: 11: Hoare triple {1136#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1137#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:18,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {1137#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1138#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:18,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {1138#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1139#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:18,619 INFO L273 TraceCheckUtils]: 14: Hoare triple {1139#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1140#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:18,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {1140#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1141#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:18,621 INFO L273 TraceCheckUtils]: 16: Hoare triple {1141#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1142#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:18,622 INFO L273 TraceCheckUtils]: 17: Hoare triple {1142#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1143#(and (<= (div main_~x~0 4294967296) 0) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:18,624 INFO L273 TraceCheckUtils]: 18: Hoare triple {1143#(and (<= (div main_~x~0 4294967296) 0) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {1129#false} is VALID [2018-11-23 13:08:18,624 INFO L256 TraceCheckUtils]: 19: Hoare triple {1129#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1129#false} is VALID [2018-11-23 13:08:18,624 INFO L273 TraceCheckUtils]: 20: Hoare triple {1129#false} ~cond := #in~cond; {1129#false} is VALID [2018-11-23 13:08:18,625 INFO L273 TraceCheckUtils]: 21: Hoare triple {1129#false} assume 0 == ~cond; {1129#false} is VALID [2018-11-23 13:08:18,625 INFO L273 TraceCheckUtils]: 22: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2018-11-23 13:08:18,626 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:08:18,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:18,626 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:18,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:18,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:18,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {1128#true} call ULTIMATE.init(); {1128#true} is VALID [2018-11-23 13:08:18,826 INFO L273 TraceCheckUtils]: 1: Hoare triple {1128#true} assume true; {1128#true} is VALID [2018-11-23 13:08:18,826 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1128#true} {1128#true} #31#return; {1128#true} is VALID [2018-11-23 13:08:18,827 INFO L256 TraceCheckUtils]: 3: Hoare triple {1128#true} call #t~ret0 := main(); {1128#true} is VALID [2018-11-23 13:08:18,827 INFO L273 TraceCheckUtils]: 4: Hoare triple {1128#true} ~x~0 := 10; {1130#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:18,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {1130#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1131#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:18,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {1131#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1132#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:18,829 INFO L273 TraceCheckUtils]: 7: Hoare triple {1132#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1133#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:18,830 INFO L273 TraceCheckUtils]: 8: Hoare triple {1133#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1134#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:18,830 INFO L273 TraceCheckUtils]: 9: Hoare triple {1134#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1135#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:18,831 INFO L273 TraceCheckUtils]: 10: Hoare triple {1135#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1136#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:18,832 INFO L273 TraceCheckUtils]: 11: Hoare triple {1136#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1137#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:18,833 INFO L273 TraceCheckUtils]: 12: Hoare triple {1137#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1138#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:18,834 INFO L273 TraceCheckUtils]: 13: Hoare triple {1138#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1139#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:18,835 INFO L273 TraceCheckUtils]: 14: Hoare triple {1139#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1140#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:18,836 INFO L273 TraceCheckUtils]: 15: Hoare triple {1140#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1141#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:18,837 INFO L273 TraceCheckUtils]: 16: Hoare triple {1141#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1142#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:18,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {1142#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1198#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:18,839 INFO L273 TraceCheckUtils]: 18: Hoare triple {1198#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {1129#false} is VALID [2018-11-23 13:08:18,839 INFO L256 TraceCheckUtils]: 19: Hoare triple {1129#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1129#false} is VALID [2018-11-23 13:08:18,840 INFO L273 TraceCheckUtils]: 20: Hoare triple {1129#false} ~cond := #in~cond; {1129#false} is VALID [2018-11-23 13:08:18,840 INFO L273 TraceCheckUtils]: 21: Hoare triple {1129#false} assume 0 == ~cond; {1129#false} is VALID [2018-11-23 13:08:18,840 INFO L273 TraceCheckUtils]: 22: Hoare triple {1129#false} assume !false; {1129#false} is VALID [2018-11-23 13:08:18,842 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:08:18,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:18,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 13:08:18,861 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-23 13:08:18,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:18,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:08:18,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:18,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:08:18,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:08:18,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:08:18,889 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 17 states. [2018-11-23 13:08:19,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:19,598 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 13:08:19,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:08:19,599 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-11-23 13:08:19,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:19,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:08:19,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 32 transitions. [2018-11-23 13:08:19,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:08:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 32 transitions. [2018-11-23 13:08:19,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 32 transitions. [2018-11-23 13:08:19,651 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:08:19,653 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:08:19,653 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:08:19,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:08:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:08:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 13:08:19,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:19,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 13:08:19,689 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 13:08:19,690 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 13:08:19,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:19,692 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:08:19,692 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:08:19,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:19,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:19,693 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 13:08:19,693 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 13:08:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:19,694 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 13:08:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:08:19,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:19,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:19,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:19,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:08:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-23 13:08:19,697 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-11-23 13:08:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:19,697 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-23 13:08:19,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:08:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 13:08:19,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:08:19,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:19,698 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:19,698 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:19,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:19,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1355730609, now seen corresponding path program 8 times [2018-11-23 13:08:19,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:19,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:19,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:19,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:19,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:20,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {1368#true} call ULTIMATE.init(); {1368#true} is VALID [2018-11-23 13:08:20,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {1368#true} assume true; {1368#true} is VALID [2018-11-23 13:08:20,385 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1368#true} {1368#true} #31#return; {1368#true} is VALID [2018-11-23 13:08:20,386 INFO L256 TraceCheckUtils]: 3: Hoare triple {1368#true} call #t~ret0 := main(); {1368#true} is VALID [2018-11-23 13:08:20,388 INFO L273 TraceCheckUtils]: 4: Hoare triple {1368#true} ~x~0 := 10; {1370#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:20,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {1370#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1371#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:20,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {1371#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1372#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:20,396 INFO L273 TraceCheckUtils]: 7: Hoare triple {1372#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1373#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:20,398 INFO L273 TraceCheckUtils]: 8: Hoare triple {1373#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1374#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:20,399 INFO L273 TraceCheckUtils]: 9: Hoare triple {1374#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1375#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:20,399 INFO L273 TraceCheckUtils]: 10: Hoare triple {1375#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1376#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:20,402 INFO L273 TraceCheckUtils]: 11: Hoare triple {1376#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1377#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:20,403 INFO L273 TraceCheckUtils]: 12: Hoare triple {1377#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1378#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:20,403 INFO L273 TraceCheckUtils]: 13: Hoare triple {1378#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1379#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:20,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {1379#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1380#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:20,405 INFO L273 TraceCheckUtils]: 15: Hoare triple {1380#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1381#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:20,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {1381#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1382#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:20,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {1382#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1383#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:20,409 INFO L273 TraceCheckUtils]: 18: Hoare triple {1383#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1384#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:08:20,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {1384#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1385#(and (<= (div main_~x~0 4294967296) 0) (<= 40 main_~x~0))} is VALID [2018-11-23 13:08:20,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {1385#(and (<= (div main_~x~0 4294967296) 0) (<= 40 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {1369#false} is VALID [2018-11-23 13:08:20,411 INFO L256 TraceCheckUtils]: 21: Hoare triple {1369#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1369#false} is VALID [2018-11-23 13:08:20,411 INFO L273 TraceCheckUtils]: 22: Hoare triple {1369#false} ~cond := #in~cond; {1369#false} is VALID [2018-11-23 13:08:20,412 INFO L273 TraceCheckUtils]: 23: Hoare triple {1369#false} assume 0 == ~cond; {1369#false} is VALID [2018-11-23 13:08:20,412 INFO L273 TraceCheckUtils]: 24: Hoare triple {1369#false} assume !false; {1369#false} is VALID [2018-11-23 13:08:20,414 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:08:20,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:20,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:20,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:08:20,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:08:20,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:20,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:20,591 INFO L256 TraceCheckUtils]: 0: Hoare triple {1368#true} call ULTIMATE.init(); {1368#true} is VALID [2018-11-23 13:08:20,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {1368#true} assume true; {1368#true} is VALID [2018-11-23 13:08:20,592 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1368#true} {1368#true} #31#return; {1368#true} is VALID [2018-11-23 13:08:20,592 INFO L256 TraceCheckUtils]: 3: Hoare triple {1368#true} call #t~ret0 := main(); {1368#true} is VALID [2018-11-23 13:08:20,593 INFO L273 TraceCheckUtils]: 4: Hoare triple {1368#true} ~x~0 := 10; {1370#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:20,594 INFO L273 TraceCheckUtils]: 5: Hoare triple {1370#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1371#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:20,595 INFO L273 TraceCheckUtils]: 6: Hoare triple {1371#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1372#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:20,596 INFO L273 TraceCheckUtils]: 7: Hoare triple {1372#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1373#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:20,597 INFO L273 TraceCheckUtils]: 8: Hoare triple {1373#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1374#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:20,599 INFO L273 TraceCheckUtils]: 9: Hoare triple {1374#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1375#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:20,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {1375#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1376#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:20,602 INFO L273 TraceCheckUtils]: 11: Hoare triple {1376#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1377#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:20,603 INFO L273 TraceCheckUtils]: 12: Hoare triple {1377#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1378#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:20,604 INFO L273 TraceCheckUtils]: 13: Hoare triple {1378#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1379#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:20,605 INFO L273 TraceCheckUtils]: 14: Hoare triple {1379#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1380#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:20,606 INFO L273 TraceCheckUtils]: 15: Hoare triple {1380#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1381#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:20,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {1381#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1382#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:20,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {1382#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1383#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:20,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {1383#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1384#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:08:20,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {1384#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1446#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:08:20,612 INFO L273 TraceCheckUtils]: 20: Hoare triple {1446#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {1369#false} is VALID [2018-11-23 13:08:20,613 INFO L256 TraceCheckUtils]: 21: Hoare triple {1369#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1369#false} is VALID [2018-11-23 13:08:20,613 INFO L273 TraceCheckUtils]: 22: Hoare triple {1369#false} ~cond := #in~cond; {1369#false} is VALID [2018-11-23 13:08:20,613 INFO L273 TraceCheckUtils]: 23: Hoare triple {1369#false} assume 0 == ~cond; {1369#false} is VALID [2018-11-23 13:08:20,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {1369#false} assume !false; {1369#false} is VALID [2018-11-23 13:08:20,615 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:08:20,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:20,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 13:08:20,635 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2018-11-23 13:08:20,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:20,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:08:20,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:20,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:08:20,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:08:20,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:08:20,671 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 19 states. [2018-11-23 13:08:21,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:21,726 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-23 13:08:21,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:08:21,726 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 25 [2018-11-23 13:08:21,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:08:21,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2018-11-23 13:08:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:08:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 34 transitions. [2018-11-23 13:08:21,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 34 transitions. [2018-11-23 13:08:21,854 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:21,855 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:08:21,855 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:08:21,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:08:21,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:08:21,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:08:21,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:21,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 13:08:21,900 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:08:21,901 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:08:21,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:21,903 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:08:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:08:21,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:21,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:21,904 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:08:21,904 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:08:21,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:21,905 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 13:08:21,905 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:08:21,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:21,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:21,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:21,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:08:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-23 13:08:21,908 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-11-23 13:08:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:21,908 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-23 13:08:21,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:08:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:08:21,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:08:21,909 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:21,910 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:21,910 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:21,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:21,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1646182319, now seen corresponding path program 9 times [2018-11-23 13:08:21,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:21,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:21,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:21,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:21,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:22,526 INFO L256 TraceCheckUtils]: 0: Hoare triple {1628#true} call ULTIMATE.init(); {1628#true} is VALID [2018-11-23 13:08:22,526 INFO L273 TraceCheckUtils]: 1: Hoare triple {1628#true} assume true; {1628#true} is VALID [2018-11-23 13:08:22,527 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1628#true} {1628#true} #31#return; {1628#true} is VALID [2018-11-23 13:08:22,527 INFO L256 TraceCheckUtils]: 3: Hoare triple {1628#true} call #t~ret0 := main(); {1628#true} is VALID [2018-11-23 13:08:22,528 INFO L273 TraceCheckUtils]: 4: Hoare triple {1628#true} ~x~0 := 10; {1630#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:22,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {1630#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1631#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:22,530 INFO L273 TraceCheckUtils]: 6: Hoare triple {1631#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1632#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:22,531 INFO L273 TraceCheckUtils]: 7: Hoare triple {1632#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1633#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:22,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {1633#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1634#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:22,535 INFO L273 TraceCheckUtils]: 9: Hoare triple {1634#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1635#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:22,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {1635#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1636#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:22,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {1636#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1637#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:22,537 INFO L273 TraceCheckUtils]: 12: Hoare triple {1637#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1638#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:22,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {1638#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1639#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:22,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {1639#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1640#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:22,541 INFO L273 TraceCheckUtils]: 15: Hoare triple {1640#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1641#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:22,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {1641#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1642#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:22,543 INFO L273 TraceCheckUtils]: 17: Hoare triple {1642#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1643#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:22,544 INFO L273 TraceCheckUtils]: 18: Hoare triple {1643#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1644#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:08:22,545 INFO L273 TraceCheckUtils]: 19: Hoare triple {1644#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1645#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:08:22,546 INFO L273 TraceCheckUtils]: 20: Hoare triple {1645#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1646#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:08:22,547 INFO L273 TraceCheckUtils]: 21: Hoare triple {1646#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1647#(and (<= 44 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:08:22,548 INFO L273 TraceCheckUtils]: 22: Hoare triple {1647#(and (<= 44 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {1629#false} is VALID [2018-11-23 13:08:22,548 INFO L256 TraceCheckUtils]: 23: Hoare triple {1629#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1629#false} is VALID [2018-11-23 13:08:22,548 INFO L273 TraceCheckUtils]: 24: Hoare triple {1629#false} ~cond := #in~cond; {1629#false} is VALID [2018-11-23 13:08:22,549 INFO L273 TraceCheckUtils]: 25: Hoare triple {1629#false} assume 0 == ~cond; {1629#false} is VALID [2018-11-23 13:08:22,549 INFO L273 TraceCheckUtils]: 26: Hoare triple {1629#false} assume !false; {1629#false} is VALID [2018-11-23 13:08:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:22,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:22,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:22,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:08:23,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 13:08:23,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:24,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:24,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {1628#true} call ULTIMATE.init(); {1628#true} is VALID [2018-11-23 13:08:24,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {1628#true} assume true; {1628#true} is VALID [2018-11-23 13:08:24,251 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1628#true} {1628#true} #31#return; {1628#true} is VALID [2018-11-23 13:08:24,252 INFO L256 TraceCheckUtils]: 3: Hoare triple {1628#true} call #t~ret0 := main(); {1628#true} is VALID [2018-11-23 13:08:24,252 INFO L273 TraceCheckUtils]: 4: Hoare triple {1628#true} ~x~0 := 10; {1630#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:24,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {1630#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1631#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:24,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {1631#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1632#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:24,255 INFO L273 TraceCheckUtils]: 7: Hoare triple {1632#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1633#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:24,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {1633#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1634#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:24,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {1634#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1635#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:24,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {1635#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1636#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:24,258 INFO L273 TraceCheckUtils]: 11: Hoare triple {1636#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1637#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:24,259 INFO L273 TraceCheckUtils]: 12: Hoare triple {1637#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1638#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:24,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {1638#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1639#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:24,267 INFO L273 TraceCheckUtils]: 14: Hoare triple {1639#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1640#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:24,268 INFO L273 TraceCheckUtils]: 15: Hoare triple {1640#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1641#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:24,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {1641#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1642#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:24,269 INFO L273 TraceCheckUtils]: 17: Hoare triple {1642#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1643#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:24,270 INFO L273 TraceCheckUtils]: 18: Hoare triple {1643#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1644#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:08:24,271 INFO L273 TraceCheckUtils]: 19: Hoare triple {1644#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1645#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:08:24,271 INFO L273 TraceCheckUtils]: 20: Hoare triple {1645#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1646#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:08:24,272 INFO L273 TraceCheckUtils]: 21: Hoare triple {1646#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1714#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:08:24,272 INFO L273 TraceCheckUtils]: 22: Hoare triple {1714#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !(~x~0 % 4294967296 >= 10); {1629#false} is VALID [2018-11-23 13:08:24,273 INFO L256 TraceCheckUtils]: 23: Hoare triple {1629#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1629#false} is VALID [2018-11-23 13:08:24,273 INFO L273 TraceCheckUtils]: 24: Hoare triple {1629#false} ~cond := #in~cond; {1629#false} is VALID [2018-11-23 13:08:24,273 INFO L273 TraceCheckUtils]: 25: Hoare triple {1629#false} assume 0 == ~cond; {1629#false} is VALID [2018-11-23 13:08:24,273 INFO L273 TraceCheckUtils]: 26: Hoare triple {1629#false} assume !false; {1629#false} is VALID [2018-11-23 13:08:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:24,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:24,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 13:08:24,294 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-11-23 13:08:24,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:24,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 13:08:24,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:24,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 13:08:24,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:08:24,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:08:24,318 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 21 states. [2018-11-23 13:08:25,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:25,512 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-23 13:08:25,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:08:25,513 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-11-23 13:08:25,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:08:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2018-11-23 13:08:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:08:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2018-11-23 13:08:25,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 36 transitions. [2018-11-23 13:08:25,585 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:08:25,586 INFO L225 Difference]: With dead ends: 35 [2018-11-23 13:08:25,586 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:08:25,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:08:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:08:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 13:08:25,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:25,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 13:08:25,658 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 13:08:25,658 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 13:08:25,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:25,660 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:08:25,660 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:08:25,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:25,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:25,661 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 13:08:25,661 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 13:08:25,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:25,662 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-23 13:08:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:08:25,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:25,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:25,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:25,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:25,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:08:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-23 13:08:25,664 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-11-23 13:08:25,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:25,665 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-23 13:08:25,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 13:08:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-23 13:08:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:08:25,666 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:25,666 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:25,666 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:25,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:25,667 INFO L82 PathProgramCache]: Analyzing trace with hash -266483215, now seen corresponding path program 10 times [2018-11-23 13:08:25,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:25,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:25,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:25,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:25,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:26,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {1908#true} call ULTIMATE.init(); {1908#true} is VALID [2018-11-23 13:08:26,223 INFO L273 TraceCheckUtils]: 1: Hoare triple {1908#true} assume true; {1908#true} is VALID [2018-11-23 13:08:26,224 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1908#true} {1908#true} #31#return; {1908#true} is VALID [2018-11-23 13:08:26,224 INFO L256 TraceCheckUtils]: 3: Hoare triple {1908#true} call #t~ret0 := main(); {1908#true} is VALID [2018-11-23 13:08:26,225 INFO L273 TraceCheckUtils]: 4: Hoare triple {1908#true} ~x~0 := 10; {1910#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:26,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {1910#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1911#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:26,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {1911#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1912#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:26,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {1912#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1913#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:26,229 INFO L273 TraceCheckUtils]: 8: Hoare triple {1913#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1914#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:26,230 INFO L273 TraceCheckUtils]: 9: Hoare triple {1914#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1915#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:26,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {1915#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1916#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:26,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {1916#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1917#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:26,233 INFO L273 TraceCheckUtils]: 12: Hoare triple {1917#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1918#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:26,234 INFO L273 TraceCheckUtils]: 13: Hoare triple {1918#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1919#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:26,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {1919#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1920#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:26,236 INFO L273 TraceCheckUtils]: 15: Hoare triple {1920#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1921#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:26,237 INFO L273 TraceCheckUtils]: 16: Hoare triple {1921#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1922#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:26,238 INFO L273 TraceCheckUtils]: 17: Hoare triple {1922#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1923#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:26,239 INFO L273 TraceCheckUtils]: 18: Hoare triple {1923#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1924#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:08:26,240 INFO L273 TraceCheckUtils]: 19: Hoare triple {1924#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1925#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:08:26,241 INFO L273 TraceCheckUtils]: 20: Hoare triple {1925#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1926#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:08:26,242 INFO L273 TraceCheckUtils]: 21: Hoare triple {1926#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1927#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:08:26,243 INFO L273 TraceCheckUtils]: 22: Hoare triple {1927#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1928#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-23 13:08:26,244 INFO L273 TraceCheckUtils]: 23: Hoare triple {1928#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1929#(and (<= 48 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:08:26,245 INFO L273 TraceCheckUtils]: 24: Hoare triple {1929#(and (<= 48 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {1909#false} is VALID [2018-11-23 13:08:26,245 INFO L256 TraceCheckUtils]: 25: Hoare triple {1909#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1909#false} is VALID [2018-11-23 13:08:26,245 INFO L273 TraceCheckUtils]: 26: Hoare triple {1909#false} ~cond := #in~cond; {1909#false} is VALID [2018-11-23 13:08:26,246 INFO L273 TraceCheckUtils]: 27: Hoare triple {1909#false} assume 0 == ~cond; {1909#false} is VALID [2018-11-23 13:08:26,246 INFO L273 TraceCheckUtils]: 28: Hoare triple {1909#false} assume !false; {1909#false} is VALID [2018-11-23 13:08:26,248 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:08:26,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:26,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:26,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:08:26,271 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:08:26,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:26,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:26,466 INFO L256 TraceCheckUtils]: 0: Hoare triple {1908#true} call ULTIMATE.init(); {1908#true} is VALID [2018-11-23 13:08:26,466 INFO L273 TraceCheckUtils]: 1: Hoare triple {1908#true} assume true; {1908#true} is VALID [2018-11-23 13:08:26,467 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1908#true} {1908#true} #31#return; {1908#true} is VALID [2018-11-23 13:08:26,467 INFO L256 TraceCheckUtils]: 3: Hoare triple {1908#true} call #t~ret0 := main(); {1908#true} is VALID [2018-11-23 13:08:26,470 INFO L273 TraceCheckUtils]: 4: Hoare triple {1908#true} ~x~0 := 10; {1910#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:26,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {1910#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1911#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:26,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {1911#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1912#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:26,472 INFO L273 TraceCheckUtils]: 7: Hoare triple {1912#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1913#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:26,473 INFO L273 TraceCheckUtils]: 8: Hoare triple {1913#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1914#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:26,473 INFO L273 TraceCheckUtils]: 9: Hoare triple {1914#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1915#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:26,474 INFO L273 TraceCheckUtils]: 10: Hoare triple {1915#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1916#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:26,475 INFO L273 TraceCheckUtils]: 11: Hoare triple {1916#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1917#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:26,476 INFO L273 TraceCheckUtils]: 12: Hoare triple {1917#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1918#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:26,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {1918#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1919#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:26,478 INFO L273 TraceCheckUtils]: 14: Hoare triple {1919#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1920#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:26,479 INFO L273 TraceCheckUtils]: 15: Hoare triple {1920#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1921#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:26,480 INFO L273 TraceCheckUtils]: 16: Hoare triple {1921#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1922#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:26,481 INFO L273 TraceCheckUtils]: 17: Hoare triple {1922#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1923#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:26,482 INFO L273 TraceCheckUtils]: 18: Hoare triple {1923#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1924#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:08:26,483 INFO L273 TraceCheckUtils]: 19: Hoare triple {1924#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1925#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:08:26,484 INFO L273 TraceCheckUtils]: 20: Hoare triple {1925#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1926#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:08:26,485 INFO L273 TraceCheckUtils]: 21: Hoare triple {1926#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1927#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:08:26,486 INFO L273 TraceCheckUtils]: 22: Hoare triple {1927#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1928#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-23 13:08:26,487 INFO L273 TraceCheckUtils]: 23: Hoare triple {1928#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2002#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-23 13:08:26,487 INFO L273 TraceCheckUtils]: 24: Hoare triple {2002#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume !(~x~0 % 4294967296 >= 10); {1909#false} is VALID [2018-11-23 13:08:26,488 INFO L256 TraceCheckUtils]: 25: Hoare triple {1909#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1909#false} is VALID [2018-11-23 13:08:26,488 INFO L273 TraceCheckUtils]: 26: Hoare triple {1909#false} ~cond := #in~cond; {1909#false} is VALID [2018-11-23 13:08:26,488 INFO L273 TraceCheckUtils]: 27: Hoare triple {1909#false} assume 0 == ~cond; {1909#false} is VALID [2018-11-23 13:08:26,488 INFO L273 TraceCheckUtils]: 28: Hoare triple {1909#false} assume !false; {1909#false} is VALID [2018-11-23 13:08:26,490 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:08:26,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:26,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 13:08:26,519 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-11-23 13:08:26,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:26,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:08:26,579 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:08:26,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:08:26,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:08:26,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:08:26,580 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 23 states. [2018-11-23 13:08:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:27,795 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 13:08:27,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:08:27,796 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-11-23 13:08:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:08:27,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2018-11-23 13:08:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:08:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 38 transitions. [2018-11-23 13:08:27,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 38 transitions. [2018-11-23 13:08:27,838 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:27,839 INFO L225 Difference]: With dead ends: 37 [2018-11-23 13:08:27,839 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:08:27,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:08:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:08:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 13:08:27,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:27,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 13:08:27,880 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 13:08:27,880 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 13:08:27,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:27,881 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:08:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:08:27,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:27,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:27,882 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 13:08:27,882 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 13:08:27,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:27,884 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-11-23 13:08:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:08:27,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:27,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:27,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:27,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:08:27,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-11-23 13:08:27,885 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-11-23 13:08:27,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:27,886 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-11-23 13:08:27,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:08:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-11-23 13:08:27,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 13:08:27,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:27,887 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:27,887 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:27,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:27,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1520538735, now seen corresponding path program 11 times [2018-11-23 13:08:27,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:27,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:27,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:27,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:27,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:28,943 INFO L256 TraceCheckUtils]: 0: Hoare triple {2208#true} call ULTIMATE.init(); {2208#true} is VALID [2018-11-23 13:08:28,943 INFO L273 TraceCheckUtils]: 1: Hoare triple {2208#true} assume true; {2208#true} is VALID [2018-11-23 13:08:28,943 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2208#true} {2208#true} #31#return; {2208#true} is VALID [2018-11-23 13:08:28,943 INFO L256 TraceCheckUtils]: 3: Hoare triple {2208#true} call #t~ret0 := main(); {2208#true} is VALID [2018-11-23 13:08:28,944 INFO L273 TraceCheckUtils]: 4: Hoare triple {2208#true} ~x~0 := 10; {2210#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:08:28,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {2210#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2211#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:08:28,945 INFO L273 TraceCheckUtils]: 6: Hoare triple {2211#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2212#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:08:28,946 INFO L273 TraceCheckUtils]: 7: Hoare triple {2212#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2213#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:08:28,947 INFO L273 TraceCheckUtils]: 8: Hoare triple {2213#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2214#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:08:28,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {2214#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2215#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:08:28,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {2215#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2216#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:08:28,949 INFO L273 TraceCheckUtils]: 11: Hoare triple {2216#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2217#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:08:28,950 INFO L273 TraceCheckUtils]: 12: Hoare triple {2217#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2218#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:08:28,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {2218#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2219#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:08:28,952 INFO L273 TraceCheckUtils]: 14: Hoare triple {2219#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2220#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:08:28,953 INFO L273 TraceCheckUtils]: 15: Hoare triple {2220#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2221#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:08:28,954 INFO L273 TraceCheckUtils]: 16: Hoare triple {2221#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2222#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:08:28,955 INFO L273 TraceCheckUtils]: 17: Hoare triple {2222#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2223#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:08:28,956 INFO L273 TraceCheckUtils]: 18: Hoare triple {2223#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2224#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:08:28,957 INFO L273 TraceCheckUtils]: 19: Hoare triple {2224#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2225#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:08:28,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {2225#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2226#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:08:28,959 INFO L273 TraceCheckUtils]: 21: Hoare triple {2226#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2227#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:08:28,960 INFO L273 TraceCheckUtils]: 22: Hoare triple {2227#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2228#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-23 13:08:28,961 INFO L273 TraceCheckUtils]: 23: Hoare triple {2228#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2229#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-23 13:08:28,962 INFO L273 TraceCheckUtils]: 24: Hoare triple {2229#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2230#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-23 13:08:28,963 INFO L273 TraceCheckUtils]: 25: Hoare triple {2230#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2231#(and (<= (div main_~x~0 4294967296) 0) (<= 52 main_~x~0))} is VALID [2018-11-23 13:08:28,964 INFO L273 TraceCheckUtils]: 26: Hoare triple {2231#(and (<= (div main_~x~0 4294967296) 0) (<= 52 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {2209#false} is VALID [2018-11-23 13:08:28,965 INFO L256 TraceCheckUtils]: 27: Hoare triple {2209#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2209#false} is VALID [2018-11-23 13:08:28,965 INFO L273 TraceCheckUtils]: 28: Hoare triple {2209#false} ~cond := #in~cond; {2209#false} is VALID [2018-11-23 13:08:28,965 INFO L273 TraceCheckUtils]: 29: Hoare triple {2209#false} assume 0 == ~cond; {2209#false} is VALID [2018-11-23 13:08:28,965 INFO L273 TraceCheckUtils]: 30: Hoare triple {2209#false} assume !false; {2209#false} is VALID [2018-11-23 13:08:28,968 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:28,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:28,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:28,981 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:10:16,330 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 13:10:16,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:16,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:16,580 INFO L256 TraceCheckUtils]: 0: Hoare triple {2208#true} call ULTIMATE.init(); {2208#true} is VALID [2018-11-23 13:10:16,581 INFO L273 TraceCheckUtils]: 1: Hoare triple {2208#true} assume true; {2208#true} is VALID [2018-11-23 13:10:16,581 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2208#true} {2208#true} #31#return; {2208#true} is VALID [2018-11-23 13:10:16,581 INFO L256 TraceCheckUtils]: 3: Hoare triple {2208#true} call #t~ret0 := main(); {2208#true} is VALID [2018-11-23 13:10:16,582 INFO L273 TraceCheckUtils]: 4: Hoare triple {2208#true} ~x~0 := 10; {2210#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:10:16,582 INFO L273 TraceCheckUtils]: 5: Hoare triple {2210#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2211#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:10:16,583 INFO L273 TraceCheckUtils]: 6: Hoare triple {2211#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2212#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:10:16,584 INFO L273 TraceCheckUtils]: 7: Hoare triple {2212#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2213#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:10:16,585 INFO L273 TraceCheckUtils]: 8: Hoare triple {2213#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2214#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:10:16,586 INFO L273 TraceCheckUtils]: 9: Hoare triple {2214#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2215#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:10:16,587 INFO L273 TraceCheckUtils]: 10: Hoare triple {2215#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2216#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:10:16,587 INFO L273 TraceCheckUtils]: 11: Hoare triple {2216#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2217#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:10:16,588 INFO L273 TraceCheckUtils]: 12: Hoare triple {2217#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2218#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:10:16,589 INFO L273 TraceCheckUtils]: 13: Hoare triple {2218#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2219#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:10:16,590 INFO L273 TraceCheckUtils]: 14: Hoare triple {2219#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2220#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:10:16,591 INFO L273 TraceCheckUtils]: 15: Hoare triple {2220#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2221#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:10:16,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {2221#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2222#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:10:16,593 INFO L273 TraceCheckUtils]: 17: Hoare triple {2222#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2223#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:10:16,594 INFO L273 TraceCheckUtils]: 18: Hoare triple {2223#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2224#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:10:16,595 INFO L273 TraceCheckUtils]: 19: Hoare triple {2224#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2225#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:10:16,596 INFO L273 TraceCheckUtils]: 20: Hoare triple {2225#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2226#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:10:16,597 INFO L273 TraceCheckUtils]: 21: Hoare triple {2226#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2227#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:10:16,598 INFO L273 TraceCheckUtils]: 22: Hoare triple {2227#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2228#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-23 13:10:16,599 INFO L273 TraceCheckUtils]: 23: Hoare triple {2228#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2229#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-23 13:10:16,600 INFO L273 TraceCheckUtils]: 24: Hoare triple {2229#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2230#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-23 13:10:16,601 INFO L273 TraceCheckUtils]: 25: Hoare triple {2230#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2310#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2018-11-23 13:10:16,601 INFO L273 TraceCheckUtils]: 26: Hoare triple {2310#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {2209#false} is VALID [2018-11-23 13:10:16,602 INFO L256 TraceCheckUtils]: 27: Hoare triple {2209#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2209#false} is VALID [2018-11-23 13:10:16,602 INFO L273 TraceCheckUtils]: 28: Hoare triple {2209#false} ~cond := #in~cond; {2209#false} is VALID [2018-11-23 13:10:16,602 INFO L273 TraceCheckUtils]: 29: Hoare triple {2209#false} assume 0 == ~cond; {2209#false} is VALID [2018-11-23 13:10:16,602 INFO L273 TraceCheckUtils]: 30: Hoare triple {2209#false} assume !false; {2209#false} is VALID [2018-11-23 13:10:16,604 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:10:16,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:16,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 13:10:16,627 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-11-23 13:10:16,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:16,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 13:10:16,653 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:10:16,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 13:10:16,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:10:16,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:10:16,655 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2018-11-23 13:10:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:18,399 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-23 13:10:18,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 13:10:18,399 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-11-23 13:10:18,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:10:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2018-11-23 13:10:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:10:18,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 40 transitions. [2018-11-23 13:10:18,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 40 transitions. [2018-11-23 13:10:18,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:18,451 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:10:18,451 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:10:18,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:10:18,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:10:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 13:10:18,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:18,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 13:10:18,499 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 13:10:18,499 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 13:10:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:18,500 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:10:18,500 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:10:18,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:18,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:18,501 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 13:10:18,501 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 13:10:18,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:18,502 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 13:10:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:10:18,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:18,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:18,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:18,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:10:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-23 13:10:18,503 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-11-23 13:10:18,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:18,504 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-23 13:10:18,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 13:10:18,504 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 13:10:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:10:18,504 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:18,505 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:18,505 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:18,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:18,505 INFO L82 PathProgramCache]: Analyzing trace with hash 217916721, now seen corresponding path program 12 times [2018-11-23 13:10:18,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:18,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:18,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:18,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:18,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:19,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {2528#true} call ULTIMATE.init(); {2528#true} is VALID [2018-11-23 13:10:19,117 INFO L273 TraceCheckUtils]: 1: Hoare triple {2528#true} assume true; {2528#true} is VALID [2018-11-23 13:10:19,117 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2528#true} {2528#true} #31#return; {2528#true} is VALID [2018-11-23 13:10:19,117 INFO L256 TraceCheckUtils]: 3: Hoare triple {2528#true} call #t~ret0 := main(); {2528#true} is VALID [2018-11-23 13:10:19,117 INFO L273 TraceCheckUtils]: 4: Hoare triple {2528#true} ~x~0 := 10; {2530#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:10:19,118 INFO L273 TraceCheckUtils]: 5: Hoare triple {2530#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2531#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:10:19,119 INFO L273 TraceCheckUtils]: 6: Hoare triple {2531#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2532#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:10:19,119 INFO L273 TraceCheckUtils]: 7: Hoare triple {2532#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2533#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:10:19,120 INFO L273 TraceCheckUtils]: 8: Hoare triple {2533#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2534#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:10:19,121 INFO L273 TraceCheckUtils]: 9: Hoare triple {2534#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2535#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:10:19,122 INFO L273 TraceCheckUtils]: 10: Hoare triple {2535#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2536#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:10:19,123 INFO L273 TraceCheckUtils]: 11: Hoare triple {2536#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2537#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:10:19,124 INFO L273 TraceCheckUtils]: 12: Hoare triple {2537#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2538#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:10:19,125 INFO L273 TraceCheckUtils]: 13: Hoare triple {2538#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2539#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:10:19,126 INFO L273 TraceCheckUtils]: 14: Hoare triple {2539#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2540#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:10:19,127 INFO L273 TraceCheckUtils]: 15: Hoare triple {2540#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2541#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:10:19,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {2541#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2542#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:10:19,129 INFO L273 TraceCheckUtils]: 17: Hoare triple {2542#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2543#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:10:19,129 INFO L273 TraceCheckUtils]: 18: Hoare triple {2543#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2544#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:10:19,130 INFO L273 TraceCheckUtils]: 19: Hoare triple {2544#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2545#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:10:19,131 INFO L273 TraceCheckUtils]: 20: Hoare triple {2545#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2546#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:10:19,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {2546#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2547#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:10:19,134 INFO L273 TraceCheckUtils]: 22: Hoare triple {2547#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2548#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-23 13:10:19,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {2548#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2549#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-23 13:10:19,136 INFO L273 TraceCheckUtils]: 24: Hoare triple {2549#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2550#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-23 13:10:19,137 INFO L273 TraceCheckUtils]: 25: Hoare triple {2550#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2551#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2018-11-23 13:10:19,138 INFO L273 TraceCheckUtils]: 26: Hoare triple {2551#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2552#(and (<= 54 main_~x~0) (<= main_~x~0 54))} is VALID [2018-11-23 13:10:19,139 INFO L273 TraceCheckUtils]: 27: Hoare triple {2552#(and (<= 54 main_~x~0) (<= main_~x~0 54))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2553#(and (<= (div main_~x~0 4294967296) 0) (<= 56 main_~x~0))} is VALID [2018-11-23 13:10:19,140 INFO L273 TraceCheckUtils]: 28: Hoare triple {2553#(and (<= (div main_~x~0 4294967296) 0) (<= 56 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {2529#false} is VALID [2018-11-23 13:10:19,140 INFO L256 TraceCheckUtils]: 29: Hoare triple {2529#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2529#false} is VALID [2018-11-23 13:10:19,140 INFO L273 TraceCheckUtils]: 30: Hoare triple {2529#false} ~cond := #in~cond; {2529#false} is VALID [2018-11-23 13:10:19,140 INFO L273 TraceCheckUtils]: 31: Hoare triple {2529#false} assume 0 == ~cond; {2529#false} is VALID [2018-11-23 13:10:19,141 INFO L273 TraceCheckUtils]: 32: Hoare triple {2529#false} assume !false; {2529#false} is VALID [2018-11-23 13:10:19,143 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:10:19,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:19,143 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:10:19,151 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:11:02,371 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 13:11:02,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:02,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:02,880 INFO L256 TraceCheckUtils]: 0: Hoare triple {2528#true} call ULTIMATE.init(); {2528#true} is VALID [2018-11-23 13:11:02,881 INFO L273 TraceCheckUtils]: 1: Hoare triple {2528#true} assume true; {2528#true} is VALID [2018-11-23 13:11:02,881 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2528#true} {2528#true} #31#return; {2528#true} is VALID [2018-11-23 13:11:02,881 INFO L256 TraceCheckUtils]: 3: Hoare triple {2528#true} call #t~ret0 := main(); {2528#true} is VALID [2018-11-23 13:11:02,881 INFO L273 TraceCheckUtils]: 4: Hoare triple {2528#true} ~x~0 := 10; {2530#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:11:02,882 INFO L273 TraceCheckUtils]: 5: Hoare triple {2530#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2531#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:11:02,883 INFO L273 TraceCheckUtils]: 6: Hoare triple {2531#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2532#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:11:02,885 INFO L273 TraceCheckUtils]: 7: Hoare triple {2532#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2533#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:11:02,894 INFO L273 TraceCheckUtils]: 8: Hoare triple {2533#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2534#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:11:02,899 INFO L273 TraceCheckUtils]: 9: Hoare triple {2534#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2535#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:11:02,900 INFO L273 TraceCheckUtils]: 10: Hoare triple {2535#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2536#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:11:02,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {2536#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2537#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:11:02,901 INFO L273 TraceCheckUtils]: 12: Hoare triple {2537#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2538#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:11:02,902 INFO L273 TraceCheckUtils]: 13: Hoare triple {2538#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2539#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:11:02,903 INFO L273 TraceCheckUtils]: 14: Hoare triple {2539#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2540#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:11:02,904 INFO L273 TraceCheckUtils]: 15: Hoare triple {2540#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2541#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:11:02,905 INFO L273 TraceCheckUtils]: 16: Hoare triple {2541#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2542#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:11:02,906 INFO L273 TraceCheckUtils]: 17: Hoare triple {2542#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2543#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:11:02,907 INFO L273 TraceCheckUtils]: 18: Hoare triple {2543#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2544#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:11:02,908 INFO L273 TraceCheckUtils]: 19: Hoare triple {2544#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2545#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:11:02,909 INFO L273 TraceCheckUtils]: 20: Hoare triple {2545#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2546#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:11:02,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {2546#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2547#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:11:02,911 INFO L273 TraceCheckUtils]: 22: Hoare triple {2547#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2548#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-23 13:11:02,912 INFO L273 TraceCheckUtils]: 23: Hoare triple {2548#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2549#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-23 13:11:02,913 INFO L273 TraceCheckUtils]: 24: Hoare triple {2549#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2550#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-23 13:11:02,914 INFO L273 TraceCheckUtils]: 25: Hoare triple {2550#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2551#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2018-11-23 13:11:02,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {2551#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2552#(and (<= 54 main_~x~0) (<= main_~x~0 54))} is VALID [2018-11-23 13:11:02,916 INFO L273 TraceCheckUtils]: 27: Hoare triple {2552#(and (<= 54 main_~x~0) (<= main_~x~0 54))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2638#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2018-11-23 13:11:02,917 INFO L273 TraceCheckUtils]: 28: Hoare triple {2638#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {2529#false} is VALID [2018-11-23 13:11:02,917 INFO L256 TraceCheckUtils]: 29: Hoare triple {2529#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2529#false} is VALID [2018-11-23 13:11:02,917 INFO L273 TraceCheckUtils]: 30: Hoare triple {2529#false} ~cond := #in~cond; {2529#false} is VALID [2018-11-23 13:11:02,918 INFO L273 TraceCheckUtils]: 31: Hoare triple {2529#false} assume 0 == ~cond; {2529#false} is VALID [2018-11-23 13:11:02,918 INFO L273 TraceCheckUtils]: 32: Hoare triple {2529#false} assume !false; {2529#false} is VALID [2018-11-23 13:11:02,921 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:02,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:02,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 13:11:02,927 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2018-11-23 13:11:02,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:02,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 13:11:02,960 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:11:02,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 13:11:02,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 13:11:02,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:11:02,962 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 27 states. [2018-11-23 13:11:04,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:04,911 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 13:11:04,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 13:11:04,911 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 33 [2018-11-23 13:11:04,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:11:04,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2018-11-23 13:11:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:11:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2018-11-23 13:11:04,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 42 transitions. [2018-11-23 13:11:04,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:04,953 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:11:04,954 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 13:11:04,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:11:04,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 13:11:04,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 13:11:04,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:04,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 13:11:04,998 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 13:11:04,998 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 13:11:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:05,000 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:11:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:11:05,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:05,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:05,001 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 13:11:05,001 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 13:11:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:05,002 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 13:11:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:11:05,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:05,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:05,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:05,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:11:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-23 13:11:05,003 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-11-23 13:11:05,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:05,004 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-23 13:11:05,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 13:11:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 13:11:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:11:05,004 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:05,004 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:05,005 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:05,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:05,005 INFO L82 PathProgramCache]: Analyzing trace with hash 131331793, now seen corresponding path program 13 times [2018-11-23 13:11:05,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:05,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:05,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:05,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:05,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:06,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {2868#true} call ULTIMATE.init(); {2868#true} is VALID [2018-11-23 13:11:06,393 INFO L273 TraceCheckUtils]: 1: Hoare triple {2868#true} assume true; {2868#true} is VALID [2018-11-23 13:11:06,394 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2868#true} {2868#true} #31#return; {2868#true} is VALID [2018-11-23 13:11:06,394 INFO L256 TraceCheckUtils]: 3: Hoare triple {2868#true} call #t~ret0 := main(); {2868#true} is VALID [2018-11-23 13:11:06,394 INFO L273 TraceCheckUtils]: 4: Hoare triple {2868#true} ~x~0 := 10; {2870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:11:06,395 INFO L273 TraceCheckUtils]: 5: Hoare triple {2870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:11:06,395 INFO L273 TraceCheckUtils]: 6: Hoare triple {2871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2872#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:11:06,396 INFO L273 TraceCheckUtils]: 7: Hoare triple {2872#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:11:06,396 INFO L273 TraceCheckUtils]: 8: Hoare triple {2873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2874#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:11:06,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {2874#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2875#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:11:06,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {2875#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2876#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:11:06,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {2876#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2877#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:11:06,399 INFO L273 TraceCheckUtils]: 12: Hoare triple {2877#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2878#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:11:06,400 INFO L273 TraceCheckUtils]: 13: Hoare triple {2878#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2879#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:11:06,401 INFO L273 TraceCheckUtils]: 14: Hoare triple {2879#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2880#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:11:06,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {2880#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2881#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:11:06,403 INFO L273 TraceCheckUtils]: 16: Hoare triple {2881#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2882#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:11:06,404 INFO L273 TraceCheckUtils]: 17: Hoare triple {2882#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2883#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:11:06,405 INFO L273 TraceCheckUtils]: 18: Hoare triple {2883#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2884#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:11:06,406 INFO L273 TraceCheckUtils]: 19: Hoare triple {2884#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2885#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:11:06,407 INFO L273 TraceCheckUtils]: 20: Hoare triple {2885#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2886#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:11:06,408 INFO L273 TraceCheckUtils]: 21: Hoare triple {2886#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2887#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:11:06,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {2887#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2888#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-23 13:11:06,409 INFO L273 TraceCheckUtils]: 23: Hoare triple {2888#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2889#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-23 13:11:06,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {2889#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2890#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-23 13:11:06,411 INFO L273 TraceCheckUtils]: 25: Hoare triple {2890#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2891#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2018-11-23 13:11:06,412 INFO L273 TraceCheckUtils]: 26: Hoare triple {2891#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2892#(and (<= 54 main_~x~0) (<= main_~x~0 54))} is VALID [2018-11-23 13:11:06,413 INFO L273 TraceCheckUtils]: 27: Hoare triple {2892#(and (<= 54 main_~x~0) (<= main_~x~0 54))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2893#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2018-11-23 13:11:06,414 INFO L273 TraceCheckUtils]: 28: Hoare triple {2893#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2894#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2018-11-23 13:11:06,415 INFO L273 TraceCheckUtils]: 29: Hoare triple {2894#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2895#(and (<= (div main_~x~0 4294967296) 0) (<= 60 main_~x~0))} is VALID [2018-11-23 13:11:06,416 INFO L273 TraceCheckUtils]: 30: Hoare triple {2895#(and (<= (div main_~x~0 4294967296) 0) (<= 60 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {2869#false} is VALID [2018-11-23 13:11:06,416 INFO L256 TraceCheckUtils]: 31: Hoare triple {2869#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2869#false} is VALID [2018-11-23 13:11:06,416 INFO L273 TraceCheckUtils]: 32: Hoare triple {2869#false} ~cond := #in~cond; {2869#false} is VALID [2018-11-23 13:11:06,417 INFO L273 TraceCheckUtils]: 33: Hoare triple {2869#false} assume 0 == ~cond; {2869#false} is VALID [2018-11-23 13:11:06,417 INFO L273 TraceCheckUtils]: 34: Hoare triple {2869#false} assume !false; {2869#false} is VALID [2018-11-23 13:11:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:06,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:06,420 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:11:06,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:06,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:06,672 INFO L256 TraceCheckUtils]: 0: Hoare triple {2868#true} call ULTIMATE.init(); {2868#true} is VALID [2018-11-23 13:11:06,672 INFO L273 TraceCheckUtils]: 1: Hoare triple {2868#true} assume true; {2868#true} is VALID [2018-11-23 13:11:06,672 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2868#true} {2868#true} #31#return; {2868#true} is VALID [2018-11-23 13:11:06,673 INFO L256 TraceCheckUtils]: 3: Hoare triple {2868#true} call #t~ret0 := main(); {2868#true} is VALID [2018-11-23 13:11:06,673 INFO L273 TraceCheckUtils]: 4: Hoare triple {2868#true} ~x~0 := 10; {2870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:11:06,674 INFO L273 TraceCheckUtils]: 5: Hoare triple {2870#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:11:06,674 INFO L273 TraceCheckUtils]: 6: Hoare triple {2871#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2872#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:11:06,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {2872#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:11:06,676 INFO L273 TraceCheckUtils]: 8: Hoare triple {2873#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2874#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:11:06,676 INFO L273 TraceCheckUtils]: 9: Hoare triple {2874#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2875#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:11:06,677 INFO L273 TraceCheckUtils]: 10: Hoare triple {2875#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2876#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:11:06,678 INFO L273 TraceCheckUtils]: 11: Hoare triple {2876#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2877#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:11:06,679 INFO L273 TraceCheckUtils]: 12: Hoare triple {2877#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2878#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:11:06,680 INFO L273 TraceCheckUtils]: 13: Hoare triple {2878#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2879#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:11:06,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {2879#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2880#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:11:06,682 INFO L273 TraceCheckUtils]: 15: Hoare triple {2880#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2881#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:11:06,683 INFO L273 TraceCheckUtils]: 16: Hoare triple {2881#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2882#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:11:06,683 INFO L273 TraceCheckUtils]: 17: Hoare triple {2882#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2883#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:11:06,684 INFO L273 TraceCheckUtils]: 18: Hoare triple {2883#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2884#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:11:06,685 INFO L273 TraceCheckUtils]: 19: Hoare triple {2884#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2885#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:11:06,686 INFO L273 TraceCheckUtils]: 20: Hoare triple {2885#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2886#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:11:06,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {2886#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2887#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:11:06,688 INFO L273 TraceCheckUtils]: 22: Hoare triple {2887#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2888#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-23 13:11:06,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {2888#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2889#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-23 13:11:06,690 INFO L273 TraceCheckUtils]: 24: Hoare triple {2889#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2890#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-23 13:11:06,691 INFO L273 TraceCheckUtils]: 25: Hoare triple {2890#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2891#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2018-11-23 13:11:06,692 INFO L273 TraceCheckUtils]: 26: Hoare triple {2891#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2892#(and (<= 54 main_~x~0) (<= main_~x~0 54))} is VALID [2018-11-23 13:11:06,693 INFO L273 TraceCheckUtils]: 27: Hoare triple {2892#(and (<= 54 main_~x~0) (<= main_~x~0 54))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2893#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2018-11-23 13:11:06,694 INFO L273 TraceCheckUtils]: 28: Hoare triple {2893#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2894#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2018-11-23 13:11:06,694 INFO L273 TraceCheckUtils]: 29: Hoare triple {2894#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2986#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2018-11-23 13:11:06,695 INFO L273 TraceCheckUtils]: 30: Hoare triple {2986#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {2869#false} is VALID [2018-11-23 13:11:06,696 INFO L256 TraceCheckUtils]: 31: Hoare triple {2869#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2869#false} is VALID [2018-11-23 13:11:06,696 INFO L273 TraceCheckUtils]: 32: Hoare triple {2869#false} ~cond := #in~cond; {2869#false} is VALID [2018-11-23 13:11:06,696 INFO L273 TraceCheckUtils]: 33: Hoare triple {2869#false} assume 0 == ~cond; {2869#false} is VALID [2018-11-23 13:11:06,696 INFO L273 TraceCheckUtils]: 34: Hoare triple {2869#false} assume !false; {2869#false} is VALID [2018-11-23 13:11:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:06,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:06,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 13:11:06,717 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2018-11-23 13:11:06,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:06,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 13:11:06,745 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:06,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 13:11:06,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:11:06,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:11:06,746 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 29 states. [2018-11-23 13:11:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:09,148 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 13:11:09,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 13:11:09,152 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2018-11-23 13:11:09,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:11:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2018-11-23 13:11:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:11:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2018-11-23 13:11:09,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 44 transitions. [2018-11-23 13:11:09,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:09,240 INFO L225 Difference]: With dead ends: 43 [2018-11-23 13:11:09,240 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:11:09,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:11:09,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:11:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 13:11:09,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:09,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 13:11:09,351 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 13:11:09,351 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 13:11:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:09,353 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:11:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:11:09,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:09,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:09,353 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 13:11:09,353 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 13:11:09,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:09,354 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 13:11:09,355 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:11:09,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:09,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:09,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:09,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:11:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-23 13:11:09,356 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-11-23 13:11:09,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:09,357 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-23 13:11:09,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 13:11:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-23 13:11:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 13:11:09,357 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:09,357 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:09,358 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:09,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:09,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1472405391, now seen corresponding path program 14 times [2018-11-23 13:11:09,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:09,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:09,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:09,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:11:09,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:10,165 INFO L256 TraceCheckUtils]: 0: Hoare triple {3228#true} call ULTIMATE.init(); {3228#true} is VALID [2018-11-23 13:11:10,166 INFO L273 TraceCheckUtils]: 1: Hoare triple {3228#true} assume true; {3228#true} is VALID [2018-11-23 13:11:10,166 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3228#true} {3228#true} #31#return; {3228#true} is VALID [2018-11-23 13:11:10,166 INFO L256 TraceCheckUtils]: 3: Hoare triple {3228#true} call #t~ret0 := main(); {3228#true} is VALID [2018-11-23 13:11:10,166 INFO L273 TraceCheckUtils]: 4: Hoare triple {3228#true} ~x~0 := 10; {3230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:11:10,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {3230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3231#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:11:10,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {3231#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3232#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:11:10,168 INFO L273 TraceCheckUtils]: 7: Hoare triple {3232#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3233#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:11:10,169 INFO L273 TraceCheckUtils]: 8: Hoare triple {3233#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3234#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:11:10,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {3234#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3235#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:11:10,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {3235#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3236#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:11:10,172 INFO L273 TraceCheckUtils]: 11: Hoare triple {3236#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3237#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:11:10,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {3237#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3238#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:11:10,174 INFO L273 TraceCheckUtils]: 13: Hoare triple {3238#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3239#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:11:10,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {3239#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3240#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:11:10,176 INFO L273 TraceCheckUtils]: 15: Hoare triple {3240#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3241#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:11:10,177 INFO L273 TraceCheckUtils]: 16: Hoare triple {3241#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3242#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:11:10,178 INFO L273 TraceCheckUtils]: 17: Hoare triple {3242#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3243#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:11:10,179 INFO L273 TraceCheckUtils]: 18: Hoare triple {3243#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3244#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:11:10,180 INFO L273 TraceCheckUtils]: 19: Hoare triple {3244#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3245#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:11:10,181 INFO L273 TraceCheckUtils]: 20: Hoare triple {3245#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3246#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:11:10,182 INFO L273 TraceCheckUtils]: 21: Hoare triple {3246#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3247#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:11:10,183 INFO L273 TraceCheckUtils]: 22: Hoare triple {3247#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3248#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-23 13:11:10,184 INFO L273 TraceCheckUtils]: 23: Hoare triple {3248#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3249#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-23 13:11:10,185 INFO L273 TraceCheckUtils]: 24: Hoare triple {3249#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3250#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-23 13:11:10,186 INFO L273 TraceCheckUtils]: 25: Hoare triple {3250#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3251#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2018-11-23 13:11:10,187 INFO L273 TraceCheckUtils]: 26: Hoare triple {3251#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3252#(and (<= 54 main_~x~0) (<= main_~x~0 54))} is VALID [2018-11-23 13:11:10,188 INFO L273 TraceCheckUtils]: 27: Hoare triple {3252#(and (<= 54 main_~x~0) (<= main_~x~0 54))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3253#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2018-11-23 13:11:10,189 INFO L273 TraceCheckUtils]: 28: Hoare triple {3253#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3254#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2018-11-23 13:11:10,190 INFO L273 TraceCheckUtils]: 29: Hoare triple {3254#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3255#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2018-11-23 13:11:10,191 INFO L273 TraceCheckUtils]: 30: Hoare triple {3255#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3256#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2018-11-23 13:11:10,192 INFO L273 TraceCheckUtils]: 31: Hoare triple {3256#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3257#(and (<= 64 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:11:10,193 INFO L273 TraceCheckUtils]: 32: Hoare triple {3257#(and (<= 64 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {3229#false} is VALID [2018-11-23 13:11:10,193 INFO L256 TraceCheckUtils]: 33: Hoare triple {3229#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3229#false} is VALID [2018-11-23 13:11:10,193 INFO L273 TraceCheckUtils]: 34: Hoare triple {3229#false} ~cond := #in~cond; {3229#false} is VALID [2018-11-23 13:11:10,194 INFO L273 TraceCheckUtils]: 35: Hoare triple {3229#false} assume 0 == ~cond; {3229#false} is VALID [2018-11-23 13:11:10,194 INFO L273 TraceCheckUtils]: 36: Hoare triple {3229#false} assume !false; {3229#false} is VALID [2018-11-23 13:11:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:10,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:10,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 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:11:10,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:11:10,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:11:10,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:10,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:10,437 INFO L256 TraceCheckUtils]: 0: Hoare triple {3228#true} call ULTIMATE.init(); {3228#true} is VALID [2018-11-23 13:11:10,437 INFO L273 TraceCheckUtils]: 1: Hoare triple {3228#true} assume true; {3228#true} is VALID [2018-11-23 13:11:10,437 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3228#true} {3228#true} #31#return; {3228#true} is VALID [2018-11-23 13:11:10,438 INFO L256 TraceCheckUtils]: 3: Hoare triple {3228#true} call #t~ret0 := main(); {3228#true} is VALID [2018-11-23 13:11:10,438 INFO L273 TraceCheckUtils]: 4: Hoare triple {3228#true} ~x~0 := 10; {3230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:11:10,439 INFO L273 TraceCheckUtils]: 5: Hoare triple {3230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3231#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:11:10,439 INFO L273 TraceCheckUtils]: 6: Hoare triple {3231#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3232#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:11:10,440 INFO L273 TraceCheckUtils]: 7: Hoare triple {3232#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3233#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:11:10,440 INFO L273 TraceCheckUtils]: 8: Hoare triple {3233#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3234#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:11:10,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {3234#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3235#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:11:10,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {3235#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3236#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:11:10,443 INFO L273 TraceCheckUtils]: 11: Hoare triple {3236#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3237#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:11:10,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {3237#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3238#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:11:10,445 INFO L273 TraceCheckUtils]: 13: Hoare triple {3238#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3239#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:11:10,446 INFO L273 TraceCheckUtils]: 14: Hoare triple {3239#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3240#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:11:10,447 INFO L273 TraceCheckUtils]: 15: Hoare triple {3240#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3241#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:11:10,466 INFO L273 TraceCheckUtils]: 16: Hoare triple {3241#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3242#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:11:10,470 INFO L273 TraceCheckUtils]: 17: Hoare triple {3242#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3243#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:11:10,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {3243#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3244#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:11:10,472 INFO L273 TraceCheckUtils]: 19: Hoare triple {3244#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3245#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:11:10,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {3245#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3246#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:11:10,473 INFO L273 TraceCheckUtils]: 21: Hoare triple {3246#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3247#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:11:10,473 INFO L273 TraceCheckUtils]: 22: Hoare triple {3247#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3248#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-23 13:11:10,474 INFO L273 TraceCheckUtils]: 23: Hoare triple {3248#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3249#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-23 13:11:10,474 INFO L273 TraceCheckUtils]: 24: Hoare triple {3249#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3250#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-23 13:11:10,475 INFO L273 TraceCheckUtils]: 25: Hoare triple {3250#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3251#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2018-11-23 13:11:10,476 INFO L273 TraceCheckUtils]: 26: Hoare triple {3251#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3252#(and (<= 54 main_~x~0) (<= main_~x~0 54))} is VALID [2018-11-23 13:11:10,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {3252#(and (<= 54 main_~x~0) (<= main_~x~0 54))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3253#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2018-11-23 13:11:10,478 INFO L273 TraceCheckUtils]: 28: Hoare triple {3253#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3254#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2018-11-23 13:11:10,479 INFO L273 TraceCheckUtils]: 29: Hoare triple {3254#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3255#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2018-11-23 13:11:10,484 INFO L273 TraceCheckUtils]: 30: Hoare triple {3255#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3256#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2018-11-23 13:11:10,484 INFO L273 TraceCheckUtils]: 31: Hoare triple {3256#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3354#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2018-11-23 13:11:10,485 INFO L273 TraceCheckUtils]: 32: Hoare triple {3354#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {3229#false} is VALID [2018-11-23 13:11:10,485 INFO L256 TraceCheckUtils]: 33: Hoare triple {3229#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3229#false} is VALID [2018-11-23 13:11:10,485 INFO L273 TraceCheckUtils]: 34: Hoare triple {3229#false} ~cond := #in~cond; {3229#false} is VALID [2018-11-23 13:11:10,485 INFO L273 TraceCheckUtils]: 35: Hoare triple {3229#false} assume 0 == ~cond; {3229#false} is VALID [2018-11-23 13:11:10,485 INFO L273 TraceCheckUtils]: 36: Hoare triple {3229#false} assume !false; {3229#false} is VALID [2018-11-23 13:11:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:10,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:10,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 13:11:10,508 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2018-11-23 13:11:10,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:10,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 13:11:10,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:10,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 13:11:10,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 13:11:10,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:11:10,541 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 31 states. [2018-11-23 13:11:13,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:13,457 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-23 13:11:13,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 13:11:13,457 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2018-11-23 13:11:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:13,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:11:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2018-11-23 13:11:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:11:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2018-11-23 13:11:13,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 46 transitions. [2018-11-23 13:11:13,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:13,499 INFO L225 Difference]: With dead ends: 45 [2018-11-23 13:11:13,500 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:11:13,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:11:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:11:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 13:11:13,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:13,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 13:11:13,557 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 13:11:13,558 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 13:11:13,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:13,559 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:11:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:11:13,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:13,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:13,559 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 13:11:13,559 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 13:11:13,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:13,560 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-11-23 13:11:13,560 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:11:13,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:13,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:13,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:13,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:13,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:11:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-11-23 13:11:13,562 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-11-23 13:11:13,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:13,562 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-11-23 13:11:13,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 13:11:13,562 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-11-23 13:11:13,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 13:11:13,562 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:13,563 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:13,563 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:13,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:13,563 INFO L82 PathProgramCache]: Analyzing trace with hash -770579951, now seen corresponding path program 15 times [2018-11-23 13:11:13,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:13,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:13,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:13,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:13,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:14,588 INFO L256 TraceCheckUtils]: 0: Hoare triple {3608#true} call ULTIMATE.init(); {3608#true} is VALID [2018-11-23 13:11:14,588 INFO L273 TraceCheckUtils]: 1: Hoare triple {3608#true} assume true; {3608#true} is VALID [2018-11-23 13:11:14,589 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3608#true} {3608#true} #31#return; {3608#true} is VALID [2018-11-23 13:11:14,589 INFO L256 TraceCheckUtils]: 3: Hoare triple {3608#true} call #t~ret0 := main(); {3608#true} is VALID [2018-11-23 13:11:14,590 INFO L273 TraceCheckUtils]: 4: Hoare triple {3608#true} ~x~0 := 10; {3610#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-23 13:11:14,590 INFO L273 TraceCheckUtils]: 5: Hoare triple {3610#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3611#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-23 13:11:14,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {3611#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3612#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-23 13:11:14,592 INFO L273 TraceCheckUtils]: 7: Hoare triple {3612#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3613#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-23 13:11:14,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {3613#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3614#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-23 13:11:14,593 INFO L273 TraceCheckUtils]: 9: Hoare triple {3614#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3615#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-23 13:11:14,593 INFO L273 TraceCheckUtils]: 10: Hoare triple {3615#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3616#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-23 13:11:14,594 INFO L273 TraceCheckUtils]: 11: Hoare triple {3616#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3617#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-23 13:11:14,595 INFO L273 TraceCheckUtils]: 12: Hoare triple {3617#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3618#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-23 13:11:14,596 INFO L273 TraceCheckUtils]: 13: Hoare triple {3618#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3619#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-23 13:11:14,597 INFO L273 TraceCheckUtils]: 14: Hoare triple {3619#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3620#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-23 13:11:14,598 INFO L273 TraceCheckUtils]: 15: Hoare triple {3620#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3621#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-23 13:11:14,599 INFO L273 TraceCheckUtils]: 16: Hoare triple {3621#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3622#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-23 13:11:14,600 INFO L273 TraceCheckUtils]: 17: Hoare triple {3622#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3623#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-23 13:11:14,601 INFO L273 TraceCheckUtils]: 18: Hoare triple {3623#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3624#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-23 13:11:14,602 INFO L273 TraceCheckUtils]: 19: Hoare triple {3624#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3625#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-23 13:11:14,603 INFO L273 TraceCheckUtils]: 20: Hoare triple {3625#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3626#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-23 13:11:14,604 INFO L273 TraceCheckUtils]: 21: Hoare triple {3626#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3627#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-23 13:11:14,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {3627#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3628#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-23 13:11:14,606 INFO L273 TraceCheckUtils]: 23: Hoare triple {3628#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3629#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-23 13:11:14,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {3629#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3630#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-23 13:11:14,608 INFO L273 TraceCheckUtils]: 25: Hoare triple {3630#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3631#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2018-11-23 13:11:14,608 INFO L273 TraceCheckUtils]: 26: Hoare triple {3631#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3632#(and (<= 54 main_~x~0) (<= main_~x~0 54))} is VALID [2018-11-23 13:11:14,609 INFO L273 TraceCheckUtils]: 27: Hoare triple {3632#(and (<= 54 main_~x~0) (<= main_~x~0 54))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3633#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2018-11-23 13:11:14,610 INFO L273 TraceCheckUtils]: 28: Hoare triple {3633#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3634#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2018-11-23 13:11:14,611 INFO L273 TraceCheckUtils]: 29: Hoare triple {3634#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3635#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2018-11-23 13:11:14,612 INFO L273 TraceCheckUtils]: 30: Hoare triple {3635#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3636#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2018-11-23 13:11:14,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {3636#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3637#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2018-11-23 13:11:14,614 INFO L273 TraceCheckUtils]: 32: Hoare triple {3637#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3638#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2018-11-23 13:11:14,615 INFO L273 TraceCheckUtils]: 33: Hoare triple {3638#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3639#(and (<= 68 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-23 13:11:14,616 INFO L273 TraceCheckUtils]: 34: Hoare triple {3639#(and (<= 68 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {3609#false} is VALID [2018-11-23 13:11:14,616 INFO L256 TraceCheckUtils]: 35: Hoare triple {3609#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3609#false} is VALID [2018-11-23 13:11:14,616 INFO L273 TraceCheckUtils]: 36: Hoare triple {3609#false} ~cond := #in~cond; {3609#false} is VALID [2018-11-23 13:11:14,617 INFO L273 TraceCheckUtils]: 37: Hoare triple {3609#false} assume 0 == ~cond; {3609#false} is VALID [2018-11-23 13:11:14,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {3609#false} assume !false; {3609#false} is VALID [2018-11-23 13:11:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:14,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:14,620 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:11:14,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2